Register

GO Classes DPP | Algorithm|BFS

536 views
3 3 votes

Among the following sequences:

I. $GDFHACBE$

II. $GHFACDBE$

III. $GHDACFBE$

IV. $GFDHCABE$

Which of the following are possible breadth-first traversals of the graph, starting from node G?

  1. I and III only
     
  2. II and IV only
     
  3. I and IV only
     
  4. II and III only

3 Answers

3 3 votes
Option C . I and IV only

Reason : The closest neighbours for G are H,D and F. They have to come in the next 3 places after 'G' in any order. And only I and IV does that. Also that is the only option satisfying the given condition, hence the correct anwer.
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | Alg...Next → · GO Classes DPP | Alg...
← Previous in category · GO Classes DPP | Alg...Next in category → · GO Classes DPP | Alg...
Position:
Show:

Related questions

3 3 votes
1 1 answer
520
520 views
GO Classes asked Sep 30, 2025
520 views
GO Classes DPP | Algorithm|DFS
Among the following sequences:I. $A B E C F G D H$II. $A D G F C H B E$III. $ACFGBDEH$IV. $ADHFGCBE$Which of the following are possible depth-first traversals (DFS) of th...
2 2 votes
2 2 answers
505
505 views
GO Classes asked Sep 30, 2025
505 views
GO Classes DPP | Algorithm|DFS
Among the following sequences:I. abefghII. afehbgIII. abghefIV. aebfhgWhich are the possible depth-first traversals of the modified graph, starting from node 'a'?I and II...
4 4 votes
2 2 answers
484
484 views
GO Classes asked Sep 30, 2025
484 views
GO Classes DPP | Algorithm|DIJKSTRA’S ALGO
Suppose we run Dijkstra's single-source shortest path algorithm on the following edge-weighted directed graph with vertex $\mathbf{S}$ as the source. (Assume alphabetical...
5 5 votes
2 2 answers
554
554 views
GO Classes asked Sep 30, 2025
554 views
GO Classes DPP | Algorithm|MST
Consider the following weighted, undirected graph:What is the total weight of the Minimum Spanning Tree (MST) for this graph?