CS402 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 )

My Todays cs402 paper

Mcqs:40

Q of 5 marks:4

Q of 3 marks:4

Q of 2 marks:4

Mcqs was mostly from the book and from and mostly was releated to RE And FA ANG TURING MACHINES.

Marks me ny ooper bata diye hain ap ko ab ye subjective Questions hain

1. Can we accept the string going from final to initial state?
2. state uses of PDA in computing?
3. if there is no initial state in FA then that FA does not accept any language Discuss two situations when an FA does not accept any string not even the null string?
4. describe pop operation?and draw symbol for pop state in contex of push down stack?
5. describe unit production in detail?
6. push and pop operation?
7. five conditions of PDA conversion?
8. prove kleens theorem part two?
9. diff between push down stack and push down store?

10. one was following IS FA or TM?

11. pref(q in r) wo jo book me hy aa and b wala wo hi tha?

12. calculate this tree