The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged mastertheorem
0
votes
1
answer
1
Uttrakhand Asst. Professor Exam62
asked
Mar 2
in
Others
by
gatecse
Veteran
(
19.7k
points)

19
views
uttarakhandasstprof2018
algorithms
recurrence
mastertheorem
+1
vote
1
answer
2
recurrence using Master theorem
asked
Jan 11
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

97
views
algorithms
mastertheorem
timecomplexity
recurrence
asymptoticnotations
+3
votes
0
answers
3
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
asked
Jan 8
in
Algorithms
by
anoop yadav 2
(
107
points)

188
views
algorithms
mastertheorem
recurrence
timecomplexity
recursion
+2
votes
0
answers
4
Master theorem and extended Master theorem
asked
Jan 8
in
Algorithms
by
Sona Barman
Active
(
2.2k
points)

70
views
algorithms
mastertheorem
timecomplexity
+2
votes
1
answer
5
Ace Test Series
asked
Jan 6
in
Algorithms
by
smsubham
Boss
(
6.9k
points)

64
views
acetestseries
timecomplexity
mastertheorem
+1
vote
1
answer
6
Master Theorem
T(n) = 2T(n/2) + nlogn a. O(nlogn) b.n(log^2n) c.O(n^2)
asked
Dec 19, 2017
in
Algorithms
by
ashwina
Active
(
2.3k
points)

68
views
algorithms
mastertheorem
timecomplexity
0
votes
0
answers
7
Master theorem
T(n) = T(n1) + n In which case it falls ??
asked
Nov 22, 2017
in
Algorithms
by
aka 53
(
355
points)

54
views
algorithms
timecomplexity
mastertheorem
0
votes
1
answer
8
self doubt apply
can masters theorem be used when base condition is given in a recurrence ? can we directly apply masters theorem to any recurrence ?
asked
Nov 3, 2017
in
Algorithms
by
Venkat Sai
Loyal
(
3.2k
points)

36
views
algorithms
mastertheorem
+1
vote
1
answer
9
Master Theorem
asked
Oct 15, 2017
in
Algorithms
by
ashwina
Active
(
2.3k
points)

94
views
algorithms
mastertheorem
timecomplexity
+2
votes
1
answer
10
master theorem
explain complexity for this
asked
Aug 17, 2017
in
Algorithms
by
set2018
Boss
(
8.7k
points)

129
views
algorithms
mastertheorem
timecomplexity
+1
vote
1
answer
11
master theorem
is the time complexity for this fuction is O(n)?
asked
Aug 17, 2017
in
Algorithms
by
set2018
Boss
(
8.7k
points)

104
views
algorithms
mastertheorem
timecomplexity
+1
vote
1
answer
12
Master Theorem
T(n) = 3T(n/2) + $\sqrt[2]{n+3}$ if n > 1 = d if n = 1 2. T(n) = 3T(n/2) + $\sqrt[2]{n^{4}+3}$ if n > 1 = d if n = 1.
asked
Jul 4, 2017
in
Algorithms
by
anonymous

94
views
algorithms
mastertheorem
+3
votes
1
answer
13
Time Complexity for Recurrence relation
asked
Jun 16, 2017
in
Algorithms
by
Ashish Sharma 3
(
389
points)

234
views
timecomplexity
recurrence
recurrenceeqation
mastertheorem
+2
votes
2
answers
14
Ace practice book
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
asked
May 19, 2017
in
Algorithms
by
Devasish Ghosh
Junior
(
755
points)

217
views
mastertheorem
mastermethod
algorithms
divideandconquer
+1
vote
2
answers
15
State and explain master theorem
asked
May 5, 2017
in
Algorithms
by
rahuldb
Active
(
1k
points)

175
views
algorithms
mastertheorem
timecomplexity
+1
vote
2
answers
16
Master's theorem
We know that Master's theorem is applicable if for the reccurence relation T(n)=aT(n/b) +Θ(n^k log^p n) ,the conditions: a>=1, b>1, k>=0 and p= any real number are satisfied. My doubt is that if k= not a constant( eg: n^n), then can we apply the theorem since we know n will always be positive so k will be positive only?
asked
Mar 4, 2017
in
Algorithms
by
Bongbirdie
Junior
(
821
points)

109
views
mastertheorem
algorithms
+2
votes
2
answers
17
T(n)=16T(n/4)+n! using the Master Theorem
asked
Feb 19, 2017
in
Algorithms
by
vishwa ratna
Loyal
(
2.9k
points)

