Theoretical Computer Science Important Questions Semester 5 – Comps MU

This Questions are contributed by Private Academy Engineering

MODULE 1 – BASIC CONCEPTS AND FINITE AUTOMOTA.

1. Difference Between NFA And DFA.
2. Explain Application For FA.
3. Describe Finite State Machine.
4. Explain Conversion Of Moore To Mealy Machines.
5. Compare And Contrast Moore And Mealy Machines.

MODULE 2 – REGULAR EXPRESSIONS AND LANGUAGE.

1. Explain Decision Properties Of Regular Languages.
2. Explain Closure Properties Of Regular Languages.
3. Explain Pumping Lemma Of Regular Language.

MODULE 3 – GRAMMERS.

1. Explain Chomsky Hierarchy.
2. Write A Steps For Converting CFG to CNF Form.

MODULE 4 – PUSHDOWN AUTOMOTA (PDA).

1. Differentiate Between NPDA And PDA.
2. Explain Application For PDA.
3. Explain Acceptance By A PDA.
4. Explain PDA And It’s Working.
5. Explain Non-Deterministic PDA.

MODULE 5 – TURING MACHINE (TM).

1. Explain Variants Of Turing Machine.
2. Explain Application For TM.
3. Write Short Note On Universal TM.
4. Design A TM Accepting All Palindromes Over {0,1}.
5. Construct TM To Check Well Formedness Of Parenthesis.
   More On WhatsApp – bit.ly/3PVERGc

MODULE 6 – UNDECIDABILITY.

1. Explain Post Correspondence Problem.
2. Explain Rice’s Theorem.
3. Explain Halting Problem Of Turing Machine

Theory Answers – https://Madhav.topsecret.link/0nlsg

Solved Numerical 5 Examples – https://Madhav.topsecret.link/ca3jm

src :