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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged graphalgorithms
+2
votes
2
answers
1
UGCNETJune2019II61
Match ListI with ListII: ... (d)(ii) (a)  (ii); (b)(i); (c)(iv); (d)(iii) (a)  (iii); (b)(i); (c)(iv); (d)(ii)
asked
Jul 2
in
Algorithms
by
Arjun
Veteran
(
418k
points)

97
views
ugcnetjune2019ii
graphalgorithms
0
votes
2
answers
2
GEEKS FOR GEEKS GATE 2017 MOCK
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)
asked
Jun 9
in
Algorithms
by
Hirak
Active
(
3.4k
points)

91
views
kruskalsalgorithm
graphalgorithms
greedyalgorithm
datastructure
+1
vote
0
answers
3
Difference between DAG and Multistage graph
I have trouble understanding the difference between DAG and Multistage graph. I know what each of them is But I think that a multistage graph is also a DAG. Are multistage graphs a special kind of DAG?
asked
Apr 28
in
Graph Theory
by
gmrishikumar
Active
(
1.9k
points)

63
views
graphtheory
graphalgorithms
graphconnectivity
multistagegraph
directedacyclicgraph
dag
0
votes
0
answers
4
Cormen Edition 3 Exercise 22.1 Question 8 (Page No. 593)
Suppose that instead of a linked list, each array entry $adj[u]$ is a hash table containing the vertices $v$ for which $(u,v) \in E$. If all edge lookups are equally likely, what is the expected ... alternate data structure for each edge list that solves these problems. Does your alternative have disadvantages compared to the hash table ?
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

30
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
0
answers
5
Cormen Edition 3 Exercise 22.1 Question 6 (Page No. 593)
Most graph algorithms that take an adjacencymatrix representation as input require time $\Omega(V^2)$,but there are some exceptions. Show how to determine whether a directed graph $G$ contains a universal link $$ a vertex with indegree $V1$ and outdegree $0$ in time $O(V)$ , given an adjacency matrix for $G$.
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

28
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
0
answers
6
Cormen Edition 3 Exercise 22.1 Question 5 (Page No. 593)
The square of a directed graph $G=(V,E)$ is the graph $G^2=(V,E^2)$ such that $(u,v) \in E^2$ if and only $G$ contains a path with at most two edges between $u$ and $v$ .Describe efficient algorithms for computing $G^2$ and $G$ for both the adjacency list and adjacencymatrix representations of G. Analyze the running times of your algorithms.
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

14
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
1
answer
7
Cormen Edition 3 Exercise 22.1 Question 4 (Page No. 593)
Given an adjacencylist representation of a multi graph $G=(V,E)$, describe an $O(V+E)$ time algorithm to compute the adjacencylist representation of the equivalent undirected graph $G'=(V,E')$ , where $E'$ is ... the edges in $E$ with all multiple edges between two vertices replaced by a single edge and with all selfloops removed.
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

27
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
0
answers
8
Cormen Edition 3 Exercise 22.1 Question 3 (Page No. 592)
The transpose of a directed graph $G=(V,E)$ is the graph $G^T=(V,E^T)$, where $E^T=\{(v,u) \in V * V :(u,v) \in E \ \}$ .Thus ,$G^T$ is $G$ with all its edges reversed . Describe ... algorithms for computing $G^T$ from $G$,for both the adjacency list and adjacency matrix representations of $G$. Analyze the running times of your algorithms.
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

19
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
1
answer
9
Cormen Edition 3 Exercise 22.1 Question 2 (Page No. 592)
Give an adjacencylist representation for a complete binary tree on $7$ vertices. Give an equivalent adjacencymatrix representation. Assume that vertices are numbered from $1\ to\ 7$ as in a binary heap.
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

16
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
1
answer
10
Cormen Edition 3 Exercise 22.1 Question 1 (Page No. 592)
Given an adjacencylist representation of a directed graph, how long does it take to compute the outdegree of every vertex ? How long does it take to compute the indegrees ?
asked
Apr 7
in
Algorithms
by
akash.dinkar12
Boss
(
41.4k
points)

