CS201 MID TERM SOLVED MCQs || PAST PAPERS || GROUP-1 || INTRODUCTION TO PROGRAMMING || VuTech Visit Website For More Solutions www.vutechofficial.blogspot.com …
CS402 MID TERM SOLVED MCQs || PAST PAPERS || GROUP-2 || THEORY OF AUTOMATA
|| VuTech
Visit Website For More Solutions www.vutechofficial.blogspot.com
CS402
Theory of Automata
Solved Mid Term Past Papers
______________________________
MCQs
______________________________
Group-2
Question No: 1
Σ={a,Aa,Abb}, then string aAaAbbAa has _____ length.
a) One
b) Two
c) Three
d) Four
Correct Answer:
The correct answer is 'd'.
Question No: 2
Languages generated by kleene star are always _______ .
a) Finite
b) Infinite
c) Sometimes finite & sometimes infinite
d) None of the these
Correct Answer:
The correct answer is 'b'.
Question No: 3
Let S = {aa, bb}, then S* will have the ______ string.
a) Λ
b) abba
c) aabbbaa
d) bbaab
Correct Answer:
The correct answer is 'a'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
Question No: 4
If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be
generated by
a) (r1)(r2)
b) (r1 + r2)
c) (r2)*
d) (r1)*
Correct Answer:
The correct answer is 'd'.
Question No: 5
If a language can be expressed through FA, then it can also be expressed
through TG.
a) True
b) False
Correct Answer:
The correct answer is 'a'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
Question No: 6
If an alphabet has n number of letter, then number of strings of length m
will be
a) n+m
b) (n)(m)
c) m^n
d) n^m
Correct Answer:
The correct answer is 'd'.
Question No: 7
In GTG, if a state has more than one incoming transitions from a state.
Then all those incoming transitions can be reduced to one transition using
sign
a) -
b) +
c) *
d) ( )
Correct Answer:
The correct answer is 'b'.
Question No: 8
Above given FA accepts ______ strings defined over Σ={a , b}
a) All
b) Some
c) All but not null
d) None of these
Correct Answer:
The correct answer is 'a'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
Question No: 9
One FA has 3 states and 2 letters in the alphabet. Then FA will have
_____ number of transitions in the diagram.
a) 4
b) 5
c) 7
d) 6
Correct Answer:
The correct answer is 'd'.
Question No: 10
Every FA should be
a) Deterministic
b) Non- Deterministic
c) Deterministic & Non- Deterministic
d) None of these
Correct Answer:
The correct answer is 'a'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
We provide Virtual University of Pakistan Study Materials such as Solution of Assignments, GDBs, Mid Term Solved Papers, Final Term Solved Papers, Mid Term Solved MCQs, and Final Term Solved MCQs. We also provide regular Semester Quizzes, Updated Handouts, and Short Questions and Answers. We help you with your research and many other educational-related topics, as far as we know. Furthermore, Share your problem with us and Please feel free to ask any related questions.