The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
83
views
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.
madeeasytestseries
algorithms
graphalgorithms
asked
Dec 26, 2018
in
Algorithms
by
CHïntän ÞäTël
edited
Mar 5, 2019
by
Rishi yadav

83
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.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
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, 2019
in
Algorithms
by
Abhishek Kumar 38

343
views
madeeasytestseries
algorithms
graphsearch
graphalgorithms
+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

152
views
algorithms
graphalgorithms
madeeasytestseries
madeeasytestseries2018
+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

100
views
algorithms
graphalgorithms
madeeasytestseries2018
madeeasytestseries
+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

96
views
algorithms
graphalgorithms
madeeasytestseries2018
madeeasytestseries
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
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA  interview experience (2020)
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
........
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,315
questions
60,417
answers
201,730
comments
95,216
users