Home / Engineering / Discrete Mathematics MCQs / Page 27

Discrete Mathematics MCQs | Page - 27

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. 261) (X+Y`)(X+Z) can be represented by            

(A) (x+y`z)
(B) (y+x`)
(C) xy`
(D) (x+z`)
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 262)                      is a disjunctive normal form.

(A) product-of-sums
(B) product-of-subtractions
(C) sum-of-products
(D) sum-of-subtractions
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 263) S -> aAB, AB -> bB, B -> b, A -> aB satisfies ___________ type of grammar

(A) 0
(B) 1
(C) 0,1
(D) 2
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 264) If there are more than 2 LMD for a string then it is said to be ___________.

(A) Ambigious
(B) unambigious
(C) language
(D) finite state automata
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 265) A finite non-empty set of symbols is called _________.

(A) alphabet
(B) letter
(C) string
(D) language
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 266) The specification of proper construction of a sentence is called ______.

(A) alphabet
(B) letter
(C) syntax
(D) word
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 267) Context free grammar is also known as _______ grammar.

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

M

Mr. Dubey • 51.17K Points
Coach

Q. 268) A class of machine which accepts a ________ language is called finite state automata.

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

M

Mr. Dubey • 51.17K Points
Coach

Q. 269) Accepting states are denoted by ________.

(A) circle
(B) an arrow mark
(C) double circle
(D) straight line
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 270) For converting NDFA to DFA we should __________ all the states which have no incoming.

(A) add
(B) subtract
(C) multiply
(D) delete
View Answer Discuss Share