The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
2
answers
1
$\textbf{NTA NET dec 2019 ( Recurrence relation)}$
$\text{Give asymptotic upper and lower bound for $\mathbf{T(n)}$ given below.}\;\text{Assume $\mathrm {T(n)}$ is constant for $\mathrm {n\le 2}.$}$ $\large{\mathrm{T(n) = 4T\left (\sqrt n \right ) + \lg^2 n}}$ ... $4)\;\;\mathrm{T(n) = \theta (\lg (\lg n)\lg n)}$
asked
Dec 21, 2019
in
Algorithms
by
Sanjay Sharma

419
views
recurrencerelations
+1
vote
1
answer
2
#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, 2019
in
Combinatory
by
`JEET

171
views
discretemathematics
combinatory
recurrence
recurrencerelations
0
votes
0
answers
3
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, 2019
in
Combinatory
by
aditi19

130
views
kennethrosen
discretemathematics
recurrencerelations
recurrence
0
votes
0
answers
4
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 14, 2019
in
Combinatory
by
aditi19

81
views
kennethrosen
discretemathematics
recurrencerelations
recurrence
0
votes
0
answers
5
#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, 2019
in
Algorithms
by
aniketpatil32

54
views
algorithms
recurrencerelations
0
votes
1
answer
6
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 30, 2019
in
Combinatory
by
aditi19

145
views
kennethrosen
discretemathematics
combinatory
recurrencerelations
recurrence
0
votes
2
answers
7
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, 2019
in
Combinatory
by
aditi19

96
views
kennethrosen
discretemathematics
combinatory
recurrencerelations
recurrence
0
votes
2
answers
8
NTA NET DEC 2018
asked
Mar 13, 2019
in
Algorithms
by
Kuljeet Shan

160
views
recurrencerelations
algorithms
0
votes
0
answers
9
MadeEasy Full Length Test: Combinatory  Recurrence
What’s the trick to do it under 2 min here?
asked
Jan 1, 2019
in
Combinatory
by
shaz

315
views
madeeasytestseries
recurrencerelations
recurrence
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
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged #recurrencerelations
Recent Blog Comments
Yeah, Now it's on.
Can you check now?
Even I filled NIELIT form which had similar...
Today's test will be late  either midnight or...
on what time will be today's test?
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,375
questions
60,554
answers
201,952
comments
95,374
users