Paper Tayyari

Lecture 38: Nondeterministic PDA

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

5 MCQs · 5 MCQs from past papers5 MCQs · 5 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/5
– correctsahi
1.
★ Final term Spring 2010

Like TG, a PDA can also be non-deterministic

  1. ATrue
  2. BFalse

A PDA may have several edges with the same label from a READ or POP state.

2.
★ Final term past paper

A PDA is called nondeterministic PDA if ________

  1. AThere are more than one outgoing edges at READ or POP states with one label
  2. BThere are more than one PUSH states
  3. CThere are more than one POP states
  4. DAll of the given options

Nondeterminism means a choice of edges with the same label at a READ or POP state.

3.
★ Final term past paper

The PDA is called non-deterministic PDA when there are more than one out going edges from ________ state

  1. ASTART or READ
  2. BPOP or REJECT
  3. CREAD or POP
  4. DPUSH or POP

Branching on the same label happens only at READ or POP states.

4.
★ Final term past paper

Identify the TRUE statement:

  1. AA PDA is non-deterministic, if there are more than one READ states in PDA
  2. BA PDA is never non-deterministic
  3. CLike TG, A PDA can also be non-deterministic
  4. DA PDA is non-deterministic, if there are more than one REJECT states in PDA

A PDA may be nondeterministic, just like a TG.

5.
★ Final term past paper

In nondeterministic PDA a string is supposed to be accepted, if there exists at least one path traced by the string, leading to ________ state.

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

A nondeterministic PDA accepts if some path reaches ACCEPT.