Computer Science · Design and Analysis of Algorithms
The worst-case time complexity of an algorithm is given by the recurrence relation T(n) = 4Tn2 + n2. What is the tight asymptotic bound for T(n)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Θ(n2)
- 2Θ(n2 log n)✓
- 3Θ(n3)
- 4Θ(n log n)
Correct answer
Θ(n2 log n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms