adplus-dvertising

Welcome to the Push Down Automata MCQs Page

Dive deep into the fascinating world of Push Down Automata with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Push Down Automata, a crucial aspect of Formal Languages and Automata Theory. In this section, you will encounter a diverse range of MCQs that cover various aspects of Push Down Automata, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Formal Languages and Automata Theory.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Push Down Automata. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Formal Languages and Automata Theory.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Push Down Automata. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Push Down Automata MCQs | Page 7 of 8

Explore more Topics under Formal Languages and Automata Theory

Q61.
a→b
Restriction: Length of b must be atleast as much length of a.

Which of the following is correct for the given assertion?

a.

Greibach Normal form

b.

Context Sensitive Language

c.

Chomsky Normal form

d.

Recursively Ennumerable language

Discuss
Answer: (b).Context Sensitive Language
Q62.
From the definition of context free grammars,
G=(V, T, P, S)

What is the solution of VÇT?

a.

Null

b.

Not Null

c.

Cannot be determined, depends on the language

d.

None of the mentioned

Discuss
Answer: (a).Null
Q63.
If P is the production, for the given statement, state true or false.
P: V->(V∑T)* represents that the left hand side production rule has no right or left context.

a.

true

b.

false

c.

may be

d.

can't say

Discuss
Answer: (a).true
Q64.
There exists a Context free grammar such that:
X->aX

Which among the following is correct with respect to the given assertion?

a.

Left Recursive Grammar

b.

Right Recursive Grammar

c.

Non Recursive Grammar

d.

None of the mentioned

Discuss
Answer: (b).Right Recursive Grammar
Q65.
If the partial derivation tree contains the root as the starting variable, the form is known as:

a.

Chomsky hierarchy

b.

Sentential form

c.

Root form

d.

None of the mentioned

Discuss
Answer: (b).Sentential form
Q66.
Find a regular expression for a grammar which generates a language which states :
L contains a set of strings starting wth an a and ending with a b, with something in the middle.

a.

a(a*Ub*)b

b.

a*(aUb)b*

c.

a(a*b*)b

d.

None of the mentioned

Discuss
Answer: (a).a(a*Ub*)b
Q67.
Which of the following is the correct representation of grammar for the given regular expression?
a(aUb)*b

a.

(1) S → aMb
(2) M → e
(3) M → aM
(4) M → bM

b.

(1) S → aMb
(2) M → Mab
(3) M → aM
(4) M → bM

c.

(1) S → aMb
(2) M → e
(3) M → aMb
(4) M → bMa

d.

None of the mentioned

Discuss
Answer: (a).(1) S → aMb
(2) M → e
(3) M → aM
(4) M → bM
Q68.
A CFG consist of the following elements:

a.

a set of terminal symbols

b.

a set of non terminal symbols

c.

a set of productions

d.

all of the mentioned

Discuss
Answer: (d).all of the mentioned
Q69.
A CFG for a program describing strings of letters with the word “main” somewhere in the string:

a.


-> m a i n
-> | epsilon
-> A | B | … | Z | a | b … | z

b.


–> m a i n
–>
–> A | B | … | Z | a | b … | z

c.


–> m a i n
–> | epsilon
–> A | B | … | Z | a | b … | z

d.

None of the mentioned

Discuss
Answer: (a).
-> m a i n
-> | epsilon
-> A | B | … | Z | a | b … | z
Q70.
CFGs are more powerful than:

a.

DFA

b.

NDFA

c.

Mealy Machine

d.

All of the mentioned

Discuss
Answer: (d).All of the mentioned
Page 7 of 8

Suggested Topics

Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...