Turing machine can be represented using:

Select one:
a. All of these
b. Instantaneous description
c. Transition table
d. Transition diagram

A universal Turing machine is a

Select one:
a. None of them
b. Single tape Turing machine
c. Reprogrammable Truing machine
d. Two-tape Turing machine

Which of the following is an extension to the basic model of Turing machine:

Select one:
a. Multi head Turing machine
b. Multi tape Turing machine
c. All of the above
d. Nondeterministic Turing machine

The language recognized by Turing machine is:

Select one:
a. Recursively enumerable language
b. Context sensitive language
c. Context free language
d. Regular language

A Turing machine has how many states?

Select one:
a. Finite
b. None of the mentioned
c. Infinite
d. May be finite

Universal Turing machine (UTM) influenced the concepts of

Select one:
a. Computability
b. Program and data is in same memory
c. All are correct
d. Interpretive implementation of programming language

Halting state of Turing machine are:

Select one:
a. Accept and reject
b. Start and stop
c. Start and reject
d. Reject and allow

Why Turing machine is more powerful than Finite automata?

Select one:
a. Turing machine head moment is in both directions
b. Turing machine has capability to remember arbitrary long sequence of input string.
c. Turing machine head movement is continued to one direction.
d. All are correct

An instantaneous description of Turing machine consists of:

Select one:
a. None of these
b. Present state and input to be processed
c. Present input only
d. Present state and entire input to be processed

Turing machine is more powerful than:

Select one:
a. Finite automata
b. Both Finite automata and Push down automata
c. None of these
d. Push down automata