Paper Tayyari

Lecture 37: A new format for FAs

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

10 MCQs · 10 MCQs from past papers10 MCQs · 10 MCQs past papers se

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

We can also represent an FA using different states e.g Accept state; Reject state, Read state etc. The ________ state behaves as final state of an FA

  1. AAccept
  2. BPop
  3. CPush
  4. DReject

In the new format of an FA, reaching ACCEPT means the input is accepted, like a final state.

2.
★ Final term Fall 2012

________ where the input string is placed before it is run, is called ________

  1. AData tape
  2. BInput Tape
  3. COutput Tape
  4. DMagnetic tape

The input string is written on the INPUT TAPE before the machine runs.

3.
★ Final term Fall 2012

A read state can have ________ outgoing edge/ edges.

  1. A1
  2. B2
  3. C3
  4. DAny number of

A READ state may branch on any number of letters, including blank.

4.
★ Final term past paper

Halt states are

  1. AStart and Accept
  2. BAccept and Reject
  3. CStart and Reject
  4. DRead and Reject

The machine stops at ACCEPT or REJECT, so these are the halt states.

5.
★ Final term past paper

The input string is placed, before it runs, in

  1. AStack
  2. BMemory
  3. CTape
  4. DRam

The input string is written on the input tape.

6.
★ Final term past paper

The locations into which we put the input letters on "Input Tape" are called ________

  1. Awords
  2. Balphabets
  3. Ccells
  4. Delements

The input tape is divided into cells, one letter per cell.

7.
★ Final term past paper

________ states are called the halt states.

  1. AACCEPT and REJECT
  2. BACCEPT and READ
  3. CACCEPT AND START
  4. DACCEPT AND WRITE

The machine stops at ACCEPT or REJECT.

8.
★ Final term past paper

The part of an FA, where the input string is placed before it is run, is called ________

  1. AState
  2. BTransition
  3. CInput Tape
  4. DOutput Tape

The input string is written on the input tape.

9.
★ Final term past paper

In new format of an FA (discussed in lecture 37), This state is like dead-end non final state

  1. AACCEPT
  2. BREJECT
  3. CSTART
  4. DREAD

REJECT halts without accepting, like a dead non-final state.

10.
★ Final term past paper

In new format of an FA This state is like dead-end non final state:

  1. AACCEPT
  2. BREJECT
  3. CSTART
  4. DREAD

REJECT works like a dead-end non-final state.