• Tutorials
  • Courses
  • Tracks

Greedy Algorithms Quiz

Last Updated :
Discuss
Comments

Question 1

Which of the following standard algorithms is not a Greedy algorithm?
  • Dijkstra's shortest path algorithm
  • Prim's algorithm
  • Kruskal algorithm
  • Huffman Coding
  • Bellmen Ford Shortest path algorithm
Discuss it

Question 2

Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
 

 

  • P, Q, R, S, T, U

  • P, Q, R, U, S, T

  • P, Q, R, U, T, S

  • P, Q, T, R, U, S

Discuss it

There are 22 questions to complete.

Take a part in the ongoing discussion