Theory of Computation (3160704) MCQs

MCQs of Turing Machine (TM)

Showing 1 to 10 out of 25 Questions
1 2 3
1.
Turing machine was invented by:
(a) Alan Turing
(b) Turing man
(c) Ginsburg
(d) None of these
Answer:

Option (a)

2.
Alan Turing introduced Turing machine late in
(a) 1936
(b) 1938
(c) 1940
(d) 1935
Answer:

Option (b)

3.
The language recognized by Turing machine is:
(a) Context free language
(b) Context sensitive language
(c) Recursively enumerable language
(d) Regular language
Answer:

Option (c)

4.
Turing machine consist of:
(a) Input tape
(b) Blank symbol
(c) Tape head
(d) All of these
Answer:

Option (d)

5.
Turing machine is more powerful than:
(a) Finite automata
(b) Push down automata
(c) Both (a) and (b)
(d) None of these
Answer:

Option (c)

6.
In definition of TM T=(Q,Σ,┌,q0,δ) what ┌ represents?
(a) Tape alphabets
(b) Input symbols
(c) Transition function
(d) Initial state
Answer:

Option (a)

7.
In one move the Turing machine:
(a) May change its state
(b) May write a symbol on the cell being scanned.
(c) May move the head one position left or right
(d) All of the above
Answer:

Option (d)

8.
Turing Machine can update symbols on its tape, whereas the FA cannot update symbols on tape.
(a) True
(b) False
(c) Can’t say
(d) May be
Answer:

Option (a)

9.
Turing machine can be represented using:
(a) Transition table
(b) Transition diagram
(c) Instantaneous description
(d) All of these
Answer:

Option (d)

10.
A Turing machine has how many states?
(a) Finite
(b) Infinite
(c) May be finite
(d) None of the mentioned
Answer:

Option (a)

Showing 1 to 10 out of 25 Questions
1 2 3