menu
Recent questions tagged recurrence-relations
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged recurrence-relations
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged recurrence-relations
0
votes
2
answers
113
views
T(n)=T(n/2)+logn How to solve this without using masters theorem?
neel19
asked
in
Algorithms
Oct 12, 2021
by
neel19
9
points
113
views
self-doubt
algorithms
recurrence-relations
timecomplexity
0
votes
0
answers
38
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, 2021
by
Enolx.21
53
points
38
views
recurrence-relations
recursion
trees
0
votes
0
answers
100
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
100
views
recurrence-relations
kenneth-rosen
discrete-mathematics
0
votes
2
answers
42
views
Time complexity of below program
what should be the time complexity of below program anyone can anyone please explain for(i=1;i<=n:++i) { for(i=1;i<=n^2:++i) { for(i=1;i<=n^3:++i) { x=y+z; } } }
Sumit goyal 2
asked
in
Programming
May 23, 2020
by
Sumit goyal 2
5
points
42
views
algorithms
recurrence-relations
time-complexity
1
vote
1
answer
51
views
Find time complexity of T(n) = 2*T(n-1) + 3*T(n-2)
roh
asked
in
Algorithms
Apr 23, 2020
by
roh
9
points
51
views
algorithms
time-complexity
recurrence-relations
time-complexity
0
votes
0
answers
34
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
34
views
recurrence-relations
0
votes
1
answer
38
views
T(n) = 2^n T (n/2) + n^n. what is time complexity?
Mohit Kumar 6
asked
in
Algorithms
Apr 18, 2020
by
Mohit Kumar 6
5
points
38
views
recurrence-relations
time-complexity
algorithms
0
votes
1
answer
91
views
T(n)=16T(n/4)+O(n^2)
How can I achieve the result using my master theorem? Can you help me please?Thank you!
april_10
asked
in
Algorithms
Apr 18, 2020
by
april_10
5
points
91
views
time-complexity
recurrence-relations
algorithms
assymtotic
0
votes
1
answer
60
views
T(n) = sqrt(n) * T(sqrt(n)) + 100n
T(n) = sqrt(n) * T(sqrt(n)) + 100n Master method does not apply here. Recursion tree goes a long way. Iteration method would be preferable. The answer is Θ(nloglogn). Would you mind to elaborate how this can be proven? I am first year student of computer sciences. Thank you!
april_10
asked
in
Algorithms
Apr 18, 2020
by
april_10
5
points
60
views
recurrence-relations
time-complexity
algorithms
asymptotic-analysis
0
votes
0
answers
24
views
Madeeasy test series - recurrence relation
luc_Bloodstone
asked
in
DS
Jan 21, 2020
by
luc_Bloodstone
19
points
24
views
recurrence-relations
made-easy-test-series
time-complexity
algorithms
0
votes
1
answer
86
views
Algorithms Recurrence relation : Ace test series
Chirag Shilwant
asked
in
Algorithms
Jan 19, 2020
by
Chirag Shilwant
191
points
86
views
algorithms
recurrence-relations
0
votes
0
answers
27
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
27
views
made-easy-test-series
algorithms
recurrence-relations
0
votes
1
answer
41
views
Solve the recurrence relation: T(n) = T(n^(1/2)) + n
avistein
asked
in
Algorithms
Dec 4, 2019
by
avistein
613
points
41
views
recurrence-relations
time-complexity
0
votes
0
answers
25
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
25
views
algorithms
asymptotic-analysis
recurrence-relations
masters-theorem
1
vote
0
answers
38
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
38
views
algorithms
asymptotic-analysis
recurrence-relations
To see more, click for the
full list of questions
or
popular tags
.
Ask a Question
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts