1.

Number of edges in a tree with 10000 vertices is

a) 9999
b) 10001
c) 5000
d) 5001
2. Number of vertices in a full 5-ary tree with 100 internal vertices is
a) 500
b) 501
c) 499
d) None of these
3. Number of edges in a full binary tree with 1000 internal vertices is
a) 500
b) 501
c) 2000
d) 2001
4. Number of vertices in a full binary tree with 1000 internal vertices is
a) 500
b) 501
c) 2000
d) 2001
5. Number of leaves in a full 3-ary tree with 100 vertices is
a) 301
b) 67
c) 150
d) None of these
6. In the above tree, which vertex is the root?
a) l
b) f
c) c
d) a
7. In the above tree, which vertices are internal?
a) c
b) g
c) k
d) Both a and b
8. Which vertices are leaves in the above tree?
a) e
b) g
c) i
d) All of the above
9. Which vertex is a child of f?
a) l
b) b
c) e
d) g
10.Which vertex is parent of h?
a) p
 b) o
c) c
d) a
11.Which vertices are siblings of j?
a) i and k
b) d
c) q and r
d) q, r, s, t, u
12.Which vertices are ancestors of f?
a) l, m, n
b) e, b, a
c) b, a
d) b, c, d
13.Which vertices are descendants of q?
a) j, d, a
b) t, u
c) s, t
d) s, t, u
14.Which of the following is true for above given tree?
a) It is a full binary tree.
b) It is a full 3-ary tree.
c) It is a balanced tree .
d) It is a tree with 7 vertices at level 2.
15.Height of the tree is
a) 4
b) 5
c) 6
d) 7
16.In a full m-ary tree, all internal vertices have
a) Degree m
b) At least m children
c) At most m children
d) Exactly m children
17.In an m-ary tree, all internal vertices have
a) At least m children
 b) At most m children
c) Exactly m children
d) Degree m
18.A leaf in a tree is a vertex which has
a) Exactly two children.
b) No child
c) No parent
d) Exactly two parents
19.The level of the root in a full 3-ary tree is
a) 2
b) 3
c) 0
d) 1
20.Number of leaves in a full 3-ary tree of height 1 is
a) 1
b) 2
c) 3
d) 4
21.Number of internal vertices in a full 3-ary tree of height 1 is
a) 1
b) 2
c) 3
d) 4
22.Number of vertices in a full 3-ary tree of height 1 is
a) 1
b) 2
c) 3
d) 4
23.Number of edges to be removed from a connected graph with n vertices
and m edges to produce a spanning tree is
a) m - n + 1
b) m – n
c) n + m – 1
d) n – m + 1
24.Number of edges to be removed from K4 to produce a spanning tree is
 a) 2
b) 3
c) 4
d) 5
25.While forming binary search tree for the words Banana, Apple, Peach
and Pear (taking root Banana and including keys sequentially) ,which of
the following is false?
a) Peach is the right child of root with key Banana.
b) Apple is the left child of Peach.
c) Pear is the right child of Peach.
d) None of these.
26.Number of edges to be removed from W4 to produce a spanning tree is
a) 2
b) 3
c) 4
d) 5
27.Chromatic number of a tree can be
a) 1 or 2
b) 2
c) 3
d) 1
28.Chromatic number of a tree with at least two vertices is
a) 1 or 2
b) 2
c) 1
d) 3
29.Which of these is true?
a) There is a unique spanning tree for every graph.
b) The minimum spanning tree is unique.
c) The minimum spanning tree obtained by Prim’s algorithm is same as
obtained by Kruskal’s algorithm.
d) The weights of minimum spanning trees obtained by Prim’s and
Kruskal’s algorithm are same.
30. While forming binary search tree for the words in the sentence “The
quick brown fox jumps over the lazy dog,” which is false?
a) Fox has two children.
b) There are two leaves in the tree so formed.
c) Brown is the right child of Quick.
d) Over is the right child of Jumps.