17
views
cormen
algorithms
graphalgorithms
descriptive
0
votes
0
answers
11
GATE  GATECS2003
Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between (A) k and n (B) k – 1 and k + 1 (C) k – 1 and n – 1 (D) k + 1 and n – k The answer is C . how is it k1?? I mean if we have only one component .?Please explain
asked
Mar 31
in
Algorithms
by
Doraemon
(
401
points)

23
views
graphalgorithms
0
votes
0
answers
12
CLRS CHAPTER 25
FOR THE EXTENDEDSHORTESTPATH if we want to find the distance between 1>4 and the 1>5 +5>4 gives the shortest path and if 1>5 gets its shortest path as 1>2>5 and 5>4 gets its shortest path as 5>3>4 then how will we get it?? as one of the operands is always from the initial array.
asked
Mar 30
in
Programming
by
Doraemon
(
401
points)

15
views
graphalgorithms
+1
vote
1
answer
13
CLRS Chapter22 Figure22.6
What are the strongly connected components in the above figure ?
asked
Mar 30
in
Algorithms
by
Doraemon
(
401
points)

42
views
stronglyconnectedcomponents
dfs
graphalgorithms
0
votes
1
answer
14
Made Easy Workbook
Suppose that you are running Dijkstra’s algorithm on the edgeweighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of each vertex after vertex E has been deleted from the priority queue and relaxed. Vertex Distance Parent A 0 Null B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What could be the possible value of expression x+y?
asked
Mar 10
in
Algorithms
by
noob_coder
(
481
points)

211
views
algorithms
graphalgorithms
dijkstrasalgorithm
+1
vote
1
answer
15
BFS traversal path
What will be the path from AH if BFS is used in the following graph?
asked
Feb 2
in
Algorithms
by
saptarshiDey
(
117
points)

89
views
graphalgorithms
algorithms
bfs
datastructure
0
votes
2
answers
16
made easy
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
asked
Jan 26
in
Algorithms
by
screddy1313
(
455
points)

70
views
graphalgorithms
dijkstrasalgorithm
programminginc
0
votes
1
answer
17
GATEBOOK2019 Mock Test127
Consider the following directed graph. Which of the following is a topological sort of the nodes of the graph? $5, 7, 10, 13, 14, 17, 20, 30$ $10, 5, 13, 14, 7, 30, 17, 20$ $10, 20, 5, 17, 13, 14, 7, 30$ $10, 5, 20, 13, 17, 30, 14, 7$
asked
Jan 19
in
Algorithms
by
GATEBOOK
Boss
(
11.4k
points)

75
views
gb2019mock1
graphalgorithms
+1
vote
1
answer
18
MadeEasy Test Series 2019: Algorithms  Graph Algorithms
Which is the best data structure to implement topological sort on directed graph? Heap Stack queue Array
asked
Jan 5
in
Algorithms
by
Nandkishor3939
Active
(
1.1k
points)

