07-06-2012, 01:47 PM
FLAT QUESTION PAPER
FLAT QUESTION PAPER.pdf (Size: 55.39 KB / Downloads: 3)
1. ___________ is a set of strings
a) Symbol b) Alphabet c) Language d) Grammar
2. ___________ is a finite sequence of symbols
a) String b) Alphabet c) Language d) Grammar
3. Which of the following is not a proper prefix of “FLAT”
a) F b) FL c) FLA d) FLAT
4. Which of the following is not a proper suffix of “FLAT”
a) T b) AT c) LAT d) FLAT
5. Application of Finite Automata is
a) Lexical Analyzer b) Syntax Analyzer c) Semantic Analyzer d) Code Generator
6. The formal notation of Finite Automata contains __________ tuples
a) 4 b) 5 c) 6 d) 6
7. An automaton is a __________ device
a) generative b) cognitive c) acceptor d) rejector
8. A grammar is a __________ device
a) generative b) cognitive c) acceptor d) rejector
9. “An FSM can be used to add two given integers”. The statement is ___________
a) True b) False c) can’t say d) no enough information
10. Any given transition graph has an equivalent _______________
a) RE b) DFA c) NFA d) DFA, NFA, RE
11. Finite state machines ______________ recognize palindromes
a) can b) can’t c) may d) may not
12. FSM can recognize _________ grammar
a) any b) only CFG c) any unambiguous d) only regular
13. In transition diagrams, states are represented by __________
a) ellipses b) circles c) pointed lines d) rectangles
14. In the method of minimizing the number of states of DFA M, output is a DFA which accepts the
__________ language and with ___________ state(s)
a) same, one b) same, more c) same, few d) different, more
