Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged recurrence-relation
0
votes
1
answer
1
self doubt
Solve the following recurrences using recursion tree method and write the asymptotic time complexity T(n)=T(n/2)+n^2
Çșȇ ʛấẗẻ
asked
in
Algorithms
Mar 14
by
Çșȇ ʛấẗẻ
97
views
time-complexity
recurrence-relation
4
votes
1
answer
2
GATE CSE 2023 | Question: 5
The Lucas sequence $L_{n}$ is defined by the recurrence relation: \[ L_{n}=L_{n-1}+L_{n-2}, \quad \text { for } \quad n \geq 3, \] with $L_{1}=1$ and $L_{2}=3$ ... $L_{n}=\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^{n}$
admin
asked
in
Combinatory
Feb 15
by
admin
923
views
gatecse-2023
combinatory
recurrence-relation
1-mark
0
votes
2
answers
3
GATE CSE 2023 | Memory Based Question: 15
The Lucas sequence $L_n$ is defined by the recurrence relation: $L_n=L_{n-1}+L_{n-2}$, for $n \geq 3$ with $L_1=1$ and $L_2=3$. Which one of the options given is TRUE? $L_n=\left(\frac{1+\sqrt{5}}{2}\right)^n+\left(\frac{1-\sqrt{5}}{3}\right)^n$ ... $L_n=\left(\frac{1+\sqrt{5}}{2}\right)^n+\left(\frac{1-\sqrt{5}}{2}\right)^n$
GO Classes
asked
in
Combinatory
Feb 6
by
GO Classes
460
views
memorybased-gatecse2023
goclasses
combinatory
recurrence-relation
0
votes
0
answers
4
Test series
Can anyone solve this recurrence relation T(n) = 3T(n-1) + O(n^2) Its ans is O(3^n n^2)
MonuKhan
asked
in
Algorithms
Jan 12
by
MonuKhan
289
views
recurrence-relation
algorithms
time-complexity
asymptotic-notations
21
votes
1
answer
5
Recurrence Relation - Self Doubt
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is odd ?
AKASH G
asked
in
Combinatory
Dec 31, 2022
by
AKASH G
582
views
recurrence-relation
discrete-mathematics
0
votes
1
answer
6
Solve the simultaneous recurrence relations
an = an−1 + bn−1 bn = an−1 − bn−1 with a0 = 1 and b0 = 2.
chinman12
asked
in
Combinatory
Nov 25, 2022
by
chinman12
165
views
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
7
#self_doubt
T(n)={ 0:if n<1 1:if n==1 T(n-1)+T(n-2):n>1 } if the stack size is 48 bytes and one stack entry size =4 B then maximum n=? I thought it should be 13 but the answer is 12 T(1) and T(<1) should not be stored they are already given so can we take n=13 so the last call which will be stored will be T(2)
Dknights
asked
in
Algorithms
Nov 23, 2022
by
Dknights
140
views
algorithms
recurrence-relation
time-complexity
0
votes
1
answer
8
how to solve T(n)=4T(√n)+3^5n with master theorem
how do i apply master theorem to this?
mdboi
asked
in
Algorithms
Oct 29, 2022
by
mdboi
382
views
algorithms
recurrence-relation
master-theorem
asymptotic-notations
0
votes
1
answer
9
how to solve T(n)=2T(n/2)−n^3n with master theorem
how do i apply master theorem to this? T(n)=2T(n/2)−n^3n
mdboi
asked
in
Algorithms
Oct 28, 2022
by
mdboi
199
views
algorithms
master-theorem
recurrence-relation
asymptotic-notations
0
votes
1
answer
10
𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3 using the master theorem
how do i apply master theorem to this? 𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3
mdboi
asked
in
Algorithms
Oct 28, 2022
by
mdboi
191
views
algorithms
master-theorem
recurrence-relation
asymptotic-notations
time-complexity
0
votes
1
answer
11
Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-
Shreya2002
asked
in
Algorithms
Oct 28, 2022
by
Shreya2002
408
views
made-easy-test-series
algorithms
time-complexity
recurrence-relation
0
votes
1
answer
12
How to solve this recurrence T(n)=17T(7n)+n^4
darkswow
asked
in
Algorithms
Oct 18, 2022
by
darkswow
188
views
algorithms
recurrence-relation
0
votes
0
answers
13
Recurrence relationship
T(n) = 3T(n-1) -4T(n-2) + 2T(n-3) If n = 0 then T(n) = 1 if n= 1 or 2 then T(n) = 0 What is the generalized solution?
kumar123
asked
in
Algorithms
Sep 26, 2022
by
kumar123
176
views
algorithms
recurrence-relation
1
vote
1
answer
14
Divide and conquer
How To Solve This Using Divide And Conquer Suppose we are given the two n bit integers, assuming for common sense n as power of 2. It is required to multiply them using Divide & conquer method. What is the divide & conquer recurrence, that would arise for the problem. 1. T(n) = 4T(n/2) + O(1) 2. T(n) = 2T(n/2) + O(n) 3. T(n) = 4T(n/2) + O(n^2) 4. T(n) = 4T(n/2) + O(n)
[ Jiren ]
asked
in
Algorithms
Aug 28, 2022
by
[ Jiren ]
191
views
algorithms
divide-and-conquer
recurrence-relation
3
votes
1
answer
15
Best Open Video Playlist for Recurrence relation Topic | Discrete Mathematics
Please list out the best free available video playlist for Recurrence relation Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom ... ones are more likely to be selected as best. For the full list of selected videos please see here
Arjun
asked
in
Study Resources
Aug 8, 2022
by
Arjun
179
views
missing-videos
go-classroom
free-videos
video-links
recurrence-relation
4
votes
2
answers
16
GO Classes Scholarship 2023 | Test | Question: 13
Let $\text{T}_{n}$ be the number of ways to arrange cars in a row with $n$ parking spaces if we can use sedans, SUVs, trucks to park such that a truck requires two spaces, whereas a sedan or SUV requires just one space each, and No two ... i.e. initial conditions are already given, hence no need to compute them)
GO Classes
asked
in
Combinatory
Aug 7, 2022
by
GO Classes
440
views
goclasses-scholarship-test1
numerical-answers
goclasses
combinatory
counting
recurrence-relation
2-marks
0
votes
0
answers
17
Discrete Mathematics and Combinatorics
Solve the recurrence relation $a^{2}n-5a^{2}_{n-1}+4a^{2} _{n-2}=0$, if $a_{0}=4, a_{1}=13, n>1$
kidussss
asked
in
Combinatory
Jul 9, 2022
by
kidussss
217
views
discrete-mathematics
combinatory
recurrence-relation
2
votes
1
answer
18
Recurrence Tree Method
T(n) = 5T(n/3) + T(2n/3) + 1. My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.
yuyutsu
asked
in
Algorithms
Jun 23, 2022
by
yuyutsu
345
views
recurrence-relation
algorithms
Page:
1
2
3
4
5
6
...
23
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Central Pollution Control Board CPCB Various Post Recruitment 2023
MP Rajya Sahkari Apex Bank Various Post Recruitment 2023
NITIE MUMBAI throgh GATE
PGCIL recruitment 2023 – Apply Online For 138 Posts through GATE
Admission guidance for GATE CSE 2023
Subjects
All categories
General Aptitude
(2.6k)
Engineering Mathematics
(9.4k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(655)
Exam Queries
(847)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(866)
Recent questions tagged recurrence-relation
Recent Blog Comments
Please see the updated link.
Unfortunately there won't be a hardcopy coming...
this book is not available on amazon now, i want...
Yes
Hi! @AnkitMazumder14 bhaiya,Is python...