Register

MadeEasy Test Series: Algorithms - Graph Algorithms

• edited by
749 views
0 0 votes

 

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.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · made easy _algoNext → · Base register AM
← Previous in category · made easy _algoNext in category → · #timecomplexity
Position:
Show:

Related questions

1 1 vote
2 2 answers
3.4k
3.4k views
Abhishek Kumar 38 asked Jan 4, 2019
3,355 views
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...
1 1 vote
0 0 answers
844
844 views
Kalpataru Bose asked Jan 16, 2018
844 views
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Can someone work this out?
2 2 votes
1 1 answer
909
909 views
sumit chakraborty asked Jan 11, 2018
909 views
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 ?
2 2 votes
0 0 answers
591
591 views
jaig asked Jan 10, 2018
591 views
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.