CS402 MID TERM SOLVED MCQs || PAST PAPERS || GROUP-1 || THEORY OF AUTOMATA || VuTech
Visit Website For More Solutions
www.vutechofficial.blogspot.com
CS402
Theory of Automata
Solved Mid Term Past Papers
______________________________
MCQs
______________________________
Group-1
Question No: 1
Let FA1 accepts many strings and FA2 accepts no string, then FA1+FA2 will be equal to
a) FA2-FA1
b) FA2
c) FA1
d) (FA2)*
Correct Answer:
The correct answer is 'c'.
CS 401 SOLVED MID TERM MCQs -----> Click Here
Question No: 2
Every NFA can be considered to be a ______ as well, but the converse may not be true.
a) PDA
b) FA
c) TG
d) GTG
Correct Answer:
The correct answer is 'b'.
Question No: 3
In order to make NFA for the union of FA1 and FA2, the new initial state should be linked to ______
a) final and initial states of FA1 and FA2 respectively
b) initial state of FA1 only
c) initial and final states of FA1 and FA2 respectively
d) initial states of both FAs
Correct Answer:
The correct answer is 'd'.
Visit Website For More Solutions
www.vutechofficial.blogspot.com
Question No: 4
| 0 |--›| 1 | 1 | 0 | 1 | 0 | 0 | 0 | --›| C | is a example of
a) the final state of FA1
b) the initial state of FA2
c) the initial state of FA1*FA1
d) the initial state of FA1
Correct Answer:
The correct answer is 'd'.
Question No: 5
Decomposing a string into its valid units is referred as
a) Splitting
b) Tokenizing
c) Decomposing
d) Dividing
Correct Answer:
The correct answer is 'b'.
Visit Website For More Solutions
www.vutechofficial.blogspot.com
Question No: 6
We cannot construct an NFA for the language of _______ defined over alphabet set {a,b}.
a) Palindromes
b) Even even
c) odd
d) Integers
Correct Answer:
The correct answer is 'd'.
Question No: 7
If we have an NFA having 3 states, and we convert that NFA to an FA. The resultant FA will contains _______ states.
a) 2
b) 5
c) 3
d) 4
Correct Answer:
The correct answer is 'c'.
Question No: 8
In concatenation, we include the initial state of FA2 automatically after the final state of FA1 because of
a) The strings of FA2 are accepted first before the strings of FA1
b) Some part of the string may be accepted by FA2
c) We need just two initial states
d) We need just one initial state
Correct Answer:
The correct answer is 'b'.
Visit Website For More Solutions
www.vutechofficial.blogspot.com
Question No: 9
Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
a) 2, 3 and 4
b) 1, 2 and 4
c) 1, 3 and 4
d) 1, 2 and 3
Correct Answer:
The correct answer is 'c'.
Question No: 10
In the context of make NFA for the concatenation of FA1 and FA2 (none accepting null string), which of the following option is correct?
a) No final state in FA2 only
b) No final and initial states in FA1 and FA2 respectively
c) No initial state in FA1 only
d) No initial and final states in FA1 and FA2 respectively
Correct Answer: