CS402 Midterm Past Paper Fall 2010

MIDTERM FALL 2010

CS402

Q1. Auto Meta mean (1 marks)

• Manual work

• Automatic work

Q2. S= {a,bc,cc} has the latters (1 marks)

• 1
• 2
• 3
• 4

Q3. S={a,bb,bab,baabb} set of strings then S* will not have (1 marks)

• Baba
• Baabbab
• Bbaaabb

• bbbaabaabb(not confirmed)

Q4. One language can represents more then one RE. (1 marks)

• True
• Falss
• Can’t be assumed
• Non of given

Q5. Given GTG has RE (1 marks)

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

• None of option

Q6. • b (1 marks)

• babab
• baaab
• all

Q7. • bab (1 marks)

• a
• aba

• a & aba

Q8. TG has (1 marks)

• (a+b)*

• Λ+(a+b)*a

• Λ+(a+b)*a*

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

• True
• False
• Depend on alphabets

Q10. RE will be (1 marks)

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

• None of the given

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

• Null
• aa
• bb

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

Q13. In FA one enter in specific stat but there is no way to leave it then state is called (1 marks)

• 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. These GTG are ________ (1 marks)

• Equal

• Not equal
• Not valid

Q17. NFA to FA will_____________ (1 marks)

• Equal

• Not equal
• Not valid