Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q421: In prefix notation, what is the first step of evaluating +3*4 5?
- A: 3+4
- B: 4*5
- C: +3 4
- D: 3*(4+5)
View Answer
B
Q422: What type of notation is used for the expression *+3 4 5?
- A: Infix notation
- B: Postfix notation
- C: Prefix notation
- D: Reverse Polish notation
View Answer
C
Q423: The expression ((3+4)*5) results in which value?
- A: 20
- B: 23
- C: 35
- D: 12
View Answer
C
Q424: What is the result of evaluating the prefix expression *+1 2 +3 4?
- A: 35
- B: 21
- C: 45
- D: 50
View Answer
B
Q425: What type of grammar allows multiple production trees for the same word?
- A: Regular Grammar
- B: Ambiguous Grammar
- C: Unambiguous Grammar
- D: Finite Grammar
View Answer
B
Q426: What type of grammar generates only one unique production tree per word?
- A: Ambiguous Grammar
- B: Regular Grammar
- C: Unambiguous Grammar
- D: Context-Free Grammar
View Answer
C
Q427: In a total language tree, the root of the tree is the ________.
- A: Nonterminal symbol
- B: Start symbol
- C: Production rule
- D: Terminal symbol
View Answer
B
Q428: What does a total language tree represent?
- A: All possible productions
- B: All possible languages
- C: All working strings
- D: All terminals and nonterminals
View Answer
C
Q429: What is a semiword in the context of CFGs?
- A: A string of terminals
- B: A string of nonterminals
- C: A mix of terminals and one nonterminal
- D: A string with only terminals
View Answer
C
Q430: Which form of CFG productions is used to generate regular languages?
- A: Nonterminal → semiword
- B: Nonterminal → word
- C: Both forms
- D: None
View Answer
C