Scribd
Upload
4 views4 pages

Flat III B.Tech II Sem I Mid Objective Question Bank

This document is a question bank for a midterm exam on Formal Languages and Automata for Computer Science students at Sri Venkateswara Engineering College. It includes multiple-choice questions covering topics such as finite state machines, regular expressions, and properties of languages. Each question is followed by options and the correct answer indicated in parentheses.

Uploaded by

Kanini
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
4 views4 pages

Flat III B.Tech II Sem I Mid Objective Question Bank

This document is a question bank for a midterm exam on Formal Languages and Automata for Computer Science students at Sri Venkateswara Engineering College. It includes multiple-choice questions covering topics such as finite state machines, regular expressions, and properties of languages. Each question is followed by options and the correct answer indicated in parentheses.

Uploaded by

Kanini
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Sri Venkateswara Engineering College,Suryapet

Computer Science & Engineering Department


III B.Tech II Sem I Mid Formal Languages and Automata Languages.
Important Objecive Question Bank

1. The prefix of abc is _ _ _ _ _ _ _ _ _ _ _ _ (d)


a. c
b. b
c. bc
d.a
2. Which of the following is not a suffix of abc ? (c)
a. e
b. c
c. bc
d. ab
3. If L is the language then the number of possible strings of length 'n' is _ _ _ _ _ _ _ _ (d)
a. n
b. n * n
c. n n
d. 2n
4. The basic limitation of FSM is that _ _ _ _ _ _ _ _ (a)
a. it can't remember arbitrary large amount of information
b. it sometimes recognizes grammars that are not regular
c. it sometimes fails to recognize grammars that are regular
d. it can remember arbitrary large amount of information
5. Application of Finite automata is _ _ _ _ _ _ _ _ _ _ _ (a)
a. Lexical analyzer
b. parser
c. scanner
d. semantic analyzer
6. We formally denote a finite automaton by a _ _ _ _ _ _ _ _ tuple. (c)
a. 3
b. 4
c. 5
d. 6
7. Finite state machine _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ recognize palindromes (b)
a. can
b. can't
c. may
d. may not
8. Let a is any symbol, x is a palindrome then which of the following is not a
Palindrome. (d)
a. ε
b. a
c. axa
d. xa
9. Choose the wrong statement (d)
a. Moore and mealy machines are FSM's with output capability
b. Any given moore machine has an equivalent mealy machine
c. Any given mealy machine has an equivalent moore machine
d. Moore machine is not an FSM
10. The major difference between a mealy and a moore machine is that (b)
a. The output of the former depends on the present state and present input
b. The output of the former depends only on the present state.
c. The output of the former depends only on the present input
11. Let r and s are regular expressions denoting the languages R and S.
Then (r + s) denotes _ _ _ _ _ _ _ _ _ _ _ (c)
a. RS
b. R*
c. RUS
d. R+
12. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ denotes all strings of 0,s and 1,s. (d)
a. ( 0+1)
b. 01
c. 0* 1
d. ( 0+ 1)*
13. Let maximum number of states in a DFA =128 .
Then its equivalent NFA has _ _ _ _ _ _ states. (b)
a. 5
b. 7
c. 8
d. 9
14. Let r, s, t are regular expressions. (r* s *) * = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (c)
a. ( r-s)*
b. (r s)*
c. ( r +s)*
d. (s-r)*
15. 'The regular sets are closed under kleene closure' is _ _ _ _ _ _ _ _ _ _ (a)
a. True
b. False
c. True or False
d. can't say
16. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ denotes all strings of 0,s and 1,s. (d)
a. ( 0+1)
b. 01
c. 0* 1
d. ( 0+ 1)*
17. The number of states of the FSM required to simulate the behaviour of a computer with a
memory capable of storing m words each of length n bits is _ _ _ _ _ (c)
a. m
b. 2m+n
c. 2mn
d. 2m
18 Any given transition graphs has an equivalent _ _ _ _ _ _ _ _ _ _ _ _ _ _ (d)
a. RE
b. DFA
c. NFA
d. DFA, NFA, RE
19. Let r and s are regular expressions denoting the languages R and S.
Then (r s) denotes _ _ _ _ _ _ _ _ _ _ _ _ (a)
a. RS
b. R*
c. RUS
d. R+
20. Let r, s, t are regular expressions. r + s = _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (b)
a. r s
b. s + r
c. s r
d. r / s
21. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ is a set of strings . (a)
a. Language
b. grammar
c. NFA
d. DFA
22. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ is a set of strings . (a)
a. Language
b. grammar
c. NFA
d. DFA
23. NFA stands for _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (a)
a. Non deterministic finite automaton
b. Non deterministic finite analysis
c. Non deterministic finite acceptance
d. Non deterministic finite authorization
24. We formally denote a finite automaton by Where F is _ _ _ (d)
a. a finite set of states
b. finite input alphabet
c. initial state
d. A set of final states
215. The word formal in formal languages means _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (c)
a. the symbols used have well defined meaning
b. they are unnecessary in reality
c. only the form of the string of symbols is significant
d. only the form of the string of symbols is not significant
26. Let NFA has a finite number 6 of states ,the DFA will have at most _ _ _ _ _ _ _ _ states. (d)
a. 12
b. 2
c. 36
d. 64
27. (0+1) * 011 denote all strings of 0's and 1's ending in _ _ _ _ _ _ _ _ _ _ _ (c)
a. 0
b. 0111
c. 011
d. 111
28. We formally denote a finite automaton Where Q is _ _ _ (a)
a. a finite set of states
b. finite input alphabet
c. initial state
d. A set of final states
29. In transition diagrams states are represented by _ _ _ _ _ _ _ _ _ _ _ _ (b)
a. ellipses
b. circles
c. triangles
d. rectangles
30. A melay machine is a _ _ _ _ _ _ _ _ _ _ tuple. (d)
a. 0
b. 0111
c. 011
d. 111

You might also like