Theory of Computation MCA paper Nov 2021

  • Subject Code: - PGCA 1927
  • Subject Name: - Theory of Computation
  • Date of Examination: - Nov 2021
  • Class: - MCA 3rd
  • Exam Mode: - Online

Instructions to Candidates

  1. Attempt any FIVE question(s), each question carries 14 marks.

QUESTIONS

  1. State and prove Principle of Mathematical Induction.
    1. Prove that ∈ + RR* = R* = ∈ + R*R
    2. Prove that (P + Q)* = P*Q*
  2. What are Context Free Grammars? How are they different from context free language? Discuss various normal forms for context free grammars in brief.
    1. State the principle of pumping lemma. Also discuss its various applications.
    2. Reduce the given CFG S → abSb/a/aAb and A → bS/aAAb to Chomsky Normal Form (CNF).
    1. Differentiate between recursively enumerable and recursive languages.
    2. What are Context Sensitive languages? Explain
    1. Design a Turing Machine that can add two unary strings.
    2. Design a Turing Machine which can find transpose of a binary string.
    1. Prove the following property of regular expressions: R + R = R.
    2. State whether the following statement is true or not. Justify your answer as well: If L and M are regular languages then L + M, LM and L* are also regular.
  3. Prove that the class of languages accepted by finite automata is closed under:
    1. Union.
    2. Complementation.
    3. Intersection.

ANSWERS:

Q1.

Top

Comments

Popular posts from this blog

Programming in Python MCA paper Nov 2021

Advanced JAVA MCA paper May 2021

Computer Networks BCA paper Nov 2021