The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
0
votes
1
answer
1
internal question of UCF
void uppercase(char *s) { int i; for (i = 0; i < strlen(s); i++) s[i] = toupper(i); } void uppercase_remix(char *s) { int i, length = strlen(s); for (i = 0; i < length; i++) s[i] = toupper(i); } void uppercase_unreliable(char ... s)  1] = rand() % 25 + 'a';} considering the above codes explain in detail the running time complexities of the 4 codes in bigoh notation?
asked
2 days
ago
in
Algorithms
by
AIkiran01
(
157
points)

16
views
graphalgorithms
0
votes
0
answers
2
Space Complexity of Dijkastra's algorithm
asked
Jul 5
in
Algorithms
by
Hardik Maheshwari
(
59
points)

71
views
dijkstrasalgorithm
shortestpath
spacecomplexity
algorithms
graphalgorithms
greedyalgorithm
+1
vote
0
answers
3
Cormen 3rd edition chapter 22 question: 22.4.4
asked
Jul 4
in
Algorithms
by
Abhilash Mishra
(
85
points)

62
views
algorithms
graphtheory
graphalgorithms
topologicalsort
graphs
0
votes
2
answers
4
BFS Traversal
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain
asked
Jun 30
in
Algorithms
by
srestha
Veteran
(
88.6k
points)

42
views
bfs
algorithms
graphalgorithms
0
votes
1
answer
5
graph_doubt
"edge disjoint spanning tree" means ?
asked
Jun 30
in
Algorithms
by
air1ankit
Active
(
3.4k
points)

36
views
graphalgorithms
algorithms
+1
vote
1
answer
6
#Algortihms Gate 2000 Question Self Doubt
asked
May 29
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

63
views
algorithms
graphalgorithms
usermod
usergate2005
+1
vote
1
answer
7
#Algorithms #DFS
Consider the tree arcs of a $DFS$ traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure for computing the shortest path between every pair of vertices. the shortest path from $W$ ... in the graph. the shortest paths from $W$ to only those nodes that are leaves of $T$. the longest path in the graph.
asked
May 28
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

50
views
algorithms
graphalgorithms
graphtheory
dfs
0
votes
1
answer
8
#Algorithms Gate 2005 Question Self Doubt.
asked
May 23
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

78
views
algorithms
graphalgorithms
usergate2005
usermod
0
votes
0
answers
9
Gate 2003 GraphAlgorithms Question Doubt.
asked
May 18
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

53
views
usergate2003
usermod
algorithms
graphalgorithms
0
votes
2
answers
10
#Algorithm Bellman Ford uses which algorithm design technique
asked
May 17
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

75
views
algorithms
bellmanford
shortestpath
graphalgorithms
selfdoubt
0
votes
0
answers
11
#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
asked
May 13
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

29
views
graphtheory
algorithms
dfs
graphalgorithms
0
votes
1
answer
12
DFS Traversal
If DFS algorithm applied starting from vertex A' which uses stack data structure then the height of stack is needed in worst case for DFS traversal is ________? Soln. Its a simple piece of cake we just need to find that path which leads to maximum nodes ... 0 and when to start counting with 1 because such type of ambiguous question always let my question go wrong and its painful :(
asked
May 6
in
Algorithms
by
Na462
Active
(
3.9k
points)

59
views
dfs
algorithms
graphalgorithms
0
votes
1
answer
13
Minimum Spanning Tree
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle
asked
Apr 30
in
Algorithms
by
srestha
Veteran
(
88.6k
points)

132
views
minimumspanningtrees
algorithms
graphalgorithms
mst
0
votes
3
answers
14
#Algorithms #MST Doubt in MST Questions.
asked
Apr 29
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

77
views
algorithms
mst
graphalgorithms
+1
vote
1
answer
15
Self doubt
Is this statement correct?? and why? .If there are negative weight cycles than dijkstra will surely fail but if there are negative weight edges(need not be cycle) then dijkstra may or may not fail.
asked
Apr 24
in
Algorithms
by
Sandy Sharma
Junior
(
563
points)

98
views
algorithms
graphtheory
graphalgorithms
0
votes
1
answer
16
#Algorithms How is this equivalent in Kruskal's Algorithm's Time Complexity?
asked
Apr 21
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

57
views
algorithms
timecomplexity
graphalgorithms
0
votes
0
answers
17
#Algorithms How many cuts are possible are in a graph with n nodes?
asked
Apr 19
in
Algorithms
by
iarnav
Loyal
(
7.4k
points)

60
views
graphtheory
algorithms
graphalgorithms
minimumspanningtrees
0
votes
0
answers
18
Implementing Graph Data structure in C++
asked
Apr 8
in
Programming
by
Jason
Active
(
1.4k
points)

