Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Which of the following algorithms use the Greedy strategy?
A. Dijkstra’s algorithm
B. Kruskal’s algorithm
C. Huffman coding
D. Bellman-Ford algorithm
Solution
Dijkstra’s algorithm ✅ — Uses greedy approach to select the next minimum-distance vertex.
Kruskal’s algorithm ✅ — Uses greedy strategy to build Minimum Spanning Tree (MST).
Huffman coding ✅ — Greedy algorithm for constructing optimal prefix codes.
Bellman-Ford algorithm ❌ — Uses dynamic programming, not greedy.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
