ECE Ph.D. Qualifying Exam
Computer Engineering (CE)
Question 1: Algorithms
August 2013
Part 1. Assume the run time for some algorithm is given by the following recurrence: $ \begin{equation} T(n) = 2T(\sqrt[]{n}) + \log n \end{equation} $
