The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged recurrence
Master Theorem
Extended Master Theorem
Even more extension
0
votes
1
answer
1
Test series
Consider the variation of the binary search algorithm so that it splits the list into not only into two sets of almost equal sizes but into two sets of size approximately onethirds and Twothird. What is the recurrence equation for this search in worstcase? $T(n) = T(n/2) + 1$ $T(n) = 2T(n/2) + 1$ $T(n) = T(n/3) + 1$ $T(n) = 2T(n/3) + 1$
asked
Mar 6
in
Algorithms
by
Warrior
Veteran
(
16.4k
points)

47
views
algorithms
recurrence
0
votes
1
answer
2
Algorithm
Give complete solution $T(n) =T(n2)+n^2$, if $n >1$ And $1$, if $n=1$
asked
Mar 6
in
Algorithms
by
Pun M
(
87
points)

51
views
algorithms
recurrence
+1
vote
0
answers
3
Algorithm
Give complete solution for $T(n)=T(n2)+2 log n$ If $n>1$ $= 1$ if $n=1$
asked
Mar 6
in
Algorithms
by
Pun M
(
87
points)

43
views
algorithms
recurrence
0
votes
1
answer
4
Uttrakhand Asst. Professor Exam62
asked
Mar 2
in
Others
by
gatecse
Veteran
(
19.6k
points)

19
views
uttarakhandasstprof2018
algorithms
recurrence
mastertheorem
+3
votes
1
answer
5
ME test series
asked
Jan 28
in
Algorithms
by
sumit chakraborty
Active
(
1.4k
points)

71
views
madeeasytestseries
recurrence
recursion
+1
vote
0
answers
6
please solve this
$T(n)=2T(\sqrt{n})+logn$
asked
Jan 27
in
Algorithms
by
Rameez Raza
Loyal
(
3.1k
points)

33
views
recurrence
+1
vote
0
answers
7
please solve this
$T(n)=2T(\sqrt{n})+n$
asked
Jan 27
in
Algorithms
by
Rameez Raza
Loyal
(
3.1k
points)

54
views
recurrence
+2
votes
0
answers
8
Recurrence
Answer given as 5050 i am getting 4950
asked
Jan 21
in
Combinatory
by
Inspiron
Active
(
1.5k
points)

29
views
recurrence
+4
votes
1
answer
9
Recurrence Relation
$T(n) = 2T(\sqrt{n}) + n$
asked
Jan 20
in
Algorithms
by
Shubhanshu
Veteran
(
16k
points)

150
views
algorithms
timecomplexity
recurrenceeqation
recurrence
+1
vote
0
answers
10
Recurrence Problem
The runtime of a divideandconquer algorithm is described by the following recurrence: T(n) = 3T(n/2) + O(1). How many subproblems will we have at the 5th level of recursion if the top level is considered to be the 0th level__________?
asked
Jan 20
in
Algorithms
by
Shubhgupta
(
85
points)

48
views
recurrence
algorithms
+4
votes
1
answer
11
recurence relation
Which of the following represents most appropriate asymptotic solution for given reccurance: (A) O(n) (B) O(log n) (C) O(log log n) (D) O(log n)2
asked
Jan 15
in
Algorithms
by
Lakshman Patel RJIT
Boss
(
7.8k
points)

60
views
recurrence
relations
algorithms
+1
vote
0
answers
12
recurrence equation
what is recurrence relation of harmonic number/series ? and it's time complexity
asked
Jan 14
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

36
views
algorithms
timecomplexity
recurrence
algorithms
+2
votes
0
answers
13
recurrence relation
asked
Jan 13
in
Combinatory
by
pranab ray
Active
(
2.1k
points)

63
views
recurrence
discretemathematics
+2
votes
1
answer
14
recurrence eq
how to solve this T(n)=T(n−1)+T(n−2) if T(0)=T(1)=1
asked
Jan 12
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

88
views
recurrence
algorithms
timecomplexity
asymptoticnotations
discretemathematics
–1
vote
0
answers
15
recurrece relation stuck at some step.
asked
Jan 12
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

34
views
recurrence
timecomplexity
algorithms
+1
vote
1
answer
16
recurrence using Master theorem
asked
Jan 11
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

97
views
algorithms
mastertheorem
timecomplexity
recurrence
asymptoticnotations
0
votes
0
answers
17
recurrence relation
what is the recurrence relation for binary search and linear search? please explain how to derive them.
asked
Jan 11
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

46
views
recurrence
algorithms
timecomplexity
recurrenceeqation
discretemathematics
0
votes
1
answer
18
Stuck in Recurrence Relation in Algorithm
asked
Jan 11
in
Algorithms
by
iarnav
Veteran
(
20.3k
points)

