Computer Science · Data Structures and Algorithms
Match the algorithms in List I with their characteristics in List II: LIST - ILIST - IIA. Dijkstra's AlgorithmI. Calculates path matrix (All-pairs shortest path/transitive closure)B. Prim's AlgorithmII. Component-based growing of a single tree by selecting minimum weight edges connected to the treeC. Warshall's AlgorithmIII. Stores and updates the total cost from a source node to the current nodeD. Kruskal's algorithmIV. Finds Minimum Spanning Tree by sorting all edges globally Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - I, B - II, C - III, D - IV
- 2A - III, B - II, C - I, D - IV✓
- 3A - II, B - I, C - IV, D - III
- 4A - III, B - IV, C - II, D - I
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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms