CS402 Midterm Past Papers Mega File

CS402 Mid Term

Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.

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

Correct answer: Four (Page 4)

Languages generated by kleene star are always ______________.

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

Correct answer: Infinite (Page 7)

Let S = {aa, bb} be a set of strings then s* will have

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

Correct answer: Λ (Page 7)

CS402 Mid Term

If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be

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

Correct answer: (r1)* (Page 10)

If a language can be expressed through FA, then it can also be expressed through TG.

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

Correct answer: True (Page 25)

CS402 Mid Term

GTG can have _______________ final state.

1. 0
2. 1
3. More than 1

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. + (Page 27)
2. None of the given

Correct answer: + (Page 27)

“One language can be expressed by more than one NFA”. This statement is

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