Match the algorithm/problem in Column-I with its corresponding design strategy in Column-II: Column-I: (a) Prim's algorithm for minimum spanning tree (b) Floyd-Warshall algorithm for all-pair shortest paths (c) Merge Sort (d) Hamiltonian circuit Column-II: (i) Backtracking (ii) Greedy method (iii) Dynamic programming (iv) Divide and Conquer

Question

Computer Science · Design and Analysis of Algorithms

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Design and Analysis of Algorithms?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Design and Analysis of Algorithms

The Dandi March, also known as the Salt Satyagraha, was led by which influential leader?

Which act formally granted independence to India, marking the end of British rule?

Who was the key figure in establishing the Indian National Congress?

Answer 1

(a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)

Answer 2

(a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)

Answer 3

(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)

Answer 4

(a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)

Related Practice Questions