Question 1
Which of the following best describes the time complexity of Prim's algorithm when using a priority queue?
Question 2
In the context of Dijkstra's algorithm, what does the term 'relaxation' refer to?
Question 3
Which of the following statements is true regarding the correctness of greedy algorithms?
Question 4
What is the primary criterion for selecting the next edge in Kruskal's algorithm?
Question 5
In Dijkstra's algorithm, what is the role of the priority queue?
