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
0
answers
1
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
2 days
ago
by
kumar123
75
views
algorithms
recurrence-relation
1
vote
1
answer
2
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
by
[ Jiren ]
96
views
algorithms
divide-and-conquer
recurrence-relation
3
votes
1
answer
3
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
by
Arjun
92
views
missing-videos
go-classroom
free-videos
video-links
recurrence-relation
4
votes
2
answers
4
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
by
GO Classes
308
views
goclasses-scholarship-test1
numerical-answers
goclasses
combinatory
counting
recurrence-relation
2-marks
0
votes
0
answers
5
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
by
kidussss
144
views
discrete-mathematics
combinatory
recurrence-relation
1
vote
1
answer
6
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
by
yuyutsu
244
views
recurrence-relation
algorithms
Page:
1
2
3
4
5
6
...
22
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged recurrence-relation
Recent Blog Comments
Should be working now
@Arjun Sir but it is not working. i dont know...
@Nisha Bharti. What exactly is not working...
@Hira Thakur Why are you personaly reply me....
@GateOverflow04 it means pursuing Btech not...