Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}. What is the minimum possible weight of a spanning tree T in this graph such that vertex 0 is a leaf node in the tree T? (GATE CS 2010)(A) 7(B) 8(C) 9(D) 10

Answer»
Discussion
2.

An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,….vn. Two nodes vi , vj are connected if and only if 0 < |i – j| <= 2. Each edge (vi, vj ) is assigned a weight i + j. A sample graph with n = 4 is shown below. What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes? (GATE CS 2011)(A) 1/12(11n^2 – 5n)(B) n^2 – n + 1(C) 6n – 11(D) 2n + 1

Answer»
Discussion
3.

The length of the path from v5 to v6 in the MST of previous question with n = 10 is(A) 11(B) 25(C) 31(D) 41

Answer»
Discussion
4.

Consider a weighted complete graph G on the vertex set {v1,v2 ,v} such that the weight of the edge (v,,v) is 2|i-j|. The weight of a minimum spanning tree of G is: (GATE CS 2006)(A) n — 1(B) 2n — 2(C) nC2(D) 2

Answer» None
Discussion
5.

In the graph given in above question question, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?(A) 7(B) 8(C) 9(D) 10

Answer»
Discussion
6.

Consider the following graph:Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm?(A) (a—b),(d—f),(b—f),(d—c),(d—e)(B) (a—b),(d—f),(d—c),(b—f),(d—e)(C) (d—f),(a—b),(d—c),(b—f),(d—e)(D) (d—f),(a—b),(b—f),(d—e),(d—c)

Answer»
Discussion
7.

Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false? (GATE CS 2000)(A) Every minimum spanning tree of G must contain emin(B) If emax is in a minimum spanning tree, then its removal must disconnect G(C) No minimum spanning tree contains emax(D) G has a unique minimum spanning tree

Answer»
Discussion
8.

An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE?(A) Graph G has no minimum spanning tree (MST)(B) Graph G has a unique MST of cost n-1(C) Graph G has multiple distinct MSTs, each of cost n-1(D) Graph G has multiple spanning trees of different costs

Answer»
Discussion