Dijkstra Algorithm MCQ Test: Dijkstra Algorithm MCQs - Practice Questions
1. How does Dijkstra's algorithm handle graphs with disconnected components?
2. In the context of Dijkstra's algorithm, what does 'SPT' stand for?
3. What scenario would make Dijkstra's algorithm less efficient?
4. How does the choice of initial vertex impact the results of Dijkstra's algorithm?
5. What is the main drawback of Dijkstra's algorithm?
6. Which algorithm is an alternative to Dijkstra's algorithm for graphs with negative edge weights?
7. What is the time complexity of Dijkstra's algorithm with an adjacency matrix representation?
8. What is the purpose of the priority queue in Dijkstra's algorithm?
9. How does Dijkstra's algorithm handle graphs with unconnected vertices?
10. What modification is needed in Dijkstra's algorithm to handle graphs with negative edge weights?