Which one of the following correctly determines the solution of the recurrence…

GATE · 2014 · CS · Set 2 · Computer Science & IT

Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? ܶ

T(n)=2T(n2)+log nT(n) = 2T(\frac {n} {2}) + log \ n

  1. A.

    θ(n)\theta (n)

  2. B.

    θ(n log n)\theta (n \ log \ n)

  3. C.

    θ(n2)\theta (n^2)

  4. D.

    θ(log n)\theta (log \ n)

Attempted by 307 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…