Computer Science · Algorithms
Which of the following is the correct solution for the given recurrence relation using Master's Theorem? T(n) = 3T(n/4) + n log(n)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Θ(n log log n)
- 2Θ(n log2 n)✓
- 3Θ(n2 log n)
- 4Θ(n log n)
Correct answer
Θ(n log2 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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms