adplus-dvertising
frame-decoration

Question

T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

a.

T is a tree

b.

T contains no cycles

c.

Every pairs of vertices in T is connected by exactly one path

d.

All of these

Answer: (d).All of these

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

Similar Questions

Discover Related MCQs

Q. In what tree, for every node the height of its left subtree and right subtree differ at least by one:

Q. A hash function f defined as f(key) = key mod 7, with linear probing it is used to insert the key 37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11?

Q. The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

Q. Which traversal technique lists the nodes of a binary search tree in ascending order?

Q. What is the time required to insert an element in a stack with linked implementation ?

Q. Which of the following statement is false ?

Q. The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like : { 1, 3, 2, 5, 4, 6} is:

Q. The following lists are the degrees of all the vertices of a graph:

(i) 1, 2, 3, 4, 5                (ii) 3, 4, 5, 6, 7
(iii) 1, 4, 5, 8, 6              (iv) 3, 4, 5, 6

then, which of the above sequences are graphic?

Q. What item is at the root after the following sequence of insertions into an empty splay tree:
1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?

Q. Suppose we are implementing quadratic probing with a Hash function, Hash (y)=X mode 100. If an element with key 4594 is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is:

Q. Weighted graph:

Q. What operation is supported in constant time by the doubly linked list, but not by the singly linked list?

Q. How much extra space is used by heap sort?

Q. Binary search algorithm employs the strategy of

Q. Dangling-else ambiguity can be eliminated by

Q. If n represents the dimension of cube and K, the radix (no. of nodes along each dimensions) then the number of nodes N of a k-ary n-cube network is:

Q. The postfix form of the expression (A+B)*C-D/E is:

Q. The number of nodes in a complete binary tree of height n:

Q. Data abstraction means:

Q. The solution of recurrence relation:

T(n) = 2T(sqrt(n)) + lg (n)

is