Top 350+ Solved Discrete Mathematics MCQ Questions Answer
Q. The total number of edges in a complete graph of n vertices is _________.
a. n
b. n/2
c. [n(n-a)]/3
d. [n(n-a)]/2
Q. A directed complete graph of n vertices contains __________.
a. one arrow between each pair of distinct vertices
b. two arrows between each pair of distinct vertices
c. n-1 arrows between each pair of distinct vertices
d. path between every two distinct vertices
Q. A directed graph G = (V, E) is said to be finite if its ________.
a. set V of vertices is finite
b. set V of vertices & set E of edges are finite
c. set E of edges are finite
d. no vertices & edges are repeated
Q. A state from which a deterministic finite state automata can never come out is called a____________.
a. trape state
b. starting symbol
c. transition table
d. transition diagram
Q. Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a relationon the set A = {3, 6, 9, 12}. The relation is _________
a. reflexive and transitive
b. reflexive and symmetric
c. symmetric and transitive
d. equivalence relation
Q. Let R={(1,b),(3,d),(2,b)} and S={(b,4),(2,5),(d,a)} be a relation then R compositionS=____.
a. {(1,b),(3,d),(2,b)}
b. {(1,4),(3,a),(2,4)}
c. {(4,b),(2,5),(3,a)}
d. {(1,d),(3,b),(2,c)}
Q. If R= {(x, 2x)} and S= {(x, 4x)} then R composition S=____.
a. {(x, 4x)}
b. {(x, 2x)}
c. {(x, 8x)}
d. {(x, 10x)}
Q. If R= {(x, 2x)} and S= {(x, 5x)} then R composition S=____.
a. {(x, 4x)}
b. {(x, 2x)}
c. {(x, 8x)}
d. {(x, 10x)}
Q. A regular grammar contains rules of the form _____.
a. A tends to AB
b. AB tends to a
c. A tends to aB
d. AB tends to CD
Q. A type-2 grammar contains the rules of the form is____.
a. a tends to AB
b. AaB tends to a
c. A tends to aBC
d. AB tends to CD
Q. Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A={1, 2, 3, 4}. Therelation R is ____.
a. transitive
b. reflexive
c. not symmetric
d. function
Q. The NAND statement is a combination of ______.
a. NOT and AND
b. NOT and OR
c. AND and OR
d. NOT or OR
Q. The NOR statement is a combination of ________.
a. NOT and AND
b. NOT and OR
c. AND and OR
d. NOT or OR
Q. If a relation is reflexive then in the graph of a relation there must be a loop at _____.
a. each node
b. only first node
c. any two nodes
d. only first and last nodes