Time Left - 15:00 mins
GATE CS 2021 : Algorithms Quiz 2
Attempt now to get your rank among 903 students!
Question 1
Match the following recurrence relations with their time complexities.
Question 2
For parameters a and b, both of which are T(n) = T(n1/a) + 1, and T(b)=1. Then T(n) is:
Question 3
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?
Question 4
Which of the following is asymptotically smaller?
Question 5
For the given recurrence equation
T(n) = 2T(n - 1), if n > 0 = 1, otherwise
Question 6
Let f(n) = Ω(n), g(n) = Ο(n) and h(n) = θ(n). Then [f(n) . g(n)] + h(n) is _______.
- 903 attempts
- 3 upvotes
- 13 comments
Tags :
GATE & PSU CSAlgorithmsMay 2GATE & PSU CS