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 recurrenceeqation
0
votes
0
answers
1
Ace Test Series: Discrete Maths  Recurrence Relation
asked
Jan 6, 2019
in
Combinatory
by
Sinchit

69
views
acetestseries
discretemathematics
recurrenceeqation
0
votes
1
answer
2
Recurrence relation
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP
asked
Jan 5, 2019
in
Algorithms
by
Mayankprakash

268
views
recurrenceeqation
timecomplexity
recurrence
algorithms
+1
vote
1
answer
3
Solve the recurrence $T(n) = 2 T \left ( \sqrt n \right ) + n$
asked
Dec 22, 2018
in
Algorithms
by
`JEET

338
views
recurrenceeqation
0
votes
0
answers
4
ace academy test series
Please explain in some detail.
asked
Nov 24, 2018
in
Combinatory
by
amitqy

56
views
recurrenceeqation
discretemathematics
0
votes
1
answer
5
recurrence relation
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
asked
Nov 18, 2018
in
Algorithms
by
LavTheRawkstar

218
views
relations
recurrence
algorithms
timecomplexity
recurrenceeqation
0
votes
1
answer
6
Analysis of algorithms of recurrence relation
I want to learn to find time complexity of the recurrence relation of an algorithm. Please suggest some good links or any gatetoverflow imp questions links to look as examples . Thanks
asked
Oct 31, 2018
in
Algorithms
by
Mayankprakash

156
views
algorithms
recurrenceeqation
recurrence
0
votes
2
answers
7
Recurrence Relation
Let $T(n) = T(n1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $ $O(n^{2})$ $O(logn)$ $O(nlogn)$ $O(n^{2}logn)$
asked
Oct 5, 2018
in
Combinatory
by
Lakshman Patel RJIT

282
views
discretemathematics
recurrence
relations
recurrenceeqation
+4
votes
3
answers
8
recurrence relation MIT
$T(n)=\sqrt{n} T(\sqrt{n})+100n$ Please solve this.
asked
Oct 4, 2018
in
Algorithms
by
sushmita

409
views
recurrence
algorithms
timecomplexity
recurrenceeqation
discretemathematics
0
votes
1
answer
9
Recurrence Relation
Solve the following recurrence relation : N(h)=N(h−1)+N(h−2)+1
asked
Jul 27, 2018
in
Programming
by
bts

146
views
recurrence
timecomplexity
recurrenceeqation
algorithms
0
votes
0
answers
10
Recurrence Equation
To prove that the time complexity of equation T(n) = T(α n) + T((1 – α)n) + βn is Θ(n logn).
asked
Jul 2, 2018
in
Algorithms
by
pk14697

114
views
time
timecomplexity
algorithms
recurrenceeqation
+1
vote
2
answers
11
Cormen
T(n)=T(n1)+2n where T(1)=1 Solve recurrence relation
asked
Jun 8, 2018
in
Algorithms
by
vijju532

240
views
recurrenceeqation
algorithms
asymptoticnotations
timecomplexity
+2
votes
1
answer
12
Cormen 4.45
Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer.
asked
Mar 9, 2018
in
Algorithms
by
Tesla!

377
views
algorithms
asymptoticnotations
recurrenceeqation
timecomplexity
+6
votes
1
answer
13
Recurrence Relation
$T(n) = 2T(\sqrt{n}) + n$
asked
Jan 20, 2018
in
Algorithms
by
Shubhanshu

346
views
algorithms
timecomplexity
recurrenceeqation
recurrence
0
votes
1
answer
14
recurrence relation
what is the recurrence relation for binary search and linear search? please explain how to derive them.
asked
Jan 11, 2018
in
Algorithms
by
iarnav

155
views
recurrence
algorithms
timecomplexity
recurrenceeqation
discretemathematics
+1
vote
1
answer
15
Test series
The recurrence relation T(n) =2t(n/2) + n/logn , T(1) =1 Evaluates to Plz explain how to evaluate ?
asked
Jan 11, 2018
in
Algorithms
by
ankit_thawal

57
views
recurrenceeqation
+1
vote
1
answer
16
Algorithms recurrence relation
Base condition T(n) = 1 Otherwise T(n) = T(n1) +n Then After solving i got to this step ...how should i generalize now T(n) = T( nk) + n(k1) + n(k2)+n
asked
Nov 25, 2017
in
Algorithms
by
aka 53

63
views
algorithms
recurrenceeqation
+3
votes
2
answers
17
Recurrance Relations
asked
Nov 13, 2017
in
Linear Algebra
by
Parshu gate

127
views
recurrenceeqation
+2
votes
1
answer
18
Cormen 3rd edition (Chapter 4 Divide & Conquer)
Refer Cormen 43 (j) Page no108 Give Asymptotic upper bound of given recurrence using "SUBSTITUTION METHOD" T(n)=n^(1/2) .T(n^(1/2)) +n
asked
Jul 22, 2017
in
Algorithms
by
Veeplob Singh

240
views
algorithms
asymptoticnotations
functions
recurrenceeqation
+3
votes
1
answer
19
Time Complexity for Recurrence relation
What will be the time complexity for the following recurrence relation? $T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$ According to me it is $\Theta (n(logn)^{3})$ . Please confirm.
asked
Jun 16, 2017
in
Algorithms
by
Ashish Sharma 3

555
views
timecomplexity
recurrence
recurrenceeqation
mastertheorem
0
votes
0
answers
20
Recurrence relation and generating function
We have two types of shapes. Using these shapes we need to construct $2$*$x$ shapes (height is 2 units and width is $x$ units). For example, all $5$ possible constructions of $2$*$2$ area are shown below, And following is one possible construction of $2$*$4$ ... $3$,$4$.....$\infty$, then find $G(x)$ corresponding to <$h_0$,$h_1$,$h_2$,$h_3$...>
asked
Mar 19, 2017
in
Combinatory
by
dd

321
views
generatingfunctions
combinatory
recurrenceeqation
0
votes
0
answers
21
Recurrence relation
**Given an integer, n, find the smallest integer m such that is divisible by n (i.e.n, is a factor of m ) and satisfies the following properties:** 1. **m** must not contain zeroes in its decimal representation. 2. The sum of **m's** digits must be greater ... 's** digits. Given **n**, find the number of digits in **m's** decimal representation. *Note: n is not divisible by 10.*
asked
Feb 2, 2017
in
Combinatory
by
Anand.

102
views
recurrenceeqation
recurrence
algorithms
+2
votes
1
answer
22
Recurrence relation for total no of n length English letter words, with even no of a’s
asked
Jan 14, 2017
in
Combinatory
by
yg92

220
views
recurrence
combinatory
recurrenceeqation
+3
votes
1
answer
23
Solve the Recurrence
Solve the Following Recurrence using Back Substitution Master Theorem $T(n)=T(\sqrt{n})+n+c$ Using Master Theorem Using Master Theorem, put n = $2^{m}$ $ T(n)=T(2^{m})= S(m)$ ie $T(\sqrt{n}) = S(\frac{m}{2})$ ... How to proceed further... ?
asked
Dec 22, 2016
in
Algorithms
by
Dulqar

270
views
algorithms
recurrenceeqation
+3
votes
2
answers
24
#recurrence relation
solve the recurrence relation: $T(n)=T(\sqrt{n})+\Theta (\log \log n)$ My first step was to let $m=\log n$, making the above: $T(2^m)=T(2^{\frac{m}{2}})+\Theta (\log m)$ Why we can say that $S(m)=T(2^{m})$ ? Please Explain the upcoming steps ?
asked
Dec 14, 2016
in
Algorithms
by
Atul Verma12

235
views
algorithms
recurrenceeqation
timecomplexity
–1
vote
0
answers
25
Recurrence relation
How to determine asymptotic Lower bound, Upper bound and Tight bound for a recurrence relation. Explain with example.
asked
Dec 1, 2016
in
Algorithms
by
Geet

88
views
recurrenceeqation
timecomplexity
algorithms
+3
votes
1
answer
26
Recurrence
Solve the Recurrence $\begin{align} T(n) &= T \left ( \frac n 2 1 \right ) + T \left ( n \frac n 2 \right ) + \Theta(n) \end{align}$
asked
Nov 10, 2016
in
Algorithms
by
srestha

126
views
recurrenceeqation
+2
votes
2
answers
27
Permutation
Given a integer N greater than zero. How many sequences of 1's and 2's are there such that sum of the numbers in the sequence = N ? (not necessary that every sequence must contain both 1 and 2 ) example : for N = 2 ; 11,2 => ans = 2 sequences of 1's and 2's for N = 3 ; 11,12,21 => ans = 3 sequences of 1's and 2's
asked
Aug 30, 2016
in
Combinatory
by
dd

249
views
combinatory
generatingfunctions
recurrenceeqation
+3
votes
1
answer
28
Solving Recurrence
What is the solution for the recurrence $T(n)=3T(n/4)+logn$
asked
Aug 27, 2016
in
Algorithms
by
Manu Madhavan

187
views
recurrenceeqation
+3
votes
1
answer
29
Recurrence relation in constructing balanced tree from linked list and array
Consider the following algorithm to build a balanced search tree from a sorted sequence. * Make the midpoint of the sequence the root of the tree * Recursively construct balanced search trees from elements to the left and right of the ... O(n) 2 O(n log n) 3 O(n2) 4 Depends on the contents of the original sequence
asked
Aug 23, 2016
in
Algorithms
by
dd

654
views
linkedlists
algorithms
recurrence
recurrenceeqation
+1
vote
0
answers
30
Recurrence relation and probability
N rooms are there and they are numbered from 1 to N. A person P is in charge of room allocation and allocates these rooms inthe following way: Each query ask for two consecutive rooms. P selects two consecutive rooms out of the vacant ... selects (2,3) Seconds query onwards can not be processed. because although 1,4 are vacant, these rooms are not consecutive.
asked
Aug 23, 2016
in
Unknown Category
by
dd

277
views
nongate
algorithms
dynamicprogramming
recurrenceeqation
recurrence
Page:
« prev
1
2
3
next »
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 recurrenceeqation
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,375
users