Exploring Dijkstra's Algorithm

What is the primary purpose of Dijkstra's Algorithm?

• To find the shortest path between two nodes in a graph

• To sort elements in a list

• To multiply matrices

• To solve linear equations

In Dijkstra's Algorithm, what data structure is commonly used to keep track of the next node to visit?

• Stack

• Queue

• Priority Queue

• Linked List

How are graphs typically represented when implementing Dijkstra's Algorithm?

• Adjacency Matrix

• Adjacency List

• Both A and B

• Incidence Matrix

What is the time complexity of Dijkstra's Algorithm when using a priority queue implemented with a binary heap?

Which of the following is a limitation of Dijkstra's Algorithm?

• It cannot handle graphs with negative weight edges

• It is not efficient for dense graphs

• It cannot find the shortest path in unweighted graphs

• It requires a directed graph

Which of the following is a real-world application of Dijkstra's Algorithm?

• Sorting a list of numbers

• Finding the shortest driving route on a map

• Encrypting data

• Balancing a chemical equation

How does Dijkstra's Algorithm differ from the Bellman-Ford Algorithm?

• Dijkstra's is faster but cannot handle negative weights

• Bellman-Ford is faster and can handle negative weights

• Both have the same time complexity

• Dijkstra's can handle negative weights, Bellman-Ford cannot

What is the initial step in Dijkstra's Algorithm?

• Set all node distances to infinity except the start node

• Set all node distances to zero

• Randomly select a node as the start

• Sort all nodes by their weights

Which of the following is NOT a characteristic of Dijkstra's Algorithm?

• Greedy approach

• Dynamic programming

• Uses a priority queue

• Backtracking

What is the main difference between Dijkstra's Algorithm and A* Algorithm?

• A* uses heuristics to improve performance

• Dijkstra's is used for sorting

• A* cannot handle weighted graphs

• Dijkstra's is used for unweighted graphs only