Graph Traversal lI Starter Quiz

Which of the following tree traversal technique is not based on depth first search?

Which of the following is not one of the applications of Breadth-first search(BFS)?

Consider the following graph:

Which of the following is not a depth first search traversal of the given graph?

Consider the following graph:

What is the depth first search (DFS) sequence for the above graph?

Consider the following graph:

Which of the following is NOT a valid BFS traversal order?

Consider the following graph G.

Modified BFS traversal on G applied as follows
Assume starting vertex is ‘a’.
At any level (breadth), vertices are visited in alphabetic order.
In above graph G, after visiting vertex ‘a’, the order of vertices visited in G are c, d and e.
It works same as BFS except the restriction on order of vertices visited.
Which of the following is not a cross edge during given BFS traversal on G?