Time Left - 15:00 mins
GATE 2019 - P&DS Quiz-11 (Graphs )
Attempt now to get your rank among 622 students!
Question 1
Which of the following statements is false?
Question 2
The BFS algorithm has been implemented using the queue data structure. One of the possible order of visiting the nodes of the below graph is 
Question 3
Consider the following graph G.
• Modified DFS on G applied as follows
• Starting vertex is ‘a’.
• Vertex is visited based on alphabetic order.
• Vertices are visited in order a, c, d…..
• It works same as DFS except the visiting order restrictions.
Which of the following is not a back edge during the above DFS traversal on G.
• Modified DFS on G applied as follows
• Starting vertex is ‘a’.
• Vertex is visited based on alphabetic order.
• Vertices are visited in order a, c, d…..
• It works same as DFS except the visiting order restrictions.
Which of the following is not a back edge during the above DFS traversal on G.
Question 4
Consider an undirected Graph A having b number of vertices and c number of edges. This graph is represented by adjacency list. In terms of Big-Oh what will be the time complexity of printing all the elements which are connected in this graph?
Question 5
Consider the following graph
What is the total number of spanning tree for the above graph?
What is the total number of spanning tree for the above graph?
Question 6
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
- 622 attempts
- 1 upvote
- 5 comments
Apr 4GATE & PSU CS
