Description

This mock test of Test: PDA-Acceptance By Empty Stack for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam.
This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Test: PDA-Acceptance By Empty Stack (mcq) to study with solutions a complete question bank.
The solved questions answers in this Test: PDA-Acceptance By Empty Stack quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE)
students definitely take this Test: PDA-Acceptance By Empty Stack exercise for a better result in the exam. You can find other Test: PDA-Acceptance By Empty Stack extra questions,
long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.

QUESTION: 1

If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called

Solution:

Two sets are called disjoint if they have no elements in common i.e. RÇT=Æ.

QUESTION: 2

Which among the following is not a part of the Context free grammar tuple?

Solution:

The tuple definition of context free grammar is: (V, T, P, S) where V=set of variables, T=set of terminals, P=production, S= Starting Variable.

QUESTION: 3

A context free grammar is a ___________

Solution:

Context free grammar is the set which belongs to the set of context free grammar. Similarly, Regular grammar is a set which belongs to the the set of Context free grammar.

QUESTION: 4

The closure property of context free grammar includes :

Solution:

Context free grammars are closed under kleene operation, union and concatenation too.

QUESTION: 5

Which of the following automata takes stack as auxiliary storage?

Solution:

Pushdown Automaton uses stack as an auxiliary storage for its operations. Turing machines use Queue for the same.

QUESTION: 6

Which of the following automata takes queue as an auxiliary storage?

Solution:

Pushdown Automaton uses stack as an auxiliary storage for its operations. Turing machines use Queue for the same.

QUESTION: 7

A context free grammar can be recognized by

Solution:

A linearly bounded automata is a restricted non deterministic turing machine which is capable of accepting ant context free grammar.

QUESTION: 8

A null production can be referred to as:

Solution:

Null production is always taken as a string in computational theory.

QUESTION: 9

The context free grammar which generates a Regular Language is termed as:

Solution:

Regular grammar is a subset of Context free grammar. The CFGs which produces a language for which a finite automaton can be created is called Regular grammar.

QUESTION: 10

NPDA stands for

Solution:

NPDA stands for non-deterministic push down automata whereas DPDA stands for deterministic push down automata.

### Stack & Subroutine

Doc | 16 Pages

### 07 - Empty Set

Video | 01:25 min

### 07 - Empty Set

Video | 01:25 min

### Solution: Empty Sets

Doc | 1 Page

- Test: PDA-Acceptance By Empty Stack
Test | 10 questions | 10 min

- Test: Interrupt And Stack Of 8051
Test | 10 questions | 10 min

- Test: Integration By Substitution
Test | 5 questions | 10 min

- Arrays, Stack, Queues & Linked List - 2
Test | 15 questions | 45 min

- Arrays, Stack, Queues & Linked List - 3
Test | 20 questions | 60 min