Multiple Choice Questions

DM UNIT 5
Question What is the total no of nodes in full binary tree with 20 leaves?
1

Option a 38

Option b 35

Option c 37

Option d 39

Answer Option d

Marks 1

Question If there are 60 contestant in a single elimination to tournament, How

2 many matches are played

Option a 60

Option b 59

Option c 78

Option d 80

Answer Option b

Marks 1

Question The total number of vertices in a full binary tree is always

3

Option a minimum
Option b maximum

Option c odd

Option even

Answer Option c

Question A vertex of degree 1 in tree is called a_ _ _ _ _

4

Option a Branch node

Option b terminal node

Option c Internal node

Option d Forest

Answer Option b

Marks 2

Question G is a tree if and only if G is connected and has exactly _ _ _ _ _edged

5

Option a (n-1), n is number of vertices in G

Option b (2n-1) , n is number of vertices in G

Option c (4n-2) , n is number of vertices in G

Option d (3n-1) , n is number of vertices in G

Answer Option a

Marks 1
Question _ _ _ _ _ _of vertex V in graph G is distance from V to vertex farthest from V in G
6

Option a eccentricity

Option b Optimal tree

Option c decentricity

Option d forest

Answer Option a

Question What is the total weight of following tree

7

Option a 243

Option b 234

Option c 242

Option d 251

Answer Option c

Marks 1
Question Which of the following is spanning tree for following graph
8

Option a

Option b

Option c

Option d All of the above

Answer Option d

Marks 1

Question What is the cut set of e1 edge in following graph

9
Option a {e2,e3,e5}

Option b {e7,e5}

Option c {e1,e2,e3}

Option d {e4,e5}

Answer Option c

Marks 1

Question State whether following statements are true or false.

10
1) A spanning tree of graph G, includes all the vertices of G
2) Warshall’s algorithm is used to find minimum spanning tree of graph

Option a True , True

Option b True , False

Option c False , True

Option d False , False

Answer Option b

Marks 1
Question If weight of the full binary tree is minimum then it is called_ _ _ _ _
11

Option a Optimal tree

Option b Rooted tree

Option c Traversal tree

Option d m-ary tree

Answer Option a

Marks 1

Question Construct a algebraic expression of following labeled tree

12

Option a [((x+y)*z)/3) +(19+(x*x))]

Option b [((x*y)+z)/3) +(19*(x+x))]

Option c [((x/y)+z/3) +(19*(x*x))]

Option d [((x/y)+z)*3) +(19*(x+x))]

Answer Option a
Marks 1

Question Find the number of leaves in full binary tree with n vertices.
13

Option a 2n+3/2

Option b 2n+2/4

Option c n+2/2

Option d 3n+1/2

Answer Option b

Marks 1

Question State whether following statements are true or false respectively

14
1) A tree with n nodes has n/2 edges
2) Post order traversal techniques list the nodes of binary search tree in
ascending order.

Option a True , False

Option b False , False

Option c True , True

Option d False ,True

Answer Option b

Marks 2
Question What is the prefix code for weights 8,9,10
15

Option a {000,001,010}

Option b {000,011,11}

Option c {100,101,11}

Option d {010,000,100}

Answer Option a

Marks 1

Question What is ,maximum number of children that a binary tree node can have
16

Option a 0

Option b 1

Option c 2

Option d 3

Answer Option c

Marks 2

Question The following given tree is an example for

17
Option a Binary tree

Option b Binary search tree

Option c Fibonacci tree

Option d AVL tree

Answer Option a

Marks 1

Question A binary tree is a rooted tree but not an ordered tree

18

Option a True

Option b False

Answer Option b

Marks 1

Question How many common operation are performed in binary tree

19

Option a 2

Option b 3
Option c 4

Option d 1

Answer Option b

Marks 1

Question What is traversal strategy used in binary tree

20

Option a Depth-first traversal

Option b Bredth-first traversal

Option c Random traversal

Option d Priority traversal

Answer Option b

Marks 1

Question
21 Which of the following is true?

Option a Prim’s algorithm can also be used for disconnected graphs

Option b Kruskal’s algorithm can also run on the disconnected graphs

Option c Prim’s algorithm is simpler than kruskal’s algorithm

Option d In the kruskal’s sort edges are added to MST in decreasing order of their weights

Answer Option b

Marks 1

Question Find the preorder of the following binary tree.

22
Option a 3 5 4 2 7 10 9 11 8 6 1

Option b 1 2 3 4 5 6 7 8 9 10 11

Option c 3 2 5 4 1 7 6 9 10 8 11

Option d 1 3 5 2 4 1 7 6 9 10 8 11

Answer Option b

Marks 1

Question Consider complete graph G with 4 vertices. The graph G has_ _ _ _spanning trees.
23

Option a 15

Option b 8

Option c 16

Option d 13

Answer Option c

Marks 1

Question A complete undirected graph of n nodes can have maximum _ _ _

24 spanning trees.

Option a n^n+1
Option b n^n-2

Option c n(n+1)/2

Option d n

Answer Option b

Marks 1

Question What is minimum number of cuts that a graph with ‘n’ vertices can
25 have?

Option a n +1

Option b n(n-1)

Option c n(n+1)/2

Option d n(n-1)/2

Answer Option c

Marks 1

Question An undirected graph G which is connected and a cyclic is called.

26

Option a Biparatite graph

Option b Cyclic tree

Option c Tree

Option d Forest

Answer Option c
Marks 1

Question An n-vetex graph has_ _ _ _ edges

27

Option a n^2

Option b n-1

Option c n*n

Option d n*(n+1)/2

Answer Option b

Marks 1

Question In n-ary tree , each vertex has at most _ _ _ _ _children

28

Option a n

Option b n^4

Option c n*n

Option d n-1

Answer Option a

Marks 1

Question A vertex of degree greater than one is called _ _ _ _

29
Option a Leaf node

Option b Terminal node

Option c Internal node

Option d Forest

Answer Option c

Marks 1

Question Which of the following is false in the case of a spanning tree of a graph G?
30

Option a It is tree that spans G

Option b It is subgraph of the G

Option c It includes every vertex of the G

Option d It can be either cyclic or acyclic

Answer Option d

Marks 2