1.1k
views
algorithms
mastertheorem
+1
vote
1
answer
18
Algorithm Complexity problem
T(n) = 4T(sqrt(n)) + (logn)^5 Find Time complexity.(n=2^k) Give detailed answer , how to derive it.
asked
Feb 1, 2017
in
Algorithms
by
parthbkgadoya
(
423
points)

116
views
algorithms
timecomplexity
mastertheorem
+1
vote
1
answer
19
Master theorem
asked
Jan 14, 2017
in
Algorithms
by
harshit agarwal
(
439
points)

127
views
algorithms
timecomplexity
mastertheorem
0
votes
3
answers
20
time complexity Master's Theorem problem from CLRS
asked
Jan 9, 2017
in
Algorithms
by
Anmol Verma
Active
(
1.6k
points)

352
views
algorithms
timecomplexity
mastertheorem
+1
vote
1
answer
21
Testbook Test Algorithm Q 10
asked
Dec 20, 2016
in
Algorithms
by
Anjana Babu
Active
(
1.4k
points)

153
views
testseries
testbooktestseries
algorithms
mastertheorem
0
votes
2
answers
22
Master Theorem Algorithm
How is master theorem applicable here?
asked
Dec 15, 2016
in
Algorithms
by
rahul sharma 5
Veteran
(
23.9k
points)

119
views
mastertheorem
algorithms
timecomplexity
0
votes
0
answers
23
cormen
So I was calculating average case complexity of the following function using Master's theorem: T(n) = 2T (n/2)+ n/ log n According to http://people.csail.mit.edu/thies/6.046web/master.pdf Question 7, It says Does not ... .math.uic.edu/~leon/csmcs401s08/handouts/extended_master_theorem.pdf Now which concept to follow in gate?? please any expert check this.
asked
Dec 4, 2016
in
Algorithms
by
sushmita
Veteran
(
14.7k
points)

43
views
algorithms
mastertheorem
+2
votes
2
answers
24
Solve using Masters theorem
Solve using Masters theorem 2T (n/2) + n log n
asked
Oct 29, 2016
in
Algorithms
by
sh!va
Veteran
(
37.3k
points)

156
views
algorithms
mastertheorem
+2
votes
3
answers
25
Solve using Master's theorem
Solve this recurrence equation using Master's theorem T(n) = 64 T(n/8)  n 2 log n
asked
Oct 29, 2016
in
Algorithms
by
sh!va
Veteran
(
37.3k
points)

368
views
algorithms
mastertheorem
timecomplexity
+1
vote
2
answers
26
Algorithm Time compleity
asked
Oct 7, 2016
in
Algorithms
by
Rahul Jain25
Veteran
(
12.6k
points)

148
views
algorithms
recurrence
timecomplexity
mastertheorem
+3
votes
4
answers
27
Reccurance Relation
Can we apply master theorem on following RR T(n) = 16T(n/4) + n! if yes then how
asked
Aug 3, 2016
in
Algorithms
by
indrajeet
Active
(
2.2k
points)

212
views
recurrence
algorithms
mastertheorem
+1
vote
2
answers
28
TestBook
On which of the following recurrence relation Masters theorem can not be applied ? A. T(n)= 2T(n/2) + n (log n). B. T(n) = T(n/2) + 1. C. T(n) = 8T(n/2) + (log n). D. T(n) = 7(T(n/4) + n2.
asked
Jul 11, 2016
in
Algorithms
by
vijaycs
Veteran
(
28.4k
points)

148
views
testbooktestseries
mastertheorem
+2
votes
1
answer
29
Solve recurrence using Master theorem
asked
Apr 8, 2016
in
Algorithms
by
SomnathKayal
(
437
points)

181
views
mastertheorem
algorithms
timecomplexity
+1
vote
1
answer
30
Recurrence, master theorem not applicable
asked
Mar 11, 2016
in
Algorithms
by
neha singh
Active
(
2.2k
points)

428
views
recurrence
mastertheorem
Page:
1
2
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Applying to NUS
THANK U GO !!
need advice
A journey with GO from Air: 2494 to Air: 223
Thanks to GATE Overflow.
Follow @csegate
Gatecse
Recent questions tagged mastertheorem
Recent Blog Comments
Congrats Bro :D
Thank You @gauravkc, @hacker16, @Sukannya ...
Congratulations Brother :) You've made it! ECE to ...
I am also thinking of applying to the same ...
34,215
questions
40,896
answers
116,102
comments
39,804
users