Q1: 1. What is the main goal of Dijkstra's algorithm?

• A) A. To find the longest path between two nodes
• B) B. To find the shortest path between two nodes
• C) C. To find all possible paths between two nodes
• D) D. To find the most visited node in a graph

Q2: 2. In a transportation network, Dijkstra's algorithm can be used to find the shortest route between

• A) A. Two airports
• B) B. Two train stations
• C) C. Two cities
• D) D. Two supermarkets

Q3: 3. Which data structure is typically used in implementing Dijkstra's algorithm?

• A) A. Stack
• B) B. Queue
• C) C. Heap
• D) D. Array

Q4: 4. Dijkstra's algorithm is an example of a

• A) A. Greedy algorithm
• B) B. Dynamic programming algorithm
• C) C. Backtracking algorithm
• D) D. Divide and conquer algorithm

Q5: 5. In a social network, Dijkstra's algorithm can be used to find the shortest path between

• A) A. Two friends
• B) B. Two photos
• C) C. Two posts
• D) D. Two events

Q6: 6. Which step is essential in Dijkstra's algorithm?

• A) A. Initialization
• B) B. Termination
• C) C. Sorting
• D) D. Reversing

Q7: 7. Dijkstra's algorithm is used to solve which type of problem?

• A) A. Sorting problem
• B) B. Path-finding problem
• C) C. Encryption problem
• D) D. Database problem

Q8: 8. In a road network, Dijkstra's algorithm can be applied to find the shortest path between

• A) A. Two traffic signals
• B) B. Two gas stations
• C) C. Two restaurants
• D) D. Two intersections

Q9: 9. Which property of Dijkstra's algorithm ensures the optimal solution is found?

• A) A. Optimal Substructure
• B) B. Greedy Choice Property
• C) C. Overlapping Subproblems
• D) D. Dynamic Programming Property

Q10: 10. Dijkstra's algorithm is commonly used in

• A) A. Image processing
• B) B. Speech recognition
• C) C. Network routing
• D) D. Robotics

Q11: 11. A delivery service can utilize Dijkstra's algorithm to find the shortest path between

• A) A. Two warehouses
• B) B. Two customers
• C) C. Two delivery trucks
• D) D. Two packages

Q12: 12. Which data structure is used to keep track of the shortest distance from the source node in Dijkstra's algorithm?

• A) A. Array
• B) B. Stack
• C) C. List
• D) D. Priority queue

Q13: 13. Dijkstra's algorithm is particularly useful in

• A) A. Finding the best movie to watch
• B) B. Scheduling tasks
• C) C. Calculating mortgage rates
• D) D. Solving the traveling salesman problem

Q14: 14. In a computer network, Dijkstra's algorithm can be employed to determine the shortest path between

• A) A. Two servers
• B) B. Two websites
• C) C. Two files
• D) D. Two users

Q15: 15. The runtime complexity of Dijkstra's algorithm is

• A) A. O(n)
• B) B. O(n log n)
• C) C. O(n^2)
• D) D. O(n log n + m)

Q16: 16. A telecom company can use Dijkstra's algorithm to find the shortest path between

• A) A. Two cell towers
• B) B. Two text messages
• C) C. Two phone calls
• D) D. Two data plans

Q17: 17. The main advantage of Dijkstra's algorithm is

• A) A. It guarantees the shortest path is found
• B) B. It is easy to implement
• C) C. It can handle negative edge weights
• D) D. It is suitable for all types of graphs

Q18: 18. In a supply chain network, Dijkstra's algorithm can be utilized to find the shortest path between

• A) A. Two factories
• B) B. Two products
• C) C. Two shipments
• D) D. Two invoices

Q19: 19. Which step is repeated in Dijkstra's algorithm until all nodes are visited?

• A) A. Initialization
• B) B. Relaxation
• C) C. Termination
• D) D. Sorting

Q20: 20. Dijkstra's algorithm is used to solve the single-source shortest path problem for

• A) A. Directed graphs with negative edge weights
• B) B. Undirected graphs with cycles
• C) C. Weighted graphs with positive edge weights
• D) D. Unweighted graphs

Q21: 21. A navigation app can employ Dijkstra's algorithm to find the quickest route between

• A) A. Two landmarks
• B) B. Two weather forecasts
• C) C. Two traffic lights
• D) D. Two street names

Q22: 22. Which step is crucial for updating the shortest distance in Dijkstra's algorithm?

• A) A. Initialization
• B) B. Termination
• C) C. Relaxation
• D) D. Sorting

Q23: 23. Dijkstra's algorithm can be applied in a gaming environment to find the shortest path between

• A) A. Two players
• B) B. Two levels
• C) C. Two power-ups
• D) D. Two high scores

Q24: 24. In a financial network, Dijkstra's algorithm can be used to determine the shortest path between

• A) A. Two bank branches
• B) B. Two credit cards
• C) C. Two transactions
• D) D. Two account balances

Q25: 25. Which step is necessary to ensure the correct shortest path is found in Dijkstra's algorithm?

• A) A. Initialization
• B) B. Termination
• C) C. Relaxation
• D) D. Sorting