menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Feedback to GATE Overflow Test Takers
GATE 2021 – Online registration portal
IIT Madras MS CS Interview Experience - 2020
JEST TCS (Theoretical Computer Science) EXAM || Gateway of IISc other than GATE exam
Divisibility language and Minimum Number of States in a DFA accepting a binary number divisible by 'n'
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.4k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Programming
(3.6k)
DS
(1.4k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(1k)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(873)
Recent Blog Comments
yes thank you @gatecse
How is the test series of GO compared to ME in...
did the interview and final selection happen...
In hard copy solution is availbale or only...
how do i upload my id proof i am trying to apply...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Depth First Search: Finding if The graph is connected
1
vote
86
views
Better Explanation??
data-structures
dfs
graph-algorithms
asked
Dec 8, 2018
in
DS
pradeepchaudhary
86
views
answer
comment
0
answer should be B) introduce a start vertex T and it forms a tree (T->Q->R | T->P | T->S)
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
C is the correct answer.
answered
Sep 26, 2019
tech_beardo
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
2
votes
0
answers
1
272
views
Depth first search
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10
asked
Aug 21, 2018
in
DS
Na462
272
views
dfs
data-structures
graph-algorithms
4
votes
1
answer
2
186
views
DFS- depth first search
asked
Jan 25, 2018
in
DS
budhu
186
views
data-structures
dfs
graph-algorithms
graph-connectivity
0
votes
0
answers
3
264
views
Depth First Search
asked
Nov 7, 2018
in
Programming
Na462
264
views
dfs
data-structures
graph-algorithms
1
vote
1
answer
4
192
views
DFS- Depth First Search
asked
Dec 3, 2017
in
Algorithms
Shubham Kumar Gupta
192
views
dfs
algorithms
graph-algorithms
data-structures
...