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
MadeEasy Test Series: Algorithms - Graph Algorithms
0
votes
67
views
According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!!
like 11-12-12 then for second square 4 times 13 so c(4,2) any two of then lead to me @ answer @6.
made-easy-test-series
algorithms
graph-algorithms
asked
Dec 26, 2018
in
Algorithms
by
CHïntän ÞäTël
(
217
points)
edited
Mar 5
by
Rishi yadav
|
67
views
answer
comment
0
in 6 cases one will create a cycle if you will select EC and BC so answer will be 5 only.
0
Tq bro !!
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
2
answers
1
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
(
107
points)
|
161
views
made-easy-test-series
algorithms
graph-search
graph-algorithms
+1
vote
0
answers
2
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Can someone work this out?
asked
Jan 16, 2018
in
Algorithms
by
Kalpataru Bose
(
391
points)
|
130
views
algorithms
graph-algorithms
made-easy-test-series
madeeasy-testseries-2018
+2
votes
1
answer
3
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Consider the following graph and sequences given below : Given answer for no of DFS traversal was 2 : S1 and S2. How S2 is a DFS traversal ?
asked
Jan 12, 2018
in
Algorithms
by
sumit chakraborty
Active
(
1.1k
points)
|
78
views
algorithms
graph-algorithms
madeeasy-testseries-2018
made-easy-test-series
+2
votes
0
answers
4
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
For a directed graph, the absence of back edges in a DFS tree can have cycle. true or fale.please explain with an example.
asked
Jan 10, 2018
in
Algorithms
by
jaig
(
315
points)
|
84
views
algorithms
graph-algorithms
madeeasy-testseries-2018
made-easy-test-series
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
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.3k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.5k
Others
1.5k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
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 3-4 days but for most purpose you can...
50,648
questions
56,460
answers
195,340
comments
100,198
users