Theory of Computation (3160704) MCQs

MCQs of Pushdown Automata, CFL And NCFL

Showing 1 to 10 out of 30 Questions
1 2 3
1.
A push down automata is different than finite automata by:
(a) Its memory
(b) Number of states
(c) Both (a) and (b)
(d) None of these
Answer:

Option (a)

2.
Which automata takes stack as storage?
(a) Finite automata
(b) Push down automata
(c) Turing machine
(d) Regular expression
Answer:

Option (b)

3.
PDA is more powerful than
(a) Turing machine
(b) Multi tape Turing machine
(c) Finite automata
(d) All of these
Answer:

Option (c)

4.
Which of the following are the actions that operates on stack top?
(a) Pushing
(b) Updating
(c) Popping
(d) All of the mentioned
Answer:

Option (d)

5.
PDA consist of:
(a) State
(b) Unconsumed input
(c) Stack content
(d) All of the mentioned
Answer:

Option (d)

6.
In definition of PDA M=(Q, Σ,Γ, q0,Z0,A,δ) what Γ reperests?
(a) Initial stack symbol
(b) Stack alphabet
(c) Finite set of states
(d) Transition function
Answer:

Option (b)

7.
PDA is useful in:
(a) Lexical analysis
(b) Semantic analysis
(c) syntactic analysis
(d) All of these
Answer:

Option (c)

8.
A pushdown automata is _______if there is at most one transition to each configuration
(a) Nondeterministic
(b) Deterministic
(c) Non finite
(d) Finite
Answer:

Option (b)

9.
PDA always works on top element of stack
(a) True
(b) False
(c) May be
(d) Can’t say
Answer:

Option (a)

10.
A push down automata can represented using:
(a) Transition graph
(b) Transition table
(c) Instantaneous Description (ID) (q, a, X)
(d) All of the mentioned
Answer:

Option (d)

Showing 1 to 10 out of 30 Questions
1 2 3