Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Aspire Study - Best NIMCET Coaching

🎯 Crack NIMCET with Aspire Study

🔹 India's Most Trusted MCA Coaching
💻 Live + Recorded Classes | 👨‍🏫 Expert Faculty
📝 All India Test Series | 🎯 Personal Mentorship

🥈 NIMCET AIR 2: Ayush Garg

🚀 Join Aspire Now

📂 Aspire Study Library

Question Id : 17495 | Context : UGC NET Computer Science August 2024 (Paper II)
Match List-I with List-II.
 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

 
Choose the correct answer from the options given below.

Aspire Study Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
📲
Ask Your Question or Put Your Review.

loading...