Home Rankers PYQ Blogs Pricing About Contact
Home > PYQ Blogs > CUET-MCA 2024 Paper > Question 58

Question 58

Computer Awareness Graphs Hard

Match List - I with List - II

section*{List - I (Algorithms)}
(A) Bellman - Ford algorithm (with adjacencylist representation)
(B) Dijkstra Algorithm
(C) Prim's Algorithm
(D) Topological sorting (with adjacency list representation)


{List - II (Complexity)}
(I) \( \mathrm{O}\left(|\mathrm{V}|^{2}\right) \)
(II) \( \mathrm{O}((\mathrm{V}+\mathrm{E}) \log \mathrm{V}) \)
(III) \( \mathrm{O}(\mathrm{nm}) \)
(IV) \( \mathrm{O}(\mathrm{n}+\mathrm{m}) \)

(A) [(A - III); (B - I); (C - II); (D - IV)]
(B) [(A - II); (B - IV); (C - III); (D - I)]
(C) \( [(\mathrm{A}-\mathrm{III}) ;(\mathrm{B}-\mathrm{IV}) ;(\mathrm{C}-\mathrm{I}) ;(\mathrm{D}-\mathrm{II})] \)
(D) \( [(\mathrm{A}-\mathrm{II}) ; \) (B - I); (C - III); (D - IV)]
✓ Correct Answer: Option A Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

### Final Matching: | List - I (Algorithms) | List - II (Complexity) |
|---------------------------|---------------------------|
| (A) Bellman-Ford | (III) \( O(VE) \) |
| (B) Dijkstra | (I) \( O((V^2)) \) |
| (C) Prim's | (II) \( O((V+E) \log V) \) |
| (D) Topological Sorting | (IV) \( O(V+E) \) |

← Previous Question Our Rankers Next Question →

Practice Similar Graphs Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2024:

Q1 Which one of the following data structures are preferred in database...
Solve →
Q5 \[ |l l| List - I & List - II \\ (A) Asynchronous & (II) The operation is...
Solve →
Q6 Consider a system with 1 K pages and 512 frames and each page is of size 2...
Solve →
Q8 Each node is having a successor node in \( \) :
Solve →
Q9 How does the number of page frames affect and number of page faults for a...
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →