Time Left - 15:00 mins

GATE CS 2021 : Data structure and programming quiz 11 (App update required to attempt this test)

Attempt now to get your rank among 880 students!

Question 1

Consider the following graph:

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

Question 2

Which of the following statements are TRUE?

I. BFS is implemented by using Queue.

II. DFS is implemented by using Stack.

Question 3

One of the application of DFT is to check whether a vertex is articulation point or not. So in a graph with V vertices and E edges, what is the time taken to check whether a specific vertex is articulation point or not :

Question 4

The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? if P is root Node.

Question 5

Consider the following graph :

How many Breadth First Traversals are possible starting from vertex A ____________.

Question 6

Apply DFT on the graph given below and find the minimum number of times backtracking required (start from A).

  • 880 attempts