Time Left - 10:00 mins
GATE CS 2018 - Data Structures Quiz 8
Attempt now to get your rank among 1050 students!
Question 1
Maximum number of edges in an n-node undirected graph without self loops is
Question 2
Consider the DAG with V = {1,2,3,4,5,6}, shown below. 
Which of the following is NOT a topological ordering?
Question 3
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.
Question 4
Consider the directed graph given below:
Which one of the following is TRUE?
Which one of the following is TRUE?
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?
- 1050 attempts
- 8 upvotes
- 39 comments
May 14GATE & PSU CS
