Top 350+ Solved Discrete Mathematics MCQ Questions Answer
Q. If a normal form contains all minterms, then it is ________.
a. a tautology
b. a contradiction
c. a contingency
d. both a and b
Q. PCNF is also called _______.
a. sum of product canonical form.
b. product of sum canonical form
c. sum canonical form
d. product canonical form
Q. PDNF is also called _____________
a. sum of product canonical form
b. product of sum canonical form
c. sum canonical form
d. product canonical form
Q. Max-terms of two statements are formed by introducing the connective _________.
a. disjunction
b. conjunction
c. negation
d. conditional
Q. The Subset relation on a set of sets is ________.
a. partial ordering
b. equivalence relation
c. reflexive and symmetric only
d. symmetric and transitive only
Q. A relation R is defined on the set of integers as xRy if and only if (x+y) is even. Which ofthe following statement is TRUE?
a. R is not an equivalence relation.
b. R is an equivalence relation having one equivalence classes
c. R is an equivalence relation having two equivalence classes
d. R is an equivalence relation having three equivalence classes
Q. If R = {(1, y), (1, z), (3, y)} then R power (-1)= ___________.
a. {(1, a), (y, z)}
b. {(y, 1), (z, 1), (y, 3)}
c. {(y, a), (1, z), (3, y)}
d. {(y, a), (z, a), (3, y)}
Q. Let R ={ (a,b),(c,d),(b,b)}, S = {(d,b),(c,b),(a,d)} then R composite S = ___________
a. {(a,e),(c,b),(b,e)}
b. {(d,b),(c,b),(a,d)}
c. {(a,b),(b,b)}
d. {(c,b)}
Q. Let R and S be two relations on a set of positive integers I. If R = {(a, 3a+a)},S = {(a,a+a)}then R composition R composition R = __________.
a. {(a,3a+a)}
b. {(a,9a+a)}
c. {(a,27a+a)}
d. {(a,9a+c)}
Q. The minimum number of edges in a connected graph with n vertices is ___________.
a. n
b. n-1
c. n+1
d. n+2
Q. A graph is planar if and only if it does not contain ________.
a. subgraphs homeomorphic to k3 & k3,3
b. subgraphs isomorphic to k5 or k3,3
c. subgraphs isomorphic to k3 & k3,3
d. sub graphs homeomorphic to k5 or k3,3
Q. Maximum number of edges in an n-node undirected graph without self loops is ____.
a. [n(n-a)]/2
b. n-1
c. n
d. [n(n+a)]/2
Q. Number of distinct nodes in any elementary path of length p is ________.
a. p
b. p-1
c. p+1
d. p*1