Match List – I with List – II List - I (Algorithms) List - II (Complexity)...

Aspire's Library

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

Best NIMCET Coaching
Aspire Study
Online Classes, Classroom Classes
and More.

Question Id : 11729 | Context :CUET 2024

Match List – I with List – II

List - I (Algorithms)	List - II (Complexity)
(A) Bellman - Ford algorithm (with adjacencylist representation)	(I) $O(\|V\|^2)$
(B) Dijkstra Algorithm	(II) O((V+E) logV)
(C) Prim’s Algorithm	(III) O(mn)
(D) Topological sorting (with adjacency list representation)	(IV) O(m+n)

Choose the correct answer from the options given below:

🎥 Video solution / Text Solution of this question is given below:

Get MCA exam-wise questions, solutions, test series & updates instantly on your phone.

🚀 Install Now

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

Click Here to
View More

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

Ask Your Question or Put Your Review.