Data Structure · all questions

Graphs
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

153

Questions

8/8

Page

Pick an option on a question to see the right answer and solution.

Q141

Every Directed Acyclic Graph has at least one sink vertex.

Select an option to see the answer and solution.

Q142

The topological sorting of any DAG can be done in . . . . . . . . time.

Select an option to see the answer and solution.

Q143

Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

Select an option to see the answer and solution.

Q144

The column sum in an incidence matrix for a simple graph is . . . . . . . .

Select an option to see the answer and solution.

Q145

The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is . . . . . . . .

Select an option to see the answer and solution.

Q146

Which of the following is true?

Select an option to see the answer and solution.

Q147

If there are more than 1 topological sorting of a DAG is possible, which of the following is true.

Select an option to see the answer and solution.

Q148

In the given graph identify the cut vertices.
Graphs mcq question image

Graphs mcq question image

Select an option to see the answer and solution.

Q149

What would be the time complexity of the following function which adds an edge between two vertices i and j, with some weight 'weigh' to the graph having V vertices?

vector<int> adjacent[15] ;
vector<int> weight[15]; 
 
void addEdge(int i,int j,int weigh) 
{	 
	adjacent[a].push_back(i); 
	adjacent[b].push_back(j); 
	weight[a].push_back(weigh); 
	weight[b].push_back(weigh); 
}

Select an option to see the answer and solution.

Q150

Which of the following properties does a simple graph not hold?

Select an option to see the answer and solution.

Q151

For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?

Select an option to see the answer and solution.

Q152

What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?

Select an option to see the answer and solution.

Q153

Number of vertices with odd degrees in a graph having a eulerian walk is . . . . . . . .

Select an option to see the answer and solution.