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
Master method
shweta sah
asked
in
Algorithms
Jun 15, 2018
retagged
Jul 16, 2022
by
makhdoom ghaya
335
views
1
vote
1
vote
master-theorem
recurrence-relation
time-complexity
test-series
shweta sah
asked
in
Algorithms
Jun 15, 2018
retagged
Jul 16, 2022
by
makhdoom ghaya
by
shweta sah
335
views
answer
comment
Follow
share this
share
1 comment
by
vikas kumar 2
commented
Jun 15, 2018
reply
Follow
share this
A,b are not possible because ,2^n is exponential, and sin(n) is transclant function ,
But we are trying to find polynomial
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
C,. because T(n)=aT(n/b)+f(n)
Where f(n) is polynomial fn
vikas kumar 2
answered
Jun 15, 2018
by
vikas kumar 2
comment
Follow
share this
1 comment
by
shweta sah
commented
Jun 15, 2018
reply
Follow
share this
Why option a and b cannot be the answer
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Prasanna
asked
in
Algorithms
Jan 18, 2016
448
views
Algorithms: Master Method Testbook
Prasanna
asked
in
Algorithms
Jan 18, 2016
by
Prasanna
448
views
algorithms
master-theorem
recurrence-relation
testbook-test-series
2
votes
2
votes
2
answers
2
Prasanna
asked
in
Algorithms
Nov 25, 2015
1,663
views
substitution or Master Method
What to use for this Master or Substitution Method ? T(1) = 1, and for all n ≥ 2 a power of 2, T(n)=2T(n/2) + 6n − 1. If it is possible in Master Method how ? Even,Substitution is also accecpted here. Edit: In substitution Method Suppose T(1) = 1, and ... = n + 6n log n − (2log n − 1) = 6n log n + 1.
Prasanna
asked
in
Algorithms
Nov 25, 2015
by
Prasanna
1.7k
views
algorithms
recurrence-relation
master-theorem
1
vote
1
vote
1
answer
3
mdboi
asked
in
Algorithms
Oct 28, 2022
735
views
𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3 using the master theorem
how do i apply master theorem to this? 𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3
mdboi
asked
in
Algorithms
Oct 28, 2022
by
mdboi
735
views
algorithms
master-theorem
recurrence-relation
asymptotic-notation
time-complexity
0
votes
0
votes
3
answers
4
dhingrak
asked
in
Algorithms
Jan 18, 2015
859
views
Master Theorem
When do we say that 2 functions are polynomially comparable for applying master theorem...? We can apply the theorem for T(n)=3T(n/4)+nlgn but cant apply it for T(n)=2T(n/2)+nlgn ...please explain..?
dhingrak
asked
in
Algorithms
Jan 18, 2015
by
dhingrak
859
views
algorithms
master-theorem
recurrence-relation
time-complexity
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
