GATE Computer Science (CS) 2014 Shift 2 Solved Paper

© examsiri.com
Question : 23 of 65
 
Marks: +1, -0
Which one of the following correctly determines the solution of the recurrence relation with
T(1) = 1?
T(n)=2T(n2)+logn
Go to Question: