Match List - I with List - II. List - I (Recurrence Relations) (A) T(n) =…
UGC NET 2024Modified — slightly modified from the official paper; see the solution
Match List - I with List - II.
List - I (Recurrence Relations)
(A) T(n) = 2T(n/2) + n
(B) T(n) = 2T(n/2) + 1
(C) T(n) = T(n/2) + 1
(D) T(n) = T(n-1) + 1
List - II (Complexity)
(I) T(n) = Θ(n log n) [exact solution]
(II) O(n²)
(III) T(n) = Θ(n) [exact solution]
(IV) O(n)
Choose the correct answer from the options given below :
- A.
(A)-(I), (B)-(IV), (C)-(III), (D)-(II)
- B.
(A)-(IV), (B)-(III), (C)-(I), (D)-(II)
- C.
(A)-(I), (B)-(III), (C)-(IV), (D)-(II)
- D.
(A)-(III), (B)-(I), (C)-(IV), (D)-(II)
Attempted by 134 students.
Sign up free to check your answer
Sign up freeLoading lesson…

