Scribd
Upload
65 views3 pages

Unit 2 MCQ

Uploaded by

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

Unit 2 MCQ

Uploaded by

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

Theory of Computation

Class- TY-BTech CSE Semester-I


Multiple Choice Questions
MCQ’s (Options in bold are the answers for respective MCQ)
UNIT-II
1. There are ________ tuples in finite state machine.
a) 4
b) 5
c) 6
d) unlimited
2. Transition function for DFA is
a) Σ * Q -> Σ
b) Q * Q -> Σ
c) Σ * Σ -> Q
d) Q * Σ -> Q
3. Number of states require to accept string ends with 10.
a) 3
b) 2
c) 1
d) can’t be represented.
4. Extended transition function is .
a) Q * Σ* -> Q
b) Q * Σ -> Q
c) Q* * Σ* -> Σ
d) Q * Σ -> Σ
5. δ*(q,ya) is equivalent to .
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
6. Languages of a automata is
a) If it is accepted by automata
b) If it halts
c) If automata touch final state in its life time
d) All language are language of automata
7. Language of finite automata is.
a) Type 0
b) Type 1
c) Type 2
d) Type 3
8. The basic limitation of finite automata is that
a) It can’t remember arbitrary large amount of information.
b) It sometimes recognize grammar that are not regular.
c) It sometimes fails to recognize regular grammar.
d) All of the mentioned
9. In finite automata, Q stands for?
a) Finite set of input symbols
b) Transition function
c) Finite set of states
d) One Start state
10. Final state is represented by?
a) Square
b) Circle
c) Double Circlue
d) Rhombus
11. An NFA’s transition function returns
a) A Boolean value
b) A state
c) A set of states
d) An edge
12. Conversion of a NFA to an DFA
a) Is impossible
b) Requires the subset construction
c) Is Chancy
d) Is nondeterministic
13. Find the wrong statement?
a) The language accepted by finite automata are the languages denoted by
regular expression
b) Every DFA has 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 these
14. The behaviour of a NFA can be stimulated by DFA
a) Always
b) Sometimes
c) Never
d) Depends on NFA
15. The reorganizing capability of NDFA and DFA
a) May be different
b) Must be different
c) Must be same
d) None of the above
16. Which of the following statement is true?
a) Every language that is defined by regular expression can also be defined
by finite automata
b) Every language defined by finite automata can also be defined by regular
expression
c) We can convert regular expressions into finite automata
d) All of the mentioned
17. A language is regular if and only if it is accepted by finite automata
a) The given statement statement is true
b) Given statement is false
c) Statement is partially true
d) None of the mentioned
18. We can represent one language in more one FSMs, true or false?
a) TRUE
b) FALSE
c) May be true
d) Cannot be said
19. The production of form non-terminal -> ε is called:
a) Sigma Production
b) Null Production
c) Gamma Production
d) All of the mentioned
20. Under which of the following operation, NFA is not closed?
a) Negation
b) Kleene
c) Concatenation
d) None of the mentioned
21. It is less complex to prove the closure properties over regular languages using
a) NFA
b) DFA
c) PDA
d) Can’t be said
22. Which of the following is an application of Finite Automaton?
a) Compiler Design
b) Grammar Parsers
c) Text Search
d) All of the mentioned
23. Can a DFA recognize a palindrome number?
a) Yes
b) No
c) Yes, with input alphabet as ∑*
d) Can’t be determined
24. Given a NFA with N states, the maximum number of states in an equivalent
minimized DFA is at least
a) N^2
b) 2^N
c) 2N
d) N!

You might also like