Computer Science · Algorithms
Match List-I (Algorithms) with List-II (Time Complexity, where n = |V| and m = |E|): List-I A. Bellman-Ford algorithm (with adjacency list) B. Dijkstra's Algorithm (with binary heap) C. Prim's Algorithm (with adjacency matrix) D. Topological sorting (with adjacency list) List-II I. O(n2) II. O((n + m) log n) III. O(nm) IV. O(n + m) Choose the correct matching sequence:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-II, B-I, C-III, D-IV
- 2A-III, B-IV, C-I, D-II
- 3A-II, B-IV, C-III, D-I
- 4A-III, B-II, C-I, D-IV✓
Correct answer
A-III, B-II, C-I, D-IV
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms