Top 350+ Solved Discrete Mathematics MCQ Questions Answer
Q. Which of the following traversal techniques lists the nodes of binary search in ascendingorder?
a. pre order
b. post order
c. in order
d. root order
Q. The grammar G ={{S},{0,1},P,S}} where P={S tends to 0S1 , S tends to S1} is a ________.
a. recursively enumerable grammar.
b. regular grammar
c. context sensitive grammar
d. context free grammar
Q. Which of the following regular expressions identifiers are true?
a. (r*)* = r
b. (r+s)* = r* . s*
c. r*.s* = r* + s*
d. (r.s)* = r*/s*
Q. In a grammar or language LAMDA is used to denote _______.
a. empty word
b. entire set
c. set of words
d. set of letters
Q. If r is a regular expression then r* is a _______ expression.
a. regular
b. irregular
c. isomorphic
d. homomorphic
Q. An example for regular grammar is _____.
a. S tends to Ab
b. AB tends to SAB
c. S tends to aB
d. S tends to aBB
Q. If all the productions have single non-terminal in the left hand side then the grammardefined is ________grammar.
a. context free
b. context sensitive
c. regular
d. phrase structure
Q. In FSA ,the notation for M being in state S0, reading the input symbol a, moving one cellright and reaching the state S1 is given by ________.
a. f(Si , x) = Sj
b. f(S0 , a) = S1
c. f(Si , a) = Sj
d. f(S0 , x) = S1
Q. If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____.
a. regular grammar
b. phrase structure grammar
c. context free grammar
d. context sensitive grammar
Q. The rank of the incidence matrix of any connected graph G with n vertices is ______.
a. n
b. n+1
c. n-1
d. n-2