47
views
datastructure
algorithms
graphalgorithms
0
votes
0
answers
19
Equality of shortest path tree for given node as a root and
asked
Mar 24
in
Programming
by
GateAspirant999
Active
(
2.6k
points)

44
views
shortestpath
algorithms
graphalgorithms
0
votes
0
answers
20
DFS Modification
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
asked
Mar 21
in
Algorithms
by
ankitgupta.1729
Loyal
(
6.3k
points)

109
views
dfs
algorithms
graphalgorithms
shaisimonson
+1
vote
2
answers
21
Minimum Spanning Tree Problem
asked
Mar 19
in
Algorithms
by
pankaj_vir
Loyal
(
8.6k
points)

138
views
minimumspanningtrees
graphalgorithms
+1
vote
0
answers
22
Minimum Spanning Tree Problem
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then: 1. Shortest path will remain same 2. Mst will remain same Right? Note : Here i am doubling or tripling or four times ..... not increasing by +c
asked
Feb 19
in
Algorithms
by
Na462
Active
(
3.9k
points)

120
views
minimumspanningtrees
algorithms
mst
graphalgorithms
0
votes
0
answers
23
DFSAlgorithm
Let T be a depth first search tree in an undirected graph G. Vertices u and ν are leaves of this tree T. The degrees of both u and ν in G are at least 2. In such case in the graph there will be two cycles : One Cycle will contain u and other one v. There cannot be a graph containig a single cycle and containing both u and v and also satisfy above Constraint. Am I right?
asked
Feb 18
in
Algorithms
by
Na462
Active
(
3.9k
points)

124
views
dfs
algorithms
graphalgorithms
+9
votes
6
answers
24
GATE201847
Consider the following undirected graph $G$: Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.
asked
Feb 14
in
Algorithms
by
gatecse
Boss
(
18k
points)

2k
views
gate2018
algorithms
graphalgorithms
minimumspanningtrees
numericalanswers
+9
votes
1
answer
25
GATE201843
Let $G$ be a graph with 100! vertices!, with each vertex labelled by a distinct permutation od the numbers 1, 2, ..., 100. There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent numbers in the ... $v$. Let $y$ denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then $y+10z$ = ____
asked
Feb 14
in
Algorithms
by
gatecse
Boss
(
18k
points)

1.9k
views
gate2018
algorithms
graphalgorithms
graphconnectivity
numericalanswers
0
votes
1
answer
26
CMI2017A04
City authorities are concerned about traffic accidents on major roads. They would like to have ambulances stationed at road intersections to quickly reach the scene of any accident along these roads. To minimize response time, ambulances are to be located at intersections with ... (b) Find a spanning tree with minimum (c) Find a minimal coloring. (d) Find a minimum size vertex cover.
asked
Feb 5
in
Graph Theory
by
Tesla!
Boss
(
16.1k
points)

60
views
algorithms
graphalgorithms
cmi2017
0
votes
2
answers
27
Spanning tree
How to approach such questions ? Please provide detailed solution. Answer given is option C
asked
Feb 2
in
Graph Theory
by
kapilbk1996
(
225
points)

222
views
minimumspanningtrees
graphalgorithms
acetestseries
+2
votes
1
answer
28
Back edge,tree edge,forward edges in BFS
asked
Jan 27
in
DS
by
MIRIYALA JEEVAN KUMA
Active
(
1.8k
points)

326
views
algorithms
bfs
dfs
graphalgorithms
programminginc
datastructure
+5
votes
2
answers
29
True/False
Which of the following statements related to graphs are True? Minimum Spanning Tree has ALWAYS Minimum weight edge included in it. Minimum Spanning Tree MIGHT have Maximum weight edge weight included in it. Maximum Spanning Tree has ALWAYS Maximum weight edge included ... edge included in it. Longest path from source to destination MAY OR MAY NOT have Maximum weight edge included in it.
asked
Jan 27
in
Graph Theory
by
Balaji Jegan
Active
(
1.2k
points)

140
views
graphs
graphalgorithms
algorithms
+1
vote
0
answers
30
DFS depth first search
asked
Jan 25
in
DS
by
budhu
(
139
points)

59
views
datastructure
dfs
graphalgorithms
graphconnectivity
Page:
1
2
3
4
5
6
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
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
Research Advice
Follow @csegate
Gatecse
Recent questions tagged graphalgorithms
Recent Blog Comments
@Naveen You are welcome
@Mohit The full address was definitely on the ...
I have just received the go hardcopy. Thanks ...
Arjun Suresh Sir this is my consignment ...
i am using GO by my Gmail A/c, my email id is : ...
36,992
questions
44,560
answers
126,740
comments
43,623
users