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 graphalgorithms
+3
votes
2
answers
1
Graph_Traversal
asked
Aug 30, 2017
in
DS
by
Gate Ranker18
Active
(
2.7k
points)

127
views
graphalgorithms
dfs
bfs
0
votes
1
answer
2
BFS DFS
suppose there are N number of nodes. How many ways we can write DFS and BFS sequence for it. how many are the valid sequence??? how many are invalid?? can we generalized the formula for it??
asked
Aug 22, 2017
in
DS
by
Hira Thakur
Boss
(
14.7k
points)

228
views
graphalgorithms
0
votes
1
answer
3
DFS back edge
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
asked
Aug 20, 2017
in
Programming
by
Xylene
Active
(
3.6k
points)

434
views
dfs
algorithms
graphalgorithms
+1
vote
0
answers
4
prims algo from cormen
Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it) Algorithms uses min queue in process, my dobut is when it came to choice b/w vertex 'c' and 'd' as at that time both will ... wrong answer, so prism deal with this case? If you need algo I will given you, or just please refer chapter 23 cormen prim's algorithm.
asked
Aug 5, 2017
in
Algorithms
by
bhuv
Active
(
4.8k
points)

276
views
graphalgorithms
primsalgorithm
algorithms
+2
votes
1
answer
5
Graph
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in time A. O(V^2) B. O(V + E) C. O(VE) D. none of these
asked
Jul 15, 2017
in
Algorithms
by
Abhisek Saha
(
151
points)

72
views
graph
graphalgorithms
+1
vote
3
answers
6
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
asked
Jun 26, 2017
in
Algorithms
by
Abhisek Saha
(
151
points)

280
views
algorithms
graphalgorithms
shortestpath
+9
votes
8
answers
7
ISRO201717
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
asked
May 10, 2017
in
Algorithms
by
Arjun
Veteran
(
425k
points)

5.5k
views
isro2017
datastructure
graphalgorithms
bfs
easy
+5
votes
5
answers
8
ISRO201776
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
asked
May 7, 2017
in
Algorithms
by
sh!va
Boss
(
32.5k
points)

2.6k
views
isro2017
algorithms
graphalgorithms
+1
vote
0
answers
9
internal path length of complete binary tree
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
asked
Mar 24, 2017
in
Algorithms
by
Akriti sood
Boss
(
12.2k
points)

626
views
al
binarytree
datastructure
graphalgorithms
0
votes
1
answer
10
ME Testseries
how many of the above statements are true?
asked
Mar 13, 2017
in
Algorithms
by
Shubhanshu
Boss
(
18.2k
points)

102
views
graphalgorithms
+28
votes
4
answers
11
GATE2017126
Let $G=\left ( V,E \right )$ be $any$ connected, undirected, edgeweighted graph. The weights of the edges in $E$ are positive and distinct. Consider the following statements: Minimum Spanning Tree of $G$ is always unique. Shortest path between any two vertices of $G$ is always unique. Which of the above statements is/are necessarily true? I only II only both I and II neither I nor II
asked
Feb 14, 2017
in
Algorithms
by
Arjun
Veteran
(
425k
points)

3.4k
views
gate20171
algorithms
graphalgorithms
normal
+19
votes
5
answers
12
GATE2017215
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNROP}$ $\text{POQNMR}$
asked
Feb 14, 2017
in
Algorithms
by
Madhav
Active
(
1.6k
points)

1.8k
views
gate20172
algorithms
graphalgorithms
0
votes
0
answers
13
How to Calculate No of Simple graph with labelled vertices?
No of Simple Undirected Graph with unablled vertices  2nC2 No of Simple Undirected Graph with labelled vertices  ? No of Simple Undirected Connected Graph with unablled vertices  ? No of Simple Undirected Connected Graph with labelled vertices  ?
asked
Feb 5, 2017
in
Programming
by
yg92
Active
(
3.2k
points)

135
views
graphtheory
graphalgorithms
datastructure
algorithms
permutationandcombination
0
votes
1
answer
14
MadeEasy Subject Test: Algorithms  Graph Algorithms
Will dijiktras's algoritm fail for the graph given in the question (or the question has been framed wrongly)?
asked
Feb 5, 2017
in
Algorithms
by
Raj Krishna
(
11
points)

