Scribd
Upload
98 views3 pages

DMS MSE Question Bank - 21-22

1. The document contains a 25 question multiple choice quiz on topics related to graphs and trees including spanning trees, binary trees, and logical connectives. 2. Questions cover topics such as the definitions of trees, leaf nodes, centers of graphs, cut vertices, rooted trees, tree height, sibling relationships, regular and full binary trees, optimal trees, descendants, the number of nodes in regular m-ary trees, branch nodes, spanning trees, chords, minimum spanning trees, and logical statements. 3. The questions test knowledge of key graph and tree terminology and concepts as well as logical connectives like implication, conjunction, and disjunction.

Uploaded by

Rohan Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
98 views3 pages

DMS MSE Question Bank - 21-22

1. The document contains a 25 question multiple choice quiz on topics related to graphs and trees including spanning trees, binary trees, and logical connectives. 2. Questions cover topics such as the definitions of trees, leaf nodes, centers of graphs, cut vertices, rooted trees, tree height, sibling relationships, regular and full binary trees, optimal trees, descendants, the number of nodes in regular m-ary trees, branch nodes, spanning trees, chords, minimum spanning trees, and logical statements. 3. The questions test knowledge of key graph and tree terminology and concepts as well as logical connectives like implication, conjunction, and disjunction.

Uploaded by

Rohan Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Karmayogi Engineering College, Shelve-Pandharpur

Computer Science and Engineering Dept.

MCQ Question Bank (MSE) 21-22


Class: SY-CSE-I Sub: DMS

1. A single connected graph without any circuits is called


a) Tree b) terminal c) forest d) None

2. Vertex of degree one in a tree is called


a) Leaf Node b) Terminal Node c) Internal Node d) Both a &b

3. A vertex with minimum is called centre of graph


a) Eccentricity b) Length c) Path d)None

4. In a tree all the vertices except vertices are cut vertices.


a) Pendant b) Branch node c) Terminal d) Both a & c

5. In directed rooted tree there is exactly vertex with incoming degree zero
a) One b) Two c) Zero d)None

6. The of tree is maximum of the levels of its vertices.


a) Depth b) Height c) Level d) None

7. Two vertices are said to be ,if they are the sons of same vertex.
a) Descendant b) Ancestor c) Brothers d) None

8. A m-ary tree is said to be m- ary tree, if every branch node has exactly m sons.
a) Regular b) Full c) Both a & b d) None
9. In binary tree every internal node has two sons
a) Atmost b) Exactly c) Both a & b d)None

10. In full binary tree every internal node has two sons
a) Atmost b) Exactly c) Both a & b d)None

11. The full binary tree is called optimal tree if its weight is
a) Minimum a) Maximum c) Medium d) None

12. In a tree if Y is below X and there is path from X to Y then Y is called of X


a) Descendant b) Ancestor c) Both d) None

13. A regular m-ary tree with I internal nodes has nodes at all.
a) m + I b) mi + 1 c) 2(mi + 1) d) None

14. In rooted tree whose outgoing degree is non zero is calld


a) Branch Node b) Internal Node c) Both a & b d) None

15. Spanning tree of a connected graph contains all the vertices of that graph.
a) True b) false

16. A connected graph can not have more than one spanning tree
a) True b) False

17. The edges of connected graph which are not present in spanning tree are called
a) Chords b) Branches c) Paths d) None
18. Spanning tree of weighted connected graph is called , if its weight is minimum.
a) Spanning tree b) Maximum spanning tree c) Minimum spanning tree d) none

19. In fundamental cut set , we can remove exactly from spanning tree
a) one branch b) Two branches c) Three branches d) None

20. A sentence which is either true or false is called


a) Preposition b) Conjunction d) Connective d) None

21._______ is a declarative sentence which is either true or false


a) Preposition
b) Statement
c) Both a and b
d) None
22. 2+3=5 It is preposition
a) True
b) False
23. The sentences which can not be further devided or split into simpler sentences are called
a) Atomic
b)Primitive
c)Primary
d) Above All
24. In disjunction when at least one possibility exists or even both possibilities exists then it is
_________ sense
a) Exclusive
b) Inclusive
c) Both a and b
d) None
25. If p and q are statements then, if p then q is denoted by
a) p v q
b) p ʌ q
c) p→ q
d) p↔q

You might also like