Aspire Faculty ID #11729 · Topic: CUET 2024 · Just now
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:

Previous 10 Questions — CUET 2024

Nearest first

Next 10 Questions — CUET 2024

Ascending by ID
Ask Your Question or Put Your Review.

loading...