Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
FLAT QUESTION PAPER
#1

(06-07-2012, 08:17 AM)computer girl Wrote: FLAT QUESTION PAPER

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
Reply
#2

FLAT QUESTION PAPER

[attachment=395]

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
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: flat question paper, flat booking system project documentation, er diagram for online flat booking, lat are sangbad, e r diagram online flat booking, er diagram for project flat booking system, flat finite automata 2012 question paper,

Forum Jump:


Users browsing this thread: 1 Guest(s)