🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: Turing Machines: questions with answers

10 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. What can a Turing machine do that a pushdown automaton cannot?
  2. Q2. In the increment demo, what is 111 + 1?
  3. Q3. Which language did the second TM accept that no PDA can?
  4. Q4. Compared with deterministic TMs, nondeterministic TMs recognise:
  5. Q5. What does the Church–Turing thesis state?
  6. Q6. In δ(q, a) = (p, b, R), what does the machine do?
  7. Q7. Which of these is the key difference between a Turing machine's tape and a PDA's stack?
  8. Q8. A multi-tape Turing machine compared with a single-tape one is:
  9. Q9. What does a universal Turing machine take as input?
  10. Q10. A TM decides a language L when: