Question Details

T1(n) = 4T1 n2 +nlog45. Which is true?

Options

A

T 1 ( n ) = θ ( n 2 )

B

T1(n)=θ(nlog⁴n)

C

T1(n)=θ(nlog45logn)


D

T1(n)=θ(n2logn)

Show Answer
Correct Answer
A
T 1 ( n ) = θ ( n 2 )

Solution :

The correct option is:
T 1 ( n ) = θ ( n 2 )

Step-by-Step Explanation:
The given recurrence relation is:
T 1 ( n ) = 4 T 1 n 2 + n log 4 5

We can analyze this recurrence relation using the Master Theorem, which is applicable to recurrences of the form:
T ( n ) = a T n b + f ( n )

By comparing the terms, we identify the parameters:
- Coefficient of the recursive term, a = 4
- Dividing factor of the input size, b = 2
- Non-recursive cost function, f(n) = nlog4(5)

Next, we compute the critical exponent value:
n log b a = n log 2 4 = n 2

Now we compare f(n) = nlog4(5) with nlogb(a) = n2.
Since 4 < 5 < 16, we know that:
1 < log 4 5 < 2

The value of log4(5) is approximately 1.161. Since 1.161 is strictly less than 2, the non-recursive part grows strictly slower than n2:
f ( n ) = O n 2 - ε
for a constant ε = 2 - log4(5) ≈ 0.839 > 0.

According to Case 1 of the Master Theorem, when the recursive work dominates the non-recursive overhead, the overall time complexity is determined by the recursive work:
T 1 ( n ) = θ n log b a = θ ( n 2 )

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • GATE
  • beginner
  • 3 hours
  • computer science and information technology

Prepare effectively for GATE 2026 Computer Science & Information Technology (CS & IT) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Data Structures, Algorithms, Operating Systems, DBMS, Computer Networks, Theory of Computation, Compiler Design, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 preparation strategy.

  • GATE
  • intermediate
  • 3 hours
  • computer science and information technology

Prepare for GATE 2026 Electrical Engineering (EE) with high-quality study material, previous year question papers, mock tests, syllabus updates, exam pattern, and expert preparation strategies. Master core EE subjects including Power Systems, Control Systems, Electrical Machines, Circuit Theory, Signals & Systems, Power Electronics, and Measurements to secure a top rank in GATE 2026.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: