Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Match List - I with List - II.
|
List - I (Recurrence Relations) |
List - II (Complexity) |
||
|
A. |
T(n) = 2T(n/2) + n |
I. |
T(n) = θ(n logn) (exact solution} |
|
B. |
T(n) = T(n/2) + 1 |
II. |
O(n2) |
|
C. |
T(n) = 2T(n/2) + 1 |
III. |
T(n) = θ(n) {exact solution} |
|
D. |
T(n) =T(n - 1) + 1 |
IV. |
O(n) |
Choose the correct answer from the options given below:
1
(A) - (I), (B) - (IV), (C) - (III), (D) - (II)
2
(A) - (IV), (B) - (II), (C) - (I), (D) - (III)
3
(A) - (I), (B) - (III), (C) - (IV), (D) - (II)
4
(A) - (III), (B) - (I), (C) - (IV), (D) - (II)