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 #algorithms
0
votes
0
answers
1
#algorithms #recurrencerelation
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
asked
May 11
in
Algorithms
by
aniketpatil32
(
29
points)

35
views
#algorithms
#recurrencerelations
0
votes
0
answers
2
What would be the upper and lower bound for this decreasing function or invalid case? #Algorithm #Asymtoticnotations
asked
May 10
in
Algorithms
by
aniketpatil32
(
29
points)

37
views
#algorithms
asymptoticnotations
0
votes
2
answers
3
NTA NET DEC 2018
asked
Mar 12
in
Algorithms
by
Kuljeet Shan
Active
(
1.9k
points)

85
views
#recurrencerelations
#algorithms
0
votes
0
answers
4
NTA NET DEC 2018
asked
Mar 12
in
Algorithms
by
Kuljeet Shan
Active
(
1.9k
points)

43
views
#secondsmallest
#worstcase
#algorithms
0
votes
0
answers
5
MadeEasy Test Series: Algorithms  Time Complexity
asked
Jan 2
in
Algorithms
by
CHïntän ÞäTël
(
217
points)

79
views
madeeasytestseries
#algorithms
timecomplexity
0
votes
0
answers
6
#self_doubt
no of max heaps possible with nos given as 1,2,3,4,5? I am getting 8 if you get more please upload solution and do not give direct answers!
asked
Nov 22, 2018
in
Algorithms
by
Dheer
(
55
points)

46
views
#algorithms
#maxheap
0
votes
0
answers
7
#Algorithms
On a connected, directed graph with only positive edge weights, BellmanFord runs asymptotically as fast as Dijkstra. Explain: Solution: False. BellmanFord requires O(V E), regardless of the edge weights. Dijkstra runs in O (E + V lg V ). Because the graph is connected, E = Ω(V ), so O(V E) =Ω (V^2), which is clearly worse than Dijkstra. Here , what is E = Ω(V ) ?
asked
Dec 18, 2017
in
Algorithms
by
Harish Karnam
Active
(
1.3k
points)

61
views
#algorithms
#graphalgorithms
0
votes
1
answer
8
Algo Recurrence Relation using Bck Substitution
T(n) = 4T(n/2) + C ......where C Constant T(n) = 16T(n/4) + 5C Cant figure out how to generalize and compare with base condition T(n) = 1 from above step.
asked
Nov 21, 2017
in
Algorithms
by
aka 53
(
235
points)

163
views
algorithms
#backsubstitution
timecomplexity
#algorithms
#recurrencerelations
+2
votes
2
answers
9
SOLVING RECURRENCE RELATION BY BACK SUBSTITUTION
solution of t(n)= t(sqrt(n)) + n using back substitution
asked
Jul 2, 2017
in
Algorithms
by
NIHAR MUKHIYA
(
43
points)

1k
views
#algorithms
#recurrencerelations
#backsubstitution
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
REGARDING ISRO TEST SERIES BY MADEESASY
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged #algorithms
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 34 days but for most purpose you can...
50,647
questions
56,459
answers
195,377
comments
100,270
users