Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged master-theorem
2
votes
1
answer
61
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.
anonymous
asked
in
Algorithms
Jul 4, 2017
by
anonymous
505
views
algorithms
master-theorem
0
votes
1
answer
62
CLR 3rd edition , page no 87, Q.no. 4.3-6
While solving this recurrence T(n) = 2T(n/2 + 17) + n what is the need of 17 and how to go forward to solve this question using the method of master theorem ?
dragonball
asked
in
Algorithms
Jun 22, 2017
by
dragonball
385
views
recurrence-relation
master-theorem
3
votes
1
answer
63
Time Complexity for Recurrence relation
What will be the time complexity for the following recurrence relation? $T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$ According to me it is $\Theta (n(logn)^{3})$ . Please confirm.
Ashish Sharma 3
asked
in
Algorithms
Jun 16, 2017
by
Ashish Sharma 3
1.7k
views
time-complexity
recurrence-relation
master-theorem
2
votes
3
answers
64
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$
Devasish Ghosh
asked
in
Algorithms
May 18, 2017
by
Devasish Ghosh
826
views
master-theorem
algorithms
divide-and-conquer
2
votes
2
answers
65
State and explain master theorem
State and explain master theorem. Can Master’s method be applied to recurrence , $T(n) = 4T(n/2) + n^2logn$ ? Why or why not ?
rahuldb
asked
in
Algorithms
May 5, 2017
by
rahuldb
2.0k
views
algorithms
master-theorem
time-complexity
1
vote
2
answers
66
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?
Bongbirdie
asked
in
Algorithms
Mar 4, 2017
by
Bongbirdie
489
views
master-theorem
algorithms
3
votes
3
answers
67
T(n)=16T(n/4)+n! using the Master Theorem
how do i apply master theorem to this? https://s17.postimg.org/x7xld2nf3/Screenshot_82.png what is P and K here?
vishwa ratna
asked
in
Algorithms
Feb 19, 2017
by
vishwa ratna
21.2k
views
algorithms
master-theorem
1
vote
1
answer
68
Algorithm Complexity problem
T(n) = 4T(sqrt(n)) + (logn)^5 Find Time complexity.(n=2^k) Give detailed answer , how to derive it.
parthbkgadoya
asked
in
Algorithms
Feb 1, 2017
by
parthbkgadoya
643
views
algorithms
time-complexity
master-theorem
1
vote
1
answer
69
Master theorem
harshit agarwal
asked
in
Algorithms
Jan 14, 2017
by
harshit agarwal
730
views
algorithms
time-complexity
master-theorem
test-series
2
votes
1
answer
70
Time complexity
reena_kandari
asked
in
Algorithms
Jan 10, 2017
by
reena_kandari
358
views
time-complexity
recurrence-relation
algorithms
master-theorem
test-series
0
votes
3
answers
71
time complexity Master's Theorem problem from CLRS
1) T(n)=T(n-1)+1/n. 2) T(n)=T(n-1) +1/log(n) 3)T(n)=3T((n/3) - 2)+n/2. 4)T(n)=T(n/2)+T(n/4)+T(n/8)+n. Use Masters theorem
Anmol Verma
asked
in
Algorithms
Jan 9, 2017
by
Anmol Verma
1.5k
views
algorithms
time-complexity
master-theorem
1
vote
1
answer
72
Testbook Test Algorithm Q 10
Anjana Babu
asked
in
Algorithms
Dec 20, 2016
by
Anjana Babu
1.1k
views
test-series
testbook-test-series
algorithms
master-theorem
0
votes
2
answers
73
Master Theorem Algorithm
How is master theorem applicable here?
rahul sharma 5
asked
in
Algorithms
Dec 14, 2016
by
rahul sharma 5
479
views
master-theorem
algorithms
time-complexity
test-series
0
votes
1
answer
74
TestBook Test Series: Algorithms - Time Complexity
how to solve these two using matser thorem. 1. t(n)=2t(√n)+n 2. t(n)=4t(√n)+(logn)^2
rajan
asked
in
Algorithms
Dec 9, 2016
by
rajan
369
views
testbook-test-series
algorithms
time-complexity
master-theorem
0
votes
1
answer
75
Solve using Masters theorem
Solve given recurrence relation using Masters theorem: T(n) =T (n/2)+ n
sh!va
asked
in
Algorithms
Dec 4, 2016
by
sh!va
401
views
recurrence-relation
algorithms
master-theorem
0
votes
0
answers
76
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.046-web/master.pdf Question 7, It says Does not apply (non- ... /homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/extended_master_theorem.pdf Now which concept to follow in gate?? please any expert check this.
sushmita
asked
in
Algorithms
Dec 4, 2016
by
sushmita
432
views
algorithms
master-theorem
2
votes
2
answers
77
Solve using Masters theorem
Solve using Masters theorem 2T (n/2) + n log n
sh!va
asked
in
Algorithms
Oct 29, 2016
by
sh!va
2.1k
views
algorithms
master-theorem
2
votes
4
answers
78
Solve using Master's theorem
Solve this recurrence equation using Master's theorem T(n) = 64 T(n/8) - n 2 log n
sh!va
asked
in
Algorithms
Oct 29, 2016
by
sh!va
2.5k
views
algorithms
master-theorem
time-complexity
1
vote
1
answer
79
non applicability of master theorem
in which of the following recurrence relation master theorem can not be applied and why a)T(n)=7T(n/2)+n^2 b)T(n)=7T(n/3)+n^2 c)T(n)=T(9n/10)+n d)T(n)=T(n-1)+n
Aradhana Singh
asked
in
Algorithms
Oct 25, 2016
by
Aradhana Singh
598
views
recurrence-relation
master-theorem
1
vote
1
answer
80
Master theorem
T(n)=3T(n/4)+nlogn In this if we use master theorem then how is f(n)=Ω(nlog43+ϵ) ?
Prerna Chauhan
asked
in
Algorithms
Oct 19, 2016
by
Prerna Chauhan
2.2k
views
algorithms
master-theorem
asymptotic-notation
0
votes
2
answers
81
Master Theorem
Can we solve it using master theorem? T(n)=2T(n/2)+Θ(nlogn)
Prerna Chauhan
asked
in
Algorithms
Oct 19, 2016
by
Prerna Chauhan
880
views
algorithms
master-theorem
recurrence-relation
1
vote
1
answer
82
#Algo
On which of the following recurrence relation Master Theorem cannot be applied? A. T(n)=2T(n/2)+nlogn B. T(n)=T(n/2)+1 C. T(n)=8T(n/2)+logn D. T(n)=7T(n/4)+n2 I think we can apply on all. But plz correct me with reason.Thanks
Rajesh Pradhan
asked
in
Algorithms
Oct 14, 2016
by
Rajesh Pradhan
1.6k
views
algorithms
recurrence-relation
master-theorem
1
vote
2
answers
83
Algorithm Time compleity
Rahul Jain25
asked
in
Algorithms
Oct 7, 2016
by
Rahul Jain25
596
views
algorithms
recurrence-relation
time-complexity
master-theorem
test-series
3
votes
4
answers
84
Reccurance Relation
Can we apply master theorem on following RR T(n) = 16T(n/4) + n! if yes then how
indrajeet
asked
in
Algorithms
Aug 3, 2016
by
indrajeet
821
views
recurrence-relation
algorithms
master-theorem
7
votes
1
answer
85
master theorem
T(n)=4T(n/2)+n/logn this can be solved by master theorem but why t(n)=2t(n/2)+n/logn can't be solved by master theorem ?
vkm07
asked
in
Algorithms
Jul 27, 2016
by
vkm07
4.9k
views
algorithms
recurrence-relation
master-theorem
descriptive
1
vote
2
answers
86
TestBook Test Series: Algorithms - Time Complexity
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.
vijaycs
asked
in
Algorithms
Jul 11, 2016
by
vijaycs
1.9k
views
testbook-test-series
algorithms
time-complexity
master-theorem
2
votes
1
answer
87
Solve recurrence using Master theorem
$T(a)=0 \hspace{0.2cm} if \hspace{0.2cm} a=1$ $T(a)=2T(a/2) + ak \hspace{0.2cm} if \hspace{0.2cm} a=2^{p}, p>0$ where $a=\frac{n}{k}$ Answer: $\Theta (n \log (\frac{n}{k}))$, This is while (n/k) is power of 2. How can I solve it using master theorem?
SomnathKayal
asked
in
Algorithms
Apr 8, 2016
by
SomnathKayal
830
views
master-theorem
algorithms
time-complexity
1
vote
1
answer
88
Recurrence, master theorem not applicable
$T(n)=T(2n/3)+1$ Find the order of algorithm?
neha singh
asked
in
Algorithms
Mar 10, 2016
by
neha singh
2.8k
views
recurrence-relation
master-theorem
2
votes
1
answer
89
find order of this algorithm?
$T(n)=T(n/2) + n^{1/2}.$
neha singh
asked
in
Algorithms
Mar 10, 2016
by
neha singh
545
views
recurrence-relation
master-theorem
0
votes
1
answer
90
How to apply the master theorem to equations containing f(n) other than n^d. For e. g. F(n) = log n.
akshay kapase
asked
in
Algorithms
Feb 1, 2016
by
akshay kapase
257
views
algorithms
master-theorem
Page:
« prev
1
2
3
4
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged master-theorem
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...