Data Structures and Algorithms Quiz

Find the odd one out

A)Prim’s Minimal Spanning Tree Algorithm

B) Kruskal’s Minimal Spanning Tree Algorithm

C) Floyd-Warshall’s All pair shortest path Algorithm

D) Dijkstra’s Minimal Spanning Tree Algorithm

Solution :

C) is correct.

Floyd-Warshall’s All pair shortest path Algorithm uses dynamic programming approach. All other mentioned algorithms use greedy programming approach

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

Learn more at Placewit. Follow us on Instagram and Facebook for daily learning.