Search Header Logo

TAFL Unit 4 Quiz: Push Down Automata

Authored by aradhna saini

Engineering

University

Used 1+ times

TAFL Unit 4 Quiz: Push Down Automata
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A push down automata is different than finite automata by:

Its memory

Number of states

Both (a) and (b)

None of these

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which automata takes stack as storage?

Finite automata

Push down automata

Turing machine

Regular expression

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

PDA is more powerful than

Turing machine

Multi tape Turing machine

Finite automata

All of these

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following are the actions that operates on stack top?

Pushing

Updating

Popping

All of the mentioned

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

PDA consist of:

State

Unconsumed input

Stack content

All of the mentioned

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In definition of PDA what represents?

Initial stack symbol

Stack alphabet

Finite set of states

Transition function

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

PDA is useful in:

Lexical analysis

Semantic analysis

syntactic analysis

All of these

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?