Skip to content
VUBuddy

CS402 Midterm Solved MCQs with References by Moaaz

Theory of Automata PDF 3 MBUpdated 23 Oct 2026
Midterm past paper CS402 Midterm Solved MCQs with References by Moaaz PDF 3 MB
vubuddy.com
Type
Midterm past paper
Course
CS402 Theory of Automata
Size
PDF 3 MB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 3 MB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 39. Download the file for all 39 pages.

Solved MCQS From Midterm Papers · Dec 03,2012 · PSMD01 · Spring 2010

Q1. Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length. (1 marks)

  1. One
  2. Two
  3. Three
  4. Four (Page 4)

Correct answer: Four (Page 4)

Q2. (1 marks)

  1. Finite
  2. Infinite (Page 7)
  3. Sometimes finite & sometimes infinite
  4. None of the these

Correct answer: Infinite (Page 7)

Q3. Let S = {aa, bb} be a set of strings then s* will have (1 marks)

  1. Λ (Page 7)
  2. abba
  3. aabbbaa
  4. bbaab

Correct answer: Λ (Page 7)

Q4. If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by (1 marks)

  1. (r1)(r2)
  2. (r1 + r2)
  3. (r2)*
  4. (r1)* (Page 10)

Correct answer: (r1)* (Page 10)

Virtual Study Solutions

Q5. y (1 marks)

a, b x  a, b

Above given FA can be represented by

  1. ((a+ b) (a + b))* (Page 13)
  2. (a + b)(a + b)*
  3. (a + b)(a + b)
  4. (a + b)*(a + b)*

Correct answer: ((a+ b) (a + b))* (Page 13)

Q6. a,b (1 marks)

2+ 1 a,b

Above given FA accepts ___________ strings defined over Σ={a , b}

  1. All (Page 15)
  2. Some
  3. All but not null
  4. None of these

Correct answer: All (Page 15)

Q7. If a language can be expressed through FA, then it can also be expressed through TG. (1 marks)

  1. True (Page 25)
  2. False
  3. Depends on language
  4. None of the above

Correct answer: True (Page 25)

Q8. b (1 marks)

b 3+ a 1a

a a

a 4+ b 2- .b

b a b

  1. a+b+a(a + b)*a + b(a + b)*b
  2. a(a + b)*a + b(a + b)*b
  3. both are given
  4. none of the given

Correct answer: none of the given

Q9. b (1 marks)

b 3+ a 1a

a a

a 4+ b 2- .b

b a b

Above given FA accepts the language in which strings

  1. Begins with and ends in same letter
  2. Begins with and ends in different letter
  3. Has length more than 2
  4. None of the given

Correct answer: Begins with and ends in same letter

Q10. (1 marks)

  1. 0
  2. 1
  3. More than 1

Q11. 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 (1 marks)

  1. + (Page 27)
  2. None of the given

Correct answer: + (Page 27)

Q12. “One language can be expressed by more than one NFA”. This statement is ______________. (1 marks)

  1. False
  2. True (Page 41)
  3. Depends on NFA
  4. None of the given

Correct answer: True (Page 41)

All CS402 files →
CS402 Theory of Automata All CS402 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.