Top 350+ Solved Discrete Mathematics MCQ Questions Answer
Q. The number of 1's in each row of an incidence matrix of a graph G is equal to _____.
a. the degree of the corresponding vertices
b. the sum of degrees of all vertices
c. the degree of the initial vertex
d. the degree of the terminal vertex
Q. Each column of an incidence matrix of a graph G has exactly _______.
a. one 1's
b. two 1's
c. one 2's
d. two 2's
Q. An undirected graph is tripartite if and only if it has no circuits of _______ lengths
a. odd
b. even
c. distinct
d. equal
Q. G is strongly connected implies _________.
a. G is unilaterally connected.
b. G is bilaterally connected
c. G is unilaterally connected
d. G has more than one component
Q. The number of pendant vertices in a full binary tree with n vertices is ________.
a. (n-a)/2
b. (n-1)/2
c. (n+a)/2
d. n/2
Q. Boolean expression except 0 expressed in an equivalent form is called _____.
a. canonical
b. sum
c. product
d. standard
Q. _________relations are useful in solving certain minimization problems of switchingtheory.
a. Void
b. Universal
c. Compatibility
d. Equivalence
Q. The number of elements in a square matrix of order n is _____.
a. n power 3
b. n power 4
c. n power 5
d. n power 2
Q. A ____ is an edge e such that w(G-e)>w(G).
a. cut vertex of G
b. cut edge of G
c. ends of G
d. path of G
Q. Every connected graph contains a ________.
a. tree
b. sub tree
c. spanning tree
d. spanning subtree
Q. A connected graph that has no cut vertices is called a ________.
a. block
b. bond
c. cycle
d. tour