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
Recurrence Relations
Lakshman Bhaiya
asked
in
Algorithms
Nov 1, 2018
422
views
0
votes
0
votes
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then
$A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ $D)T(n)=\theta(n^{3}logn)$
algorithms
recurrence-relation
time-complexity
Lakshman Bhaiya
asked
in
Algorithms
Nov 1, 2018
by
Lakshman Bhaiya
422
views
answer
comment
Follow
share this
share
3 Comments
by
Utkarsh Joshi
commented
Nov 1, 2018
reply
Follow
share this
n^2.
By tree method im getting.
0
0
by
adarsh_1997
commented
Nov 1, 2018
reply
Follow
share this
c)
T(N/4)<=T(N/2) USE THIS AND APPLY MASTER THEOREM
0
0
by
adarsh_1997
commented
Nov 1, 2018
reply
Follow
share this
@UTKARSH JOSHI
CAN YOU SHARE THE TREE METHOD?
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
Option c)Theta(n^2) by recursive tree method.
shagilsid
answered
Nov 4, 2018
by
shagilsid
comment
Follow
share this
0 Comments
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
practicalmetal
asked
in
Algorithms
Sep 15, 2023
369
views
Recurrence relations
Consider the following function: function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); } Find the worst case time complexity of function X ?
practicalmetal
asked
in
Algorithms
Sep 15, 2023
by
practicalmetal
369
views
recurrence-relation
algorithms
1
vote
1
vote
0
answers
2
NIHAR MUKHIYA
asked
in
Algorithms
Jul 15, 2017
430
views
Recurrence relations
T(n)=T(n/2+2)+n Solution using substitution method
NIHAR MUKHIYA
asked
in
Algorithms
Jul 15, 2017
by
NIHAR MUKHIYA
430
views
algorithms
recurrence-relation
0
votes
0
votes
1
answer
3
iarnav
asked
in
Algorithms
May 25, 2017
589
views
Where to study from recurrence relations from scratch
According to gate CS, where is recurrence relations are used? How to learn to use them in Algorithms in solving T(n) Questions. Kindly mention the video lecture source to study recurrence relations and all the ways to solve them.
iarnav
asked
in
Algorithms
May 25, 2017
by
iarnav
589
views
algorithms
recurrence-relation
1
vote
1
vote
2
answers
4
learncp
asked
in
Algorithms
Jan 17, 2016
394
views
Calculating time compleity of recurrence relations.
I am having some problems in calculating time complexities for recurrence relations. In one of the books, I saw two questions- 1. A(n) { if(n<=1) return (n); else { return ( A(n/2)+ A(n/2)+ n); } } The recurrence for this is given as T(n)= T(n/2)+ ... )+T(n/2) +c if n>1 I think it should be T(n)= 2T(n/2)+6T(n/2) +n^2 What am I missing here ?
learncp
asked
in
Algorithms
Jan 17, 2016
by
learncp
394
views
algorithms
recurrence-relation
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