Home > Computer Engineering > Quizzes > Theory of Computer Science: Pushdown Automata(PDA)
Theory of Computer Science: Pushdown Automata(PDA)
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 100% • Most missed: “A push down automaton with only symbol allowed on the stack along with fixed sym…”
Theory of Computer Science: Pushdown Automata(PDA)
Time left 00:00
25 Questions

1. Push down automata accepts _________ languages.
2. With reference of a DPDA, which among the following do we perform from the start state with an empty stack?
3. Which among the following is not a part of the Context free grammar tuple?
4. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d)
What does the symbol z0 represents?
5. NPDA stands for
6. Which of the following relates to Chomsky hierarchy?
7. Which of the following is an incorrect regular expression identity?
8. Which of the following allows stacked values to be sub-stacks rather than just finite symbols?
9. The following move of a PDA is on the basis of:
10. A DPDA is a PDA in which:
11. A push down automaton with only symbol allowed on the stack along with fixed symbol.
12. A string is accepted by a PDA when
13. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.
14. Which of the following automata takes stack as auxiliary storage?
15. Statement: Counter Automaton can exist for the language L={0i1i|i>=0}
16. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called
17. Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.
18. For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________
19. If the PDA does not stop on an accepting state and the stack is not empty, the string is:
20. The closure property of context free grammar includes :
21. Which of the following is a simulator for non deterministic automata?
22. The transition a Push down automaton makes is additionally dependent upon the:
23. Which of the following strings do not belong the given regular expression? a)*(a+cba)
24. Which of the following can be accepted by a DPDA?
25. Let ∑={0,1}* and the grammar G be: S->ε
S->SS
S->0S1|1S0
State which of the following is true for the given

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computational Thinking Concepts Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS Computer Fundamentals Practice Test: Generations of Computers
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.