Graph Algorithms Quiz - Batch 1

Which algorithm is used to find the best route for a delivery truck?

• A. Dijkstra's Algorithm

• B. Prim's Algorithm

• C. Floyd-Warshall Algorithm

• D. Bellman-Ford Algorithm

In a school competition, which data structure is used to keep track of the students waiting in line to participate?

• A. Stack

• B. Queue

• C. Priority Queue

• D. Linked List

Which of the following is a characteristic of a hiking trail?

• A. It is marked with red flags

• B. It explores all terrains at the present depth first

• C. It leads to the highest peak

• D. It always follows the shortest path

What is the purpose of the union-find data structure in Kruskal's algorithm?

• A. To sort the edges

• B. To manage connected components and detect cycles

• C. To find the shortest path

• D. To keep track of node degrees

In a school competition, which data structure is commonly used to select the next student with the highest score?

• A. Sneha

• B. Arnav

• C. Alisha

• D. Linked List

Which algorithm can detect a cycle in a social network?

• A. Kruskal's Algorithm

• B. Prim's Algorithm

• C. DFS

• D. BFS

In a city map representation of a road network, what does a non-zero value at matrix[i][j] indicate?

• A. There is no road between location i and location j

• B. There is a road between location i and location j

• C. Location i and location j are the same

• D. Location i has the minimum traffic

What is the purpose of path compression in the union-find algorithm?

• A. To reduce the depth of the tree

• B. To keep track of the number of edges

• C. To find the shortest path

• D. To sort the vertices

In which situation does Kruskal's algorithm become less efficient compared to Prim's algorithm?

• A. When the network has a large number of nodes

• B. When the network has a small number of nodes

• C. When the network has many interconnected components

• D. When the network has directed edges

Which data structure is used to implement DFS in a coding competition?

• A. Stack

• B. Queue

• C. Priority Queue

• D. Linked List