CS402 Solution by Files Preparation

MIDTERM FALL 2010

Dated 08-12-2010 (3st session)

CS402

Q1. (Marks: 1)

Auto Meta mean Manual work

Automatic work

Q2. (Marks: 1)

S= {a,bc,cc} has the latters

Q3. (Marks: 1)

S={a,bb,bab,baabb} set of strings then S* will not have Baba Baabbab Bbaaabb

bbbaabaabb(not confirmed)

Q4. (Marks: 1)

One language can represents more then one RE.

True

Falss Can’t be assumed Non of given

Q5. (Marks: 1)

Given GTG has RE

(a+b)* (aa+bb)(a+b)*

None of option

Q6. (Marks: 1)

b babab baaab

all

String

Q7. (Marks: 1)

bab a aba

a & aba

String

Q8. (a+b)* (1 marks)

Λ+(a+b)*a

Λ+(a+b)*a* TG has

Q9. TG can more then one initial state (1 marks)

True

False Depend on alphabets

Q10. (a+b)* (1 marks)

(a+b)*(a*+b*)

None of the given

Q11. The clouser FA*(on an FA ) always accept (1 marks)

_string Null aa bb

Q12. In FA final state represent by (1 marks)

sign

Q13. RE will be (1 marks)

In FA one enter in specific stat but there is no way to leave it then state is called Dead States Waste Baskets Davey John Lockers

All of above

Q14. Using tree structure final state represent by (1 marks)

double circle

Q15. a’s occur only in even clumps and that ends in three or more b’s (1 marks)

length larger then 2 it does not accept any language none of given option

Q16. Equal (1 marks)

Not equal Not valid These GTG are

Q17. to FA will (1 marks)

Equal

Not equal Not valid NFA