A universal Turing machine is a

Select one:
a. Single tape Turing machine
b. Two-tape Turing machine
c. None of them
d. Reprogrammable Truing machine
Compiler design is the example of which of the following

Select one:
a. Nondeterministic TM
b. None of these
c. Multitape TM
d. Universal TM
Which of the following are varients of Turing Machine

Select one:
a. Universal TM
b. Nondeterministic TM
c. Multitape TM
d. All of these
A Turing machine with several tapes in known as:

Select one:
a. Universal Turing machine
b. All of the mentioned
c. Multi-tape Turing machine
d. Poly-tape Turing machine
Universal Turing machine (UTM) influenced the concepts of

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

Select one:
a. Turing man
b. Alan Turing
c. Ginsburg
d. None of these
Why Turing machine is more powerful than Finite automata?

Select one:
a. All are correct
b. Turing machine head moment is in both directions
c. Turing machine has capability to remember arbitrary long sequence of input string.
d. Turing machine head movement is continued to one direction.
According to Chomsky hierarchy, which of the following is recognized by Recursively
Enumerable language?

Select one:
a. Type 0
b. Type 3
c. Type 1
d. Type 2
An instantaneous description of Turing machine consists of:

Select one:
a. Present state and entire input to be processed
b. None of these
c. Present input only
d. Present state and input to be processed
Which of the following conversion is not possible (algorithmically)?

Select one:
a. Non-deterministic pushdown automata to deterministic pushdown automata
b. Regular grammar to context-free grammar
c. Non deterministic Turing machine to deterministic Turing machine
d. Non-deterministic finite state automata to deterministic finite state automata