126
views
topologicalsort
madeeasytestseries
graphalgorithms
0
votes
1
answer
19
MadeEasy Test Series: Algorithms  Graph Algorithms
Which of the following statement is true? For a directed graph, the absence of back edges in a DFS tree can have cycle. If all edge in a graph have distinct weight then the shortest path between two vertices is unique. The depth of any DFS ( ... tree rooted at a vertex is atleast as depth of any BFS tree rooted at the same vertex. Both (a) and (c)
asked
Jan 4
in
Algorithms
by
Abhishek Kumar 38
(
81
points)

122
views
madeeasytestseries
algorithms
graphsearch
graphalgorithms
0
votes
0
answers
20
Zeal Test Series 2019: Algorithms  Graph Algorithms
If the DFS finishing time f[u] < f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v in the depth first tree ? True /False can anyone explain it ?
asked
Jan 2
in
Algorithms
by
Prince Sindhiya
Loyal
(
5.5k
points)

61
views
zeal
algorithms
graphalgorithms
zeal2019
0
votes
0
answers
21
BFS and DFS  types of edges
Can someone please explain what are the types of edges possible in BFS and DFS for DIRECTED as well as UNDIRECTED graphs? Individual meaning of BACK, FRONT and CROSS edges is clear, but can’t decide which are present and which are not for Traversals. an example would be of great help or any specific reference on this.
asked
Dec 30, 2018
in
Algorithms
by
Markzuck
Junior
(
655
points)

129
views
dfs
bfs
algorithms
graphalgorithms
0
votes
0
answers
22
MadeEasy Test Series: Algorithms  Graph Algorithms
According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!! like 111212 then for second square 4 times 13 so c(4,2) any two of then lead to me @ answer @6.
asked
Dec 26, 2018
in
Algorithms
by
CHïntän ÞäTël
(
211
points)

63
views
madeeasytestseries
algorithms
graphalgorithms
0
votes
1
answer
23
BFS problem
True or False , with reason. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic? Answer is False Explanation: FALSE. It is true that the absence of back edges with respect to a DFS tree ... a cycle using such cross edges (which decrease the level) and using forward edges (which increase the level) Can someone explain it ?
asked
Dec 25, 2018
in
Algorithms
by
Sandy Sharma
Active
(
1.2k
points)

143
views
algorithms
graphalgorithms
dfs
datastructure
bfs
+1
vote
1
answer
24
Which of the following condition is sufficient to detect cycle in a directed graph?
asked
Dec 12, 2018
in
Algorithms
by
Gangani_Son
(
125
points)

376
views
graphtheory
dfs
geekstogeeks
graphalgorithms
0
votes
1
answer
25
which DFS algorithm to follow?
there are multiple algorithm of DFS available and i cant figure out which one to follow for solving question asking for the nodes which aren't pushed into the stack or the nodes which are pushed more than once, Tried to figure out from ... , https://gateoverflow.in/98484/dfsusingstack https://gateoverflow.in/161225/dfsnumberofnodesnotpushedintothestack
asked
Dec 9, 2018
in
Algorithms
by
Shivam Kasat
Active
(
3.1k
points)

125
views
dfs
algorithms
graphalgorithms
+1
vote
0
answers
26
Depth First Search: Finding if The graph is connected
Better Explanation??
asked
Dec 8, 2018
in
DS
by
pradeepchaudhary
Active
(
1.2k
points)

38
views
datastructure
dfs
graphalgorithms
0
votes
0
answers
27
Graph Algorithms
Dijktra Algo selects shortest path having maximum number of shortest edges, for non adjacent nodes. Is it true? Please justify..
asked
Nov 25, 2018
in
Algorithms
by
Shamim Ahmed
Active
(
2.3k
points)

50
views
algorithms
graphalgorithms
0
votes
0
answers
28
EdgeClassification In DIrected Graph using BFS
In BFS of a directed graph, we don't have forward edges.Only tree edge,cross edge or back edge. Below is a sample graph I have taken and classified edge types. Please verify guys whether it's correct. The ... in the selected answer here. https://stackoverflow.com/questions/29631211/edgeclassificationduringbreadthfirstsearchonadirectedgraph
asked
Nov 22, 2018
in
Programming
by
Ayush Upadhyaya
Boss
(
25.9k
points)

212
views
graphalgorithms
bfs
0
votes
0
answers
29
BFS TRAVERSAL
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
asked
Nov 21, 2018
in
Programming
by
codingo1234
Junior
(
775
points)

49
views
bfs
algorithms
graphalgorithms
0
votes
0
answers
30
MADE EASY TEST SERIES SELF DOUBT
In an adjacency list representation of an undirected graph G = (V,E), for any 2 sets of vertices V1 and V2 let, distance (V1,V2) be defined as the minimum of the length of shortest distance between a vertex in V1 and V2, if V1 ∩ V2 ≠ ∅, then ... computing distance (V1,V2) is : WHAT KIND OF SETS IT IS TALKING ABOUT .....?AND HOW IT CAN BE FORMED PLEASE GIVE EXAMPLE .
asked
Nov 21, 2018
in
Algorithms
by
eyeamgj
Loyal
(
6.1k
points)

104
views
graphalgorithms
Page:
1
2
3
4
5
6
...
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
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Follow @csegate
Recent questions tagged graphalgorithms
Recent Blog Comments
will pdfs be uploaded ?
6th...
Sir
4th...
49,984
questions
55,135
answers
190,487
comments
85,111
users