Compiler Design MCQ Questions And Answers - Finite Automata
This section focuses on "Finite Automata" in Compiler Design. These Multiple Choice Questions (MCQ) should be practiced to improve the Compiler Design skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.
1. In finite automata, Q stands for?
Explanation: The mathematical model of finite automata : Finite set of states (Q).
2. Final state is represented by?
Explanation: If the input string is successfully parsed, the automata is expected to be in this state. Final state is represented by double circles.
3. _________ of FA are represented by circles
Explanation: States : States of FA are represented by circles. State names are written inside circles.
4. How many arrow does intermediate states have?
Explanation: Intermediate states : All intermediate states have at least two arrows; one pointing to and another pointing out from them.
5. In Final state, The number of odd arrows are one greater than even, i.e. odd = even+1?
Explanation: It may have any odd number of arrows pointing to it and even number of arrows pointing out from it. The number of odd arrows are one greater than even, i.e. odd = even+1.
6. There are ________ tuples in finite state machine
Explanation: States, input symbols,initial state,accepting state and transition function
7. Number of states require to accept string ends with 10.
Explanation: This is minimal finite automata
8. Languages of a automata is
Explanation: If a string accepted by automata it is called language of automata.
9. Language of finite automata is
Explanation: According to Chomsky classification
10. The basic limitation of finite automata is that
Explanation: Because there is no memory associated with automata.