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
https://gateoverflow.in/33989/howtosolvebelowrecurrencerelation
[closed]
+1
vote
55
views
https://gateoverflow.in/33989/howtosolvebelowrecurrencerelation
closed with the note:
my mistake
recurrence
discretemathematics
asked
Dec 23, 2018
in
Combinatory
by
mitesh kumar
Junior
(
623
points)
closed
Dec 23, 2018
by
mitesh kumar

55
views
comment
Please
log in
or
register
to add a comment.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
How to solve below recurrence relation ?
T(n)=2T(n1)+n1, T(1)=1 , n>=2 T(n)=2kT(nk)+2(k1)(n(k1))+2(k2)(n(k2))+.......+n Now k=n1 T(n)=2(n1)(1)+2(n2)(2)+2(n3)(3)+.......+2(nn)(n) T(n)=2(n)[ 1/1 + 2/2(2) +3/2 (3) + 2/ 2(4) +....] + n Now I am struck at this point how to proceed from here ?
asked
Jan 8, 2016
in
Algorithms
by
radha gogia
Loyal
(
6.4k
points)

154
views
recurrence
algorithms
+3
votes
2
answers
2
How to solve below recurrence relation ?
T(n)=2√nT(√n)+n In this If we take n=2m then and I divide the entire equation by n so I will get T(2m)/2m=2T(2m/2) + 1 Now T(2m)/2m=S(m), so equation becomes S(m)=2S(m/2)+1 therefore S(m)=⊝( ... #8861;(m) , T(2m)=2m⊝(logn)=⊝(nlogn) Is this correct approach or not ,since I am unable to do it with tree method .
asked
Jan 4, 2016
in
Algorithms
by
radha gogia
Loyal
(
6.4k
points)

988
views
recurrence
algorithms
+3
votes
1
answer
3
How to solve this recurrence relation?
Solve the equation: $a_n = 5a_{n/3} + 7, \;\; a_1 = 5$ Note: $a_0$ is not given.
asked
Nov 23, 2015
in
Combinatory
by
sampad
(
427
points)

175
views
recurrence
+3
votes
0
answers
4
Solve the following recurrence relation:
Solve the following recurrence relation: T(n)=9T(n1)20T(n2) T(0)=3 T(1)=10 a)2.5n5.4n b)3.5n4.3n c)3.4n2.5n d)4.5n2.3n can it be solved by substitution..?
asked
Jan 8, 2018
in
Combinatory
by
gari
Active
(
3.5k
points)

285
views
discretemathematics
recurrence
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
PSUs Recruitment
ISRO Recruitment
BARC Recruitment
GATE CSE: All NITs Admissions
GATE CSE: IIT Hyderabad Admissions
All categories
General Aptitude
1.9k
Engineering Mathematics
7.6k
Discrete Mathematics
5.2k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
916
Graph Theory
825
Probability
1k
Linear Algebra
728
Calculus
594
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.5k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
next level blog ..thanks
CIL question is far better. (ambiguity...
yes.... coal india framed the question paper than...
Coal india framed questions far better than...
Congratulations ....
50,834
questions
57,838
answers
199,509
comments
108,337
users