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
ISI2015MMA1
Let $\{f_n(x)\}$ be a sequence of polynomials defined inductively as $ f_1(x)=(x2)^2$ $f_{n+1}(x) = (f_n(x)2)^2, \: \: \: n \geq 1$ Let $a_n$ and $b_n$ respectively denote the constant term and the coefficient of $x$ in $f_n(x)$. Then $a_n=4, \: b_n=4^n$ $a_n=4, \: b_n=4n^2$ $a_n=4^{(n1)!}, \: b_n=4^n$ $a_n=4^{(n1)!}, \: b_n=4n^2$
asked
Sep 23, 2019
in
Combinatory
by
Arjun
Veteran
(
431k
points)

39
views
isi2015mma
recurrencerelations
nongate
0
votes
1
answer
2
Recurrence Relations
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then $A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ $D)T(n)=\theta(n^{3}logn)$
asked
Nov 1, 2018
in
Algorithms
by
Lakshman Patel RJIT
Veteran
(
59.1k
points)

89
views
algorithms
recurrencerelations
timecomplexity
+1
vote
2
answers
3
ISI2016PCBA3
A bit string is called legitimate if it contains no consecutive zeros $, e.g., 0101110$ is legitimate, where as $10100111$ is not. Let $a_n$ denote the number of legitimate bit strings of length $n$. Define $a_0=1$. Derive a recurrence relation for $a_n ( i.e.,$ express $a_n$ in terms of the preceding $a_i's).$
asked
Sep 18, 2018
in
Combinatory
by
jothee
Veteran
(
105k
points)

38
views
isi2016pcba
permutationandcombination
recurrencerelations
nongate
descriptive
0
votes
1
answer
4
UGCNETSep2013III37
The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) is O(Ig n) O(n) O(n Ig n) O(n$^2$)
asked
Jul 24, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

410
views
ugcnetsep2013iii
algorithms
timecomplexity
recurrencerelations
0
votes
1
answer
5
UGCNETJune2013III12
The solution of recurrence relation, $T(n) = 2T (floor (\sqrt{n}))+\log n$ is $O(n \log \log \log n)$ $O(n \log \log n)$ $O(\log \log n)$ $O(\log n \log \log n)$
asked
Jul 16, 2016
in
Others
by
jothee
Veteran
(
105k
points)

464
views
ugcnetjune2013iii
algorithms
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged recurrencerelations
Recent Blog Comments
Yes and few more questions also
nkg_master9 you challenged that dbms query...
@nsaisirisha Yes they will give marks only...
When will the results be declared based on...
For the questions with two answers as per the...
50,737
questions
57,336
answers
198,445
comments
105,202
users