MCQOPTIONS

Explore topic-wise MCQs in Discrete Mathematics.

This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.

1.	What is a bipartite graph?
A.	a graph which contains only one cycle
B.	a graph which consists of more than 3 number of vertices
C.	a graph which has odd number of vertices and even number of edges
D.	a graph which contains no cycles of odd length
Answer» E.

2.	A graph which consists of disjoint union of trees is called ______
A.	bipartite graph
B.	forest
C.	caterpillar tree
D.	labeled tree
Answer» C. caterpillar tree

3.	Two labeled trees are isomorphic if ____________
A.	graphs of the two trees are isomorphic
B.	the two trees have same label
C.	graphs of the two trees are isomorphic and the two trees have the same label
D.	graphs of the two trees are cyclic
Answer» D. graphs of the two trees are cyclic

4.	A linear graph consists of vertices arranged in a line.
A.	false
B.	true
C.	either true or false
D.	cannot determined
Answer» C. either true or false

5.	In an n-ary tree, each vertex has at most ______ children.
A.	n
B.	n4
C.	n*n
D.	n-1
Answer» B. n4

6.	The tree elements are called __________
A.	vertices
B.	nodes
C.	points
D.	edges
Answer» C. points

7.	A polytree is called _______________
A.	directed acyclic graph
B.	directed cyclic graph
C.	bipartite graph
D.	connected graph
Answer» B. directed cyclic graph

8.	What is a star tree?
A.	A tree having a single internal vertex and n-1 leaves
B.	A tree having n vertices arranged in a line
C.	A tree which has 0 or more connected subtrees
D.	A tree which contains n vertices and n-1 cycles
Answer» B. A tree having n vertices arranged in a line

9.	An n-vertex graph has ______ edges.
A.	n2
B.	n-1
C.	n*n
D.	n*(n+1)/2
Answer» C. n*n

10.	An undirected graph G which is connected and acyclic is called ____________
A.	bipartite graph
B.	cyclic graph
C.	tree
D.	forest
Answer» D. forest