adplus-dvertising
frame-decoration

Question

An undirected graph G (V, E) contains n (n > 2) nodes named v1, v2,...,vn. Two nodes vi and vj are connected if and only if 0 < | i – j | ≤ 2. Each edge (vi, vj) is assigned a weight i+j.
The cost of the minimum spanning tree of such a graph with 10 nodes is :

a.

88

b.

91

c.

49

d.

21

Answer: (b).91

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. An undirected graph G (V, E) contains n (n > 2) nodes named v1, v2,...,vn. Two nodes vi and vj are connected if and only if 0 < | i – j | ≤ 2. Each edge (vi, vj) is assigned a...

Similar Questions

Discover Related MCQs

Q. The power set of the set { φ} is

Q. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be

Q. In which tree, for every node the height of its left subtree and right subtree differ almost by one ?

Q. Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out ? Also find how many people sent out the letter ?

Q. The maximum number of keys stored in a B-tree of order m and depth d is

Q. Which of the following is the most powerful parring method ?

Q. The graph K3,4 has

Q. The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively)

a. Bellman Ford algorithm 1. O (m log n)
b. Kruskals algorithm 2. O (n3)
c. Floyd Warshall algorithm 3. O(mn)
d. Topological sorting 4. O(n + m)

Codes :
a b c d

Q. Let V1 = 2I – J + K and V2 = I + J – K, then the angle between V1 & V2 and a vector perpendicular to both V1 & V2 shall be :

Q. Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?

Q. Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5 ?

Q. How many solutions do the following equation have x1 + x2 + x3 = 11
where x1 ≥ 1, x2 ≥2, x3 ≥ 3

Q. The number of distinct bracelets of five beads made up of red, blue, and green beads (two bracelets are indistinguishable if the rotation of one yield another) is,

Q. 58 lamps are to be connected to a single electric outlet by using an extension board each of which has four outlets. The number of extension boards needed to connect all the light is

Q. The power set of AUB, where A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is

Q. Which is not the correct statement ?

Q. Given the following statements :

(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complementation.

Which is/are the correct statements ?

Q. Let θ(x, y, z) be the statement “x + y = z” and let there be two quantifications given as

(i) ∀x ∀y  Z ∃ θ(x, y, z)
(ii) ∃Z ∀x ∀y θ(x, y, z)
 
Where x, y, z are real numbers. Then which one of the following is correct ?

Q. Let P(rn, n) be the statement if "m divides n" where the universe of discourse for both the variables is the set of positive integers. Determine the truth values of each of the-following propositions:

I. ∀m ∀n P(m,n)
II. ∃m  ∀n P(m,n)

Q. Big O estimate for
( f(x) = (x + 1) log(x2 + 1) +3x2 is given as