UGC NET Computer Science December 2019 | Question 89

Question 89

---

Give asymptotic upper and lower bound for T(n) given below. Assume T(n) is constant for n<2 .="" br="">T(n)=4T(√n) + lg²n

1. 1. T(n) = θ(lg (lg²n)lg n)
2. 2. Tln)= θ(lg²n lg n)
3. 3. T(n)= θ(lg²n lg lg n)
4. 4. T(n)= θ(lg(lg n)lg n)

Answer :

Explanation

Option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 88	UGC NET CS December 2019 - Question 90