- Type
- Midterm past paper
- Course
- CS402 Theory of Automata
- Size
- PDF 965 KB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 2, 3, 4 of 48. Download the file for all 48 pages.
Q1. Vu-Topper RM (1 marks)
Σ={a,Aa,Abb}, then string aAaAbbAa has length. A. One B. Two C. Three
D. Four Page 4
Q2. Vu-Topper RM (1 marks)
Languages generated by kleene star are always A. Finite
B. Infinite Page 7
C. Sometimes finite & sometimes infinite D. None of the these
Q3. Vu-Topper RM (1 marks)
Let S = {aa, bb}, then S* will have the _______ string.
A. Λ Page 7
B. abba C. aabbbaa D. bbaab
Q4. Vu-Topper RM (1 marks)
If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be
A. (r1)(r2) B. (r1 + r2) C. (r2)*
D. (r1)* Page 10
Q5. Vu-Topper RM (1 marks)
If a language can be expressed through FA, then it can also be expressed through TG.
A. True Page 25
B. False
Q6. Vu-Topper RM (1 marks)
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 Page 6
Q7. Vu-Topper RM (1 marks)
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. + Page 27
C. * D. ( )
Q8. Vu-Topper RM (1 marks)
Above given FA accepts strings defined over Σ={a , b}
A. All Page 15
B. Some C. All but not null D. None of these
Q9. Vu-Topper RM (1 marks)
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 Page 14
Q10. Vu-Topper RM (1 marks)
Every FA should be
A. Deterministic Page 25
B. NonDeterministic C. Deterministic & NonDeterministic D. None of these
Q11. Vu-Topper RM (1 marks)
Auto Meta mean A. Manual work
B. Automatic work
C. Both D. None of these
Q12. Vu-Topper RM (1 marks)
NFA to FA will
A. Equal
B. Not equal C. Not valid D. None of given
Q13. Vu-Topper RM (1 marks)
The length of output string in case of is one more than the length of corresponding input string.
A. Finite Automaton
B. TG C. GTG D. NFA
Q14. Vu-Topper RM (1 marks)
The machine helps in building a machine that can perform the addition of binary numbers.
Related CS402 files
All CS402 files →- CS402 Midterm Solved Paper by Rajpoot Midterm PDF 3 MB
- CS402 Midterm Lecture-wise Preparation by MAS All Rounder Midterm PDF 3.3 MB
- CS402 Midterm MCQs by Talha Sajid Midterm PDF 1.4 MB
- CS402 Midterm Subjective by VU Topper RM Midterm PDF 546 KB
- CS402 Highlighted Handouts by VU Sparky Highlighted PDF 2.7 MB
- CS402 Solution by Files Preparation Quiz PDF 210 KB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.