Home / Engineering / Discrete Mathematics MCQs / Page 32

Discrete Mathematics MCQs | Page - 32

Dear candidates you will find MCQ questions of Discrete Mathematics here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.17K Points
Coach

Q. 311) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 312) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 313) Boolean expression except 0 expressed in an equivalent form is called _____.

(A) canonical
(B) sum
(C) product
(D) standard
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 314) _________relations are useful in solving certain minimization problems of switching theory.

(A) Void
(B) Universal
(C) Compatibility
(D) Equivalence
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 315) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 316) Every non-trivial tree has at least _____ vertices of degree one.

(A) 1
(B) 2
(C) 3
(D) 4
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 317) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 318) Every connected graph contains a ________.

(A) tree
(B) sub tree
(C) spanning tree
(D) spanning subtree
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 319) A minimal non-empty edge cut of G is called a _________.

(A) bond
(B) cycle
(C) path
(D) tour
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 320) A connected graph that has no cut vertices is called a ________.

(A) block
(B) bond
(C) cycle
(D) tour
View Answer Discuss Share