Theoretical Computer Science MCQ : Finite Automata - DFA, NFA, NFA to DFA : Link1
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Finite Automata - DFA, NFA, NFA to DFA? We have arranged the Show Answer button under the each question. Candidates can click on it to know the right option among the given alternatives. Furthermore, the applicants can check our web portal @ www.totalmcq.com to take part in more MCQ on various subject. Wish, the given information about the Theoretical Computer Science MCQ will helpful to the advance and can learn the various types of questions and answers.
Q.1. There are-------tuples in finite state machine.
A. 5
B. 6
C. 7 D. 4
Q.2. What is the Transition function of DFA?
A. Σ * Q -> Σ
B. Q * Q -> Σ
C. Σ * Σ -> Q D. Q * Σ -> Q
Q.3. How many numbers of states require to accept string ends with "01" in DFA?
A. 2
B. 3
C. 4 D. 5
Q.4. Language of finite automata is--------
A. Type 0
B. Type 1
C. Type 2 D. Type 3
Q.5. What kind of abstract machine can recognize strings in a regular set?
A. DFA
B. NFA
C. PDA
D. None of the above
Q.6. ------method is known as subset construction method.
A. NFA to DFA
B. DFA
C. DFA maximization
D. None of the above
Q.7. Which of the following is an application of Finite Automaton?
A. Compiler Design
B. Grammar Parsers
C. Text Search
D. All of the above
Q.8. Predict the number of transitions required to automate the following language using only 3 states:
L= {w | w ends with 11}
A. 1
B. 2
C. 3
D. 4
Q.9. Can a DFA simulate NFA?
A. NO
B. YES
C. SOMETIMES
D. Depends on NFA
Q.10. Which of the following statements is wrong ?
A. The language accepted by finite automata are the languages denoted by regular expressions
B. For every DFA there is a regular expression denoting its language
C. For a regular expression r, there does not exist NFA with L(r) any transit that accept
D. None of the above.
Q.11. Regular expression a / b denotes the set -----
A. {a}
B. { ∈ , a, b }
C. {a, b} D. { ab }
Q.12. Which of the following regular expressions denotes {1,11,111,1111,.....}?
A. 1*
B. 1+
C.(11)*
D. None of the above.
Q.13. Finite state machines---------recognize palindromes
A. can
B. can't
C. may
D. may not
Q.14. Consider regular expression (0 + 1) (0 + 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains-------
A. n states
B. n + 1 states
C. n + 2 states
D. None of the above
Q.15. Any given transition graph has an equivalent------
A. regular expression
B. DFSM
C. NDFSM D. All of the above.