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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged #recurrencerelations
+1
vote
1
answer
1
#ACE ACADEMY BOOKLET QUESTION
The solution of $\sqrt{a_n} – 2\sqrt{a_{n1}} + \sqrt{a_{n2}} = 0$ where $a_0 = 1$ and $a_1 = 2$ is ${\Big[\frac{2^{n+1} + (1)^n}{3}\Big]}^2$ $(n+1)^2$ $(n1)^3$ $(n1)^2$
asked
Jun 5
in
Combinatory
by
`JEET
Boss
(
12.9k
points)

129
views
discretemathematics
permutationandcombination
recurrence
#recurrencerelations
0
votes
0
answers
2
Rosen 7e Exercise 8.2 Questionno26 page no525 Recurrence Relation
What is the general form of the particular solution guaranteed to exist of the linear nonhomogeneous recurrence relation $a_n$=$6a_{n1}$$12a_{n2}$+$8a_{n3}$+F(n) if F(n)=$n^2$ F(n)=$2^n$ F(n)=$n2^n$ F(n)=$(2)^n$ F(n)=$n^22^n$ F(n)=$n^3(2)^n$ F(n)=3
asked
May 14
in
Combinatory
by
aditi19
Active
(
5.1k
points)

53
views
kennethrosen
discretemathematics
#recurrencerelations
recurrence
0
votes
0
answers
3
Rosen 7e Exercise8.2 Question no23 page no525 Recurrence Relation
Consider the nonhomogeneous linear recurrence relation $a_n$=$3a_{n1}$+$2^n$ in the book solution is given $a_n$=$2^{n+1}$ but I’m getting $a_n$=$3^{n+1}2^{n+1}$
asked
May 13
in
Combinatory
by
aditi19
Active
(
5.1k
points)

37
views
kennethrosen
discretemathematics
#recurrencerelations
recurrence
0
votes
0
answers
4
#algorithms #recurrencerelation
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
asked
May 11
in
Algorithms
by
aniketpatil32
(
29
points)

34
views
#algorithms
#recurrencerelations
0
votes
1
answer
5
Rosen 7e Recurrence Relation Exercise8.1 Question no25 page no511
How many bit sequences of length seven contain an even number of 0s? I'm trying to solve this using recurrence relation Is my approach correct? Let T(n) be the string having even number of 0s T(1)=1 {1} T(2)=2 {00, 11} T(3)=4 {001, ... add 0 to strings of length n1 having odd number of 0s T(n)=T(n1) Hence, we have T(n)=2T(n1)
asked
Apr 29
in
Combinatory
by
aditi19
Active
(
5.1k
points)

64
views
kennethrosen
discretemathematics
permutationandcombination
#recurrencerelations
recurrence
0
votes
2
answers
6
Rosen 7e Exercise8.1 Question no10 Page no511
Find a recurrence relation for the number of bit strings of length n that contain the string 01.
asked
Apr 28
in
Combinatory
by
aditi19
Active
(
5.1k
points)

58
views
kennethrosen
discretemathematics
permutationandcombination
#recurrencerelations
recurrence
0
votes
2
answers
7
NTA NET DEC 2018
asked
Mar 12
in
Algorithms
by
Kuljeet Shan
Active
(
1.9k
points)

83
views
#recurrencerelations
#algorithms
0
votes
0
answers
8
MadeEasy Full Length Test: Combinatory  Recurrence
What’s the trick to do it under 2 min here?
asked
Dec 31, 2018
in
Combinatory
by
shaz
(
369
points)

266
views
madeeasytestseries
#recurrencerelations
recurrence
0
votes
2
answers
9
Kenneth Rosen Edition 6th Exercise 7.1 Question 23 (Page No. 458)
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
asked
Dec 14, 2018
in
Combinatory
by
aditi19
Active
(
5.1k
points)

77
views
kennethrosen
discretemathematics
#recurrencerelations
0
votes
1
answer
10
Kenneth Rosen Edition 6th Exercise 6.1 Example 7 (Page No. 399)
this is an example taken from Rosen. but I’m unable to understand to understand the solution given there can someone pls explain me in details
asked
Dec 10, 2018
in
Combinatory
by
aditi19
Active
(
5.1k
points)

59
views
kennethrosen
discretemathematics
#recurrencerelations
counting
0
votes
2
answers
11
Karumanchi
asked
Nov 4, 2018
in
Algorithms
by
aditi19
Active
(
5.1k
points)

106
views
algorithms
timecomplexity
#recurrencerelations
0
votes
1
answer
12
Karumanchi
what is the time complexity of function(int n) { if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } function(0.8n); } i'm getting O(nlogn base 5/4) using the recurrence relation method but in the book it's given O(n) $T(n)=T(\frac{4n}{5})+O(n)$
asked
Oct 31, 2018
in
Algorithms
by
aditi19
Active
(
5.1k
points)

104
views
algorithms
timecomplexity
#recurrencerelations
0
votes
1
answer
13
Merge Sort Doubt
what is the recurrence relation for merge sort?
asked
Oct 6, 2018
in
Algorithms
by
aditi19
Active
(
5.1k
points)

129
views
mergesort
algorithms
timecomplexity
#recurrencerelations
sorting
divideandconquer
0
votes
1
answer
14
Kenneth Rosen Edition 6th Exercise 6.1 Question 4 (Page No. 400)
Show that the sequence {an} is a solution of the recurrence relation an = 3an1 + 4an2 if a) an = 0 b) an = 1 c) an = (4)n d) an = 2(4)n + 3 In the question What is sequence {an} ?? And how to solve this kind of question?
asked
Jul 28, 2018
in
Combinatory
by
Sandy Sharma
Active
(
1.2k
points)

81
views
kennethrosen
discretemathematics
#recurrencerelations
0
votes
1
answer
15
Kenneth Rosen Edition 6th Exercise 6.1 Example 8 (Page No. 400)
Find a recurrence relation for Cn the number of ways to parenthesize the product of n+1 numbers , x0*x1*x2.......*xn , to specify the order of multiplication. For example C3 = 5 because there are five ways to parenthesize x0*x1*x2*.....*xn to determine the order of multiplication.
asked
Mar 31, 2018
in
Combinatory
by
Abhinavg
(
455
points)

185
views
kennethrosen
discretemathematics
recurrence
#recurrencerelations
relations
0
votes
1
answer
16
Algo Recurrence Relation using Bck Substitution
T(n) = 4T(n/2) + C ......where C Constant T(n) = 16T(n/4) + 5C Cant figure out how to generalize and compare with base condition T(n) = 1 from above step.
asked
Nov 21, 2017
in
Algorithms
by
aka 53
(
235
points)

163
views
algorithms
#backsubstitution
timecomplexity
#algorithms
#recurrencerelations
+2
votes
2
answers
17
SOLVING RECURRENCE RELATION BY BACK SUBSTITUTION
solution of t(n)= t(sqrt(n)) + n using back substitution
asked
Jul 2, 2017
in
Algorithms
by
NIHAR MUKHIYA
(
43
points)

1k
views
#algorithms
#recurrencerelations
#backsubstitution
0
votes
1
answer
18
Virtual Gate Test Series: Algorithms  Recurrence Relation
asked
Jan 25, 2017
in
Algorithms
by
pps121
Active
(
1.5k
points)

79
views
algorithms
#recurrencerelations
virtualgatetestseries
+1
vote
3
answers
19
Kenneth Rosen Edition 6th Exercise 6.1 Question 9d (Page No. 401)
Solve the recurrence relation $a_n = a_{n1} + 2n + 3, a_0 = 4$
asked
Dec 22, 2016
in
Combinatory
by
Rounak Agarwal
(
439
points)

262
views
kennethrosen
discretemathematics
permutationandcombination
#recurrencerelations
To see more, click for the
full list of questions
or
popular tags
.
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged #recurrencerelations
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 34 days but for most purpose you can...
50,648
questions
56,422
answers
195,195
comments
99,835
users