Paper Tayyari

Lecture 45: Turing machine

MCQs, short and long questions from lecture 45.Lecture 45 ki MCQs, short aur long sawal.

9 MCQs · 1 short question · 9 MCQs from past papers9 MCQs · 1 short sawal · 9 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/9
– correctsahi
1.
★ Final term Fall 2012

An FSM can be considered as TM

  1. AOf finite tape length, rewinding capability and unidirectional tape movement
  2. BOf finite tape length, without rewinding capability and bidirectional tape movement
  3. COf finite tape length, rewinding capability and bidirectional tape movement
  4. DOf finite tape length, without rewinding capability and unidirectional tape movement

An FSM reads its finite input once, left to right, without going back.

2.
★ Final term Fall 2012

The above machine (edges labelled (a,a,R), (b,b,R)) is a/an ________

  1. AFinite Automata
  2. BTuring machine
  3. CFA
  4. DTG

Edge labels of the form (read, write, move) belong to a Turing machine.

3.
★ Final term Spring 2010

Who did not invent the Turing machine?

  1. AAlan Turing
  2. BA. M. Turing
  3. CTuring
  4. DNone of these

Alan Turing, A. M. Turing and Turing are the same person, who invented it.

4.
★ Final term Spring 2010

Which statement is true?

  1. AThe tape of turing machine is infinite.
  2. BThe tape of turing machine is finite.
  3. CThe tape of turing machine is infinite when the language is regular
  4. DThe tape of turing machine is finite when the language is nonregular.

A Turing machine has a tape that is infinite in one direction.

5.
★ Final term Spring 2010

TM is more powerful than FSM because

  1. AThe tape movement is confined to one direction
  2. BIt has no finite state control
  3. CIt has the capability to remember arbitrary long sequences of input symbols
  4. DNone of these

The read-write tape gives a TM unlimited memory, which an FSM lacks.

6.
★ Final term Spring 2005

What Turing Machine does not have?

  1. AStack
  2. BTape
  3. CHead
  4. DWord

A Turing machine has a tape and a read-write head but no stack.

7.
★ Final term past paper

A program which is the set of rules which show that which state is to be entered when a letter is read form the :

  1. ATAPE
  2. BHALT
  3. CTM
  4. DNone of above

A TM program says which state to enter on reading a letter from the TAPE.

8.
★ Final term past paper

Can a turing machine's head ever be in the same location in two successive steps?

  1. AYes
  2. BYes but only in finite languages
  3. CNo
  4. DYes but only in infinite langauges

In this model the head moves one cell left or right on every step.

9.
★ Final term past paper

In ________ there are Finite set of states containing exactly one START state and some (may be none) HALT states that cause execution to terminate, when the HALT states are entered.

  1. ATG
  2. BTuring Machine
  3. CGTG
  4. DFinite Automata

START and HALT states are part of the definition of a Turing machine.