Recent questions tagged recurrence-relations
Register

Recent questions tagged recurrence-relations

Recent questions tagged recurrence-relations
0 votes
0 answers 33 views
Self doubt
void f(int n) { if(n<=1) return; f(n-1); f(n-1); } (1) What is total number of recursive calls in f(n) ? (2) What is total Number of calls f(n) ? (3) What is the complexity of this code ?
Enolx.21 asked in Algorithms Jul 28
by Enolx.21
53 points
33 views
0 votes
0 answers 89 views
Recurrence relation - ROSEN
$1.\ a_{k}=3a_{k-1}+4^{k-1}| a_{0}=1$ $2.\ a_{k}=4a_{k-1}-4_{k-2}+k^2| a_{0}=2,a_{1}=5$
KUSHAGRA गुप्ता asked in Combinatory Aug 6, 2020
by KUSHAGRA गुप्ता
1.4k points
89 views
0 votes
0 answers 32 views
Applied course test series: Recurrence relation
When n=(2)^(2k) for some k>0, the recurrence relation : T(n)=(2)½ T(n/2)+ (n)½ , T(1)=1 evaluates to: (n)½(log n+1) (n)½ (log (n)½ ) (n)½ logn n log(n)½
Suhail96 asked in Algorithms Apr 18, 2020
by Suhail96
5 points
32 views
0 votes
0 answers 21 views
Madeeasy test series - recurrence relation
luc_Bloodstone asked in DS Jan 21, 2020
by luc_Bloodstone
19 points
21 views
0 votes
0 answers 26 views
Made Easy Test Series: Algorithms
Consider the following recurrence relation: What is the time complexity? I know the $n$ = $2^{m}$, T($2^{m}$) = S(m) method, but I think it’s not working here. Please solve it.
Sambhrant Maurya asked in Algorithms Dec 9, 2019
by Sambhrant Maurya
493 points
26 views
0 votes
1 answer 36 views
Solve the recurrence relation: T(n) = T(n^(1/2)) + n
avistein asked in Algorithms Dec 4, 2019
by avistein
613 points
36 views
0 votes
0 answers 22 views
Recurrence Relations
T(n) = $T(\frac{n}{k}) + T(\frac{3n}{4}) + n$ if n>=2 = 1 if n=1 Which of the following is false? T(n) is O($n^{\frac{3}{2}}$) when k=3 T(n) is O(n log n) when k=3 T(n) is O(n log n) when k=4 T(n) is O(n log n) when k=5
Sambhrant Maurya asked in Algorithms Aug 5, 2019
by Sambhrant Maurya
493 points
22 views
1 vote
0 answers 35 views
Algorithms: Recurrence Relations
Consider the following recurrence relation for some unknown recursive algorithm. Take some assumption about the termination condition of algorithm. $T(n)=\sqrt{n} T(\sqrt{n}) + \sqrt{n}$ What is the tightest time bound? O(log log n) O(n log log n) O(n) O(n log $log^{2}n$)
Sambhrant Maurya asked in Algorithms Aug 5, 2019
by Sambhrant Maurya
493 points
35 views
To see more, click for the full list of questions or popular tags.
Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun