CS6503 THEORY OF COMPUTATION-Turing machine

A turing machine is a
1. real machine
2. abstract machine
3. hypothetical machine
4. more than one option is correct
A turing machine operates over:
1. finite memory tape
2. infinite memory tape
3. depends on the algorithm
4. none of the mentioned
Which of the functions are not performed by the turing machine after reading a symbol?
1. writes the symbol
2. moves the tape one cell left/right
3. proceeds with next instruction or halts
4. none of the mentioned
‘a’ in a-machine is :
1. Alan
2. arbitrary
3. automatic
4. None of the mentioned
Which of the problems were not answered when the turing machine was invented?
1. Does a machine exists that can determine whether any arbitrary machine on its tape is circular.
2. Does a machine exists that can determine whether any arbitrary machine on its tape is ever prints a symbol
3. Hilbert Entscheidungs problem
4. None of the mentioned
The ability for a system of instructions to simulate a Turing Machine is called
1. Turing Completeness
2. Simulation
3. Turing Halting
4. None of the mentioned
Turing machine can be represented using the following tools:
1. Transition graph
2. Transition table
3. Queue and Input tape
4. All of the mentioned
Which of the following is false for an abstract machine?
1. Turing machine
2. theoretical model of computer
3. assumes a discrete time paradigm
4. all of the mentioned
Fill in the blank with the most appropriate option.
In theory of computation, abstract machines are often used in ___________ regarding computability or to analyze the complexity of an algorithm.
1. thought experiments
2. principle
3. hypothesis
4. ll of the mentioned
State true or false:
Statement: RAM model allows random access to indexed memory locations.
1. true
2. false

CS6503 THEORY OF COMPUTATION-Turing machine

Quiz