CS402 Latest Final Term Paper

CS402 Latest Final Term Paper

 Mcqs:40

Q of 5 marks: 4

Q of 3 marks: 4

Q of 2 marks: 4

MCQ,s was mostly from the book and from and mostly was related to RE And FA ANG TURING MACHINES.

Question1.

     Can we accept the string going from final to initial state? state uses of PDA in computing?

Question2.

       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?

Question3.

        Describe pop operation? and draw symbol for pop state in contex of push down stack?

Question4.

       Describe unit production in detail?

Question5.

    Push and pop operation ?

Question6.

      Five conditions of PDA conversion ?

Question7.

     prove kleens theorem part two?

Question8.

      Difference between push down stack and push down store ?

Question9.

     One was following IS FA or TM?

Question10.

     Pref(q in r) wo jo book me hy aa and b wala wo hi tha? calculate this tree.