61
views
recurrence
algorithms
timecomplexity
+3
votes
0
answers
19
Recurrence equation
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\left ( \frac{n}{2} \right ) +n^{2}2^{\frac{1}{2}}$
asked
Jan 8
in
Algorithms
by
Aakanchha
Junior
(
693
points)

79
views
algorithms
timecomplexity
recurrence
recursion
+3
votes
0
answers
20
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
asked
Jan 8
in
Algorithms
by
anoop yadav 2
(
107
points)

186
views
algorithms
mastertheorem
recurrence
timecomplexity
recursion
+1
vote
0
answers
21
Solve the following recurrence relation:
asked
Jan 8
in
Combinatory
by
gari
Loyal
(
3.5k
points)

73
views
discretemathematics
recurrence
+4
votes
2
answers
22
t(n) = sqrt(2) t(n/2) + sqrt(n)
asked
Jan 7
in
Algorithms
by
anoop yadav 2
(
107
points)

164
views
algorithms
recurrence
timecomplexity
recursion
+1
vote
1
answer
23
recurrence
asked
Dec 23, 2017
in
Mathematical Logic
by
Pawan Kumar 2
Boss
(
5.1k
points)

44
views
recurrence
0
votes
0
answers
24
recurrence relation
Which recurrence relation satisfy the sequence: 2, 3, 4, . . ., for n ≥ 1. A ) T(N) = 2 T(N1)  T(N2) B)T(N) = T(N1) + T(N2) C)T(N) = N+1 D) None of these
asked
Dec 19, 2017
in
Mathematical Logic
by
Jaspreet Kaur Bains
Junior
(
965
points)

94
views
recurrence
+1
vote
1
answer
25
Which function has asymptotically larger growth rate n^{logn} or logn^{n}
asked
Dec 18, 2017
in
Algorithms
by
Durgesh Singh
Junior
(
923
points)

78
views
recurrence
growthrate
algorithms
0
votes
0
answers
26
Recursion
T(n) =$\log$n + T($\sqrt{n}$) How to solve this?
asked
Nov 22, 2017
in
Programming
by
kirti_k
Active
(
1.1k
points)

48
views
recurrence
+4
votes
2
answers
27
Time Complexity
Which of the following statements is/are TRUE? I. The time complexity of recurrence relation A(n) = 3A(n/2)+ n2 is asymptotically faster than T(n) = 4T(n/2)+ n2. II. The time complexity of recurrence relation A(n) = 512 A(n/2) + O(n50) is asymptotically faster than T(n) = 7T(n53) + O(1), T(0) = 1. Please explain what is mean by asymptotically faster?
asked
Nov 12, 2017
in
Algorithms
by
garg div
Junior
(
685
points)

76
views
timecomplexity
recurrence
+2
votes
3
answers
28
Problem on TOH
We solve TOH problem recursively breaking the task in three sections, which of the following recurrence will accord well with the approach , that is shows correct order of work done on each recursive step A) T(n)=T(n1)+1+T(n1) B) T(n)=T(n1)+T(n1)+1 C) T(n)=1+T(n1)+T(n1) D) T(n)=T(n1)+T(n1)+2
asked
Nov 11, 2017
in
Algorithms
by
srestha
Veteran
(
82.6k
points)

62
views
algorithms
recurrence
+1
vote
0
answers
29
Recurrence Relation
The solution for the recurrence: T(1)=1 T(n) = T(n1) + T(n2) + 1 a. log(n) <= T(n)=n b. n<=T(n)<=n2 c. n2 <= T(n)<= 2n d. 2n <= T(n) <=n!
asked
Nov 9, 2017
in
Algorithms
by
targate2018
Active
(
2.1k
points)

75
views
algorithms
recurrence
+3
votes
1
answer
30
Testbook Test Series
asked
Nov 1, 2017
in
Algorithms
by
jaig
(
213
points)

104
views
algorithms
timecomplexity
recurrence
Page:
1
2
3
4
5
6
7
next »
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
Dream of M.Tech in IIT
M.Tech preparation
My success story
IIITH Application Form
Another failure attempt
Follow @csegate
Gatecse
Recent questions tagged recurrence
Recent Blog Comments
Many Congratulations to you and well said. When I ...
Congratulations bhava.. :) Hope we meet at IIT ...
check for what u get in the college predictor of ...
Thank You so much for the edits and making this ...
@Sunny Mukherjee Congratulations and all the best ...
34,170
questions
40,847
answers
115,884
comments
39,703
users