Match List-I with List-II: List-I (Algorithm) (a) Knuth-Morris-Pratt (b) Fast Fourier Transform (c) Floyd-Warshall (d) Longest Common Subsequence List-II (Time Complexity) (i) Θ(n) (ii) Θ(n2) (iii) Θ(n lg n) (iv) Θ(n3)

Question

Computer Science · Design and Analysis of Algorithms

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

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

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

Who among the following founded the 'Forward Bloc'?

Which of the following statements regarding the Harappan Civilization is NOT correct?

Which ruler is generally credited with unifying much of Northern India under a single empire for the first time?

Answer 1

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

Answer 2

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

Answer 3

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

Answer 4

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

Related Practice Questions