UTpaper

Free mock tests & test series

Question 73Asked in Bihar STET Paper 2 Computer Science (Class 11-12), 12 Sep 2023, Shift 2

A universal Turing machine is a

  1. ASingle tape Turing machine
  2. BTwo-tape Turing machine
  3. CReprogrammable Truing machine
  4. DAll of the above
Show answerHide answer

Correct answer: (C) Reprogrammable Truing machine

Explanation

A universal Turing machine takes the description of any other TM and its input and simulates it, so it is a reprogrammable (stored-program) Turing machine.

From Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2

This is question 73 of Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.