CS402 Midterm Past Paper Spring 2007

MIDTERM EXAMINATION

SPRING 2007 CS402 - THEORY OF AUTOMATA (Session - 4 ) Marks: 35 Time: 90min

Student Name: Center Name/Code: Exam Date: Saturday, April 28, 2007

1. This examination is closed book, closed notes, closed neighbors.

Q2. Answer all questions.

1. There is no choice.
2. You will have to answer correctly all questions in this examination to get the maximum possible marks.

You are allowed to use only MS Word for drawing Diagrams and Symbols.

Question Question Marks Question Marks

Q1. Length of a null string is supposed to be 1. (1 marks)

True False

Q2. There is no difference between Word and String (1 marks)

True False

Q3. There may be two RE representing the same language. (1 marks)

True False

Q4. NFA – null can be considered as TG and vise versa. (1 marks)

True False

Q5. ∑ = {aA, b}, length(aAbaAaAb) = 5. (1 marks)

True False

Q6. If s=abcd is a string defined over ∑ = {a,b,c,d} then reverse of s is dcba. (1 marks)

True False

Q7. The language equal means number of a’s and b’s are equal with no null string. (1 marks)

True False

Q8. Palindrome is a regular language. (1 marks)

True False

Q9. If s = babab then palindrome of s = rev(s). (1 marks)

True False

Q10. TG must have only one start state. (1 marks)

True False

Q11. If a language can be accepted by FA then it can be accepted by a TG as well. (1 marks)

True False

Q12. Length of output string is 1 less then that of input string is mealy machine. (1 marks)

True False