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
TestBook Test Series: Algorithms - Time Complexity
rajan
asked
in
Algorithms
Dec 9, 2016
edited
Mar 11, 2019
by
akash.dinkar12
367
views
0
votes
0
votes
how to solve these two using matser thorem.
1. t(n)=2t(√n)+n
2. t(n)=4t(√n)+(logn)^2
testbook-test-series
algorithms
time-complexity
master-theorem
rajan
asked
in
Algorithms
Dec 9, 2016
edited
Mar 11, 2019
by
akash.dinkar12
by
rajan
367
views
answer
comment
Follow
share this
share
1 comment
by
Manish Tripathi
commented
Dec 9, 2016
reply
Follow
share this
Master's method extension
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
Substitute n as some function of 2^k. So, k = log n. Now equation will in form of 2^k. Now reduce the equation into S(k) = 2S(k/2) + k and solve using master's theorem. And replace 'k' by log n.
Manish Tripathi
answered
Dec 9, 2016
by
Manish Tripathi
comment
Follow
share this
1 comment
by
rajan
commented
Dec 9, 2016
reply
Follow
share this
plz elobrate ur soln speciallly for 2nd
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
2
answers
1
vijaycs
asked
in
Algorithms
Jul 11, 2016
1,876
views
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
0
votes
0
votes
1
answer
2
Prasanna
asked
in
Algorithms
Jan 18, 2016
447
views
Algorithms: Master Method Testbook
Prasanna
asked
in
Algorithms
Jan 18, 2016
by
Prasanna
447
views
algorithms
master-theorem
recurrence-relation
testbook-test-series
0
votes
0
votes
2
answers
3
Tushar Shinde
asked
in
Algorithms
Jan 18, 2016
356
views
TestBook Test Series: Algorithms - Time Complexity
Tushar Shinde
asked
in
Algorithms
Jan 18, 2016
by
Tushar Shinde
356
views
testbook-test-series
algorithms
time-complexity
0
votes
0
votes
0
answers
4
sidlewis
asked
in
Programming in C
Sep 1, 2018
417
views
Testbook Test Series :Algorithms - TIme Complexity
sidlewis
asked
in
Programming in C
Sep 1, 2018
by
sidlewis
417
views
testbook-test-series
algorithms
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