GateQA is a free GATE CS preparation platform featuring 3,500+ previous-year questions (1987–2026),
36,000+ aptitude questions, subject-wise and year-wise mock tests, performance analytics,
and full offline support. Practice Operating Systems, Algorithms, DBMS, Computer Networks,
Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, and more.
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); }
Answer: D
This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.