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
Cormen Edition 3 Exercise 4.4 Question 1 (Page No. 92)
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
173
views
0
votes
0
votes
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=3T(\lfloor n/2 \rfloor) + n$. Use the substitution method to verify your answer.
cormen
algorithms
recurrence-relation
descriptive
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
173
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
207
views
Cormen Edition 3 Exercise 4.4 Question 2 (Page No. 92)
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n/2)+n^2$.Use the substitution method to verify your answer
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
207
views
cormen
algorithms
recurrence-relation
descriptive
0
votes
0
votes
0
answers
2
akash.dinkar12
asked
in
Algorithms
Jun 28, 2019
329
views
Cormen Edition 3 Exercise 7.4 Question 1 (Page No. 184)
Show that in the recurrence $T(n)=\max_{0<q\leq n-1} (T(q)+T(n-q-1))+\Theta(n)$ $T(n)=\Omega(n^2)$
akash.dinkar12
asked
in
Algorithms
Jun 28, 2019
by
akash.dinkar12
329
views
cormen
algorithms
recurrence-relation
descriptive
0
votes
0
votes
0
answers
3
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
149
views
Cormen Edition 3 Exercise 4.3 Question 1 (Page No. 87)
Show that the solution of $T(n) = T(n-1)+ n$ is $O(n^2)$
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
149
views
cormen
algorithms
recurrence-relation
descriptive
0
votes
0
votes
0
answers
4
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
287
views
Cormen Edition 3 Exercise 4.6 Question 3 (Page No. 106)
Show that case 3 of the master theorem is overstated, in the sense that the regularity condition $af(n/b)\geq cf(n)$ for some constant $c<1$ implies that there exists a constant $\epsilon >0$ such that $f(n)=\Omega(n^{log_ba+\epsilon})$.
akash.dinkar12
asked
in
Algorithms
Apr 5, 2019
by
akash.dinkar12
287
views
cormen
algorithms
recurrence-relation
master-theorem
descriptive
difficult
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
