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)
Match List-I with List-II.
Choose the correct answer from the options given below.
| List-I | List-II |
| A. Dijkstra’s Algorithm | I. Find the shortest path between all pairs of vertices in a graph with positive or negative edge weights |
| B. Floyd-Warshall Algorithm | II. Finds the shortest path in a weighted graph with non-negative edge weights |
| C. Bellman-Ford Algorithm | III. Sorts elements by repeatedly moving them past neighboring elements that are smaller |
| D. Prim’s Algorithm | IV. Determines the strongly connected components in a directed graph |
Solution
Dijkstra Algorithm → shortest path with non-negative weights
Floyd-Warshall → all pairs shortest paths
Bellman-Ford → handles negative edge weights
Prim → Minimum Spanning Tree
Thus correct matching:
A → II
B → I
Remaining pair becomes
C → IV
D → III
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.