117
views
madeeasytestseries
algorithms
graphalgorithms
+2
votes
0
answers
15
Minimum Spanning Tree
Show the different minimum spanning Trees Possible in each of the following Algorithms Prims Algorithm Kruskal
asked
Jan 26, 2017
in
Algorithms
by
Dulqar
Active
(
2.5k
points)

152
views
minimumspanningtrees
algorithms
graphalgorithms
+1
vote
2
answers
16
MadeEasy CBT 2017: Algorithms  Graph Algorithms
asked
Jan 24, 2017
in
Algorithms
by
vaishali jhalani
Active
(
4.7k
points)

1.4k
views
madeeasytestseries
cbt2017
algorithms
graphalgorithms
+3
votes
2
answers
17
Difference between Kruskal's and Prim's algorithm ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ? Any example which favours this ?
asked
Jan 24, 2017
in
Algorithms
by
Kapil
Veteran
(
50.7k
points)

1.9k
views
algorithms
graphalgorithms
kruskalsalgorithm
primsalgorithm
0
votes
1
answer
18
MadeEasy Subject Test: Algorithms  Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?
asked
Jan 24, 2017
in
Algorithms
by
S Ram
Active
(
1.7k
points)

165
views
madeeasytestseries
algorithms
graphalgorithms
+1
vote
1
answer
19
Minimum Spanning Tree ( TestBook Test Series 2)
asked
Jan 23, 2017
in
DS
by
biranchi
Active
(
1.3k
points)

145
views
minimumspanningtrees
graphalgorithms
+2
votes
1
answer
20
MadeEasy CBT 2017: Algorithms  Graph Algorithms
asked
Jan 23, 2017
in
Algorithms
by
Dulqar
Active
(
2.5k
points)

256
views
madeeasytestseries
cbt2017
algorithms
graphalgorithms
+3
votes
3
answers
21
MadeEasy CBT 2017: Algorithms  Graph Algorithms
No of topological sortings
asked
Jan 23, 2017
in
Algorithms
by
Vasu_gate2017
Active
(
1.1k
points)

658
views
madeeasytestseries
cbt2017
algorithms
graphalgorithms
topologicalsort
+1
vote
1
answer
22
MadeEasy Subject Test: Algorithms  Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?
asked
Jan 20, 2017
in
Algorithms
by
Pankaj Joshi
Active
(
2.6k
points)

587
views
madeeasytestseries
algorithms
graphalgorithms
dijkstrasalgorithm
+1
vote
1
answer
23
Algorithms, Graph theory
How to find number of BFS and DFS traversals for any complete graph? I am trying to find a formula for it.
asked
Jan 12, 2017
in
Algorithms
by
Krupa Rajani
(
195
points)

214
views
bfs
dfs
graphalgorithms
0
votes
1
answer
24
Back Edge
asked
Jan 7, 2017
in
Algorithms
by
vaishali jhalani
Active
(
4.7k
points)

305
views
algorithms
graphalgorithms
+1
vote
2
answers
25
Travelling Salesman Problem
A)250 B)300 C)550 D)375
asked
Jan 5, 2017
in
Algorithms
by
Shradha
Junior
(
633
points)

1.1k
views
graphalgorithms
0
votes
0
answers
26
Targate
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
asked
Jan 5, 2017
in
Algorithms
by
Harsh181996
Active
(
4.4k
points)

65
views
algorithms
graphalgorithms
primsalgorithm
+2
votes
1
answer
27
DFS using Stack
Could someone please explain Depth first Search using Stack? I have found different algorithms for handling the visited flag and the way the nodes are pushed. I am having problems in solving these types of questions  Find the nodes or number of nodes that are pushed onto stack more than once? Could someone please help with a small example?
asked
Dec 30, 2016
in
Algorithms
by
yg92
Active
(
3.2k
points)

1.5k
views
algorithms
dfs
treetraversal
graphalgorithms
+1
vote
1
answer
28
longest path
how can we find longest path between any pair of vertices in a garph??
asked
Dec 26, 2016
in
DS
by
Akriti sood
Boss
(
12.2k
points)

496
views
graphalgorithms
algorithms
Page:
« prev
1
2
3
4
5
6
7
8
9
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged graphalgorithms
Recent Blog Comments
@
[email protected]
Can this be updated?
Even In 2019 my 16 questions goes for negative...
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...
50,647
questions
56,497
answers
195,491
comments
100,822
users