MUMBAI UNIVERSITY STUDENTS ASSOCIATION (MUSA)
QUESTION BANK OF ENGINEERING TCS
T.E SEM-V BRANCH: COMPS FOR WINTER SESSION – NOVEMBER 2024
Q.1) Explain application for FA, PDA and TM.
Q.2) Explain variants of Turning machine.
Q.3) State and Explain pumping lemma theorem for regular language and Explain pumping lemma with the help
of diagram to prove that given language is regular language. (Any language will be given)
Q.4) Explain Non-Deterministic PDA and Describe Finite state machine.
Q.5) Differentiate between the following:
i) NPDA and PD
ii) FA PDA and TM
iii) Compare and contrast Moore and Mealy Machine.
iv) NFA and DFA.
Q.6) Write a short note on:
i) Chomsky Hierarchy
ii) Decision properties of regular language.
iii) Post correspondence problem.
iv) Variants of Turning machine.
v) TM Halting problem
vi) Recursive and Recursive enumerable language.
Numerical
Q.1) Show the grammar is represented by production rule is ambiguous. (Practice more question)
Q.2) Construct PDA for accepting Language. (Practice more question)
Q.3) Design DFA that accepts the string.
Q.4) Construct CFG for given language. (Practice more question)
Q.5) Find equivalent GNF for given CFG. And write steps for converting CFG to CNF form.
Q.6) Construct Turning machine to check all the formedness of parenthesis.
Q.7) Find : Left most derivation, Right most derivation, Parse tree and grammar is ambiguous or not.
Q.8) Design Turning machine.
Q.9) Design Moore machine and Mealy Machine. And Conversion to each other.
Q.10) Convert the following regular language to NFA and then convert to DFA.
*****ALL THE BEST*****
