THEORY OF COMPUTATION

Previous year question paper with solutions for THEORY OF COMPUTATION

Our website provides solved previous year question paper for THEORY OF COMPUTATION . Doing preparation from the previous year question paper helps you to get good marks in exams. From our TOM question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

Question papers (year-wise) Very short questions
  1. List some applications of Theory of computation.

  2. What is a derivation tree and its yield?

  3. What is the ambiguity in a grammar?

  4. Write differences between NFA and DFA.

  5. Define regular expression.

  6. What is meant by halting problem?

  7. Acceptability of a string by FA.

  8. Give definition of CNF.

  9. How we can formally define a DFA?

  10. What do you mean by instantaneous description of a Turing machine?

Related Subjects
BEA DOT-NET DWHM ES EVS JAVA MM SPM OOAD STQA AI ED BI CD RS DM AJ
Tags