Scribd Logo
Upload

Welcome to Scribd!

  • 47 views

    Answer All Questions. Each Question Carries 1 Weightage

    Uploaded by

    irnair
    This document contains the questions from the second internal examination of the Theory of Computation course for the first semester M.Sc. Computer Science students at Christ College, Irinjalakuda. It has 3 parts with a total of 36 weightage: Part A contains 12 one-mark questions about concepts like regular languages, non-deterministic automata, context-free grammars, Turing machines, and complexity classes. Part B contains 6 two-mark questions requiring explanations or constructions related to finite automata, grammars, and properties of languages. Part C contains 4 four-mark questions requiring longer discussions on topics like equivalence of CFG and PDA, undecidability, pumping lemma,

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Answer All Questions. Each Question Carries 1 Weightage

    Uploaded by

    irnair
    47 views2 pages
    This document contains the questions from the second internal examination of the Theory of Computation course for the first semester M.Sc. Computer Science students at Christ College, Irinjalakuda. It has 3 parts with a total of 36 weightage: Part A contains 12 one-mark questions about concepts like regular languages, non-deterministic automata, context-free grammars, Turing machines, and complexity classes. Part B contains 6 two-mark questions requiring explanations or constructions related to finite automata, grammars, and properties of languages. Part C contains 4 four-mark questions requiring longer discussions on topics like equivalence of CFG and PDA, undecidability, pumping lemma,

    Original Description:

    TOC

    Original Title

    TOC questions

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains the questions from the second internal examination of the Theory of Computation course for the first semester M.Sc. Computer Science students at Christ College, Irinjalakuda. It has 3 parts with a total of 36 weightage: Part A contains 12 one-mark questions about concepts like regular languages, non-deterministic automata, context-free grammars, Turing machines, and complexity classes. Part B contains 6 two-mark questions requiring explanations or constructions related to finite automata, grammars, and properties of languages. Part C contains 4 four-mark questions requiring longer discussions on topics like equivalence of CFG and PDA, undecidability, pumping lemma,

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    47 views2 pages

    Answer All Questions. Each Question Carries 1 Weightage

    Uploaded by

    irnair
    This document contains the questions from the second internal examination of the Theory of Computation course for the first semester M.Sc. Computer Science students at Christ College, Irinjalakuda. It has 3 parts with a total of 36 weightage: Part A contains 12 one-mark questions about concepts like regular languages, non-deterministic automata, context-free grammars, Turing machines, and complexity classes. Part B contains 6 two-mark questions requiring explanations or constructions related to finite automata, grammars, and properties of languages. Part C contains 4 four-mark questions requiring longer discussions on topics like equivalence of CFG and PDA, undecidability, pumping lemma,

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    CHRIST COLLEGE (AUTONOMOUS), IRINJALAKUDA

    FIRST SEMESTER M.Sc. COMPUTER SCIENCE

    SECOND INTERNAL EXAMINATION NOVEMBER 2017

    CSS1C03 - Theory of Computation

    Time: Three Hours Maximum : 36 Weightage

    PART A
    Answer all questions.
    Each question carries 1 weightage.

    1. Define Regular language


    2. Define non deterministic automata.
    3. Give one example each for right linear and left linear grammar.
    4. Define PDA.
    5. Define Chomsky Normal Form
    6. Find the context free grammar for L={ anbm: : n ≤ m+3, n ≥0, m≥0 }
    7. Define Universal Turing Machine.
    8. Define Type 0 Grammar.
    9. Define recursive language.
    10. State Cook's Theorem.
    11. Define P and NP classes.
    12. Give a brief idea about the Turing Machine Halting problem.

    (12x1=12 weight)

    PART B
    Answer any six questions.
    Each question carries 2 weightage.
    13. Design a DFA which accepts set of strings such that every string containing
    00 as a substring but not 000 as substring.
    14. Design a NFA for the language L=all strings over {0,1} that have at least
    two consecutive 0's or 1's.
    15. Write the regular expression for the language L={anbm |(n+m) is even}.
    16. Construct the finite automata equivalent to the regular expression a(a+b)*bb.
    17. Construct left and right linear grammar for : L={(ab)n | n≥1} U {(ba)n | n≥1}.
    18. Show that the grammar S→SbS | a ambiguous.
    19. Change the following grammar in to CNF
    S → 1A | 0B
    S → 1AA | 0S | 0
    S → 0BB | 1
    20. Explain cook's theorem.
    21. Explain the properties of recursive and recursive enumerable languages.

    (6x2=12 weight)

    PART C
    Answer Any Three questions.
    Each question carries 4 weightage.
    22. Discuss the equivalence of CFG and PDA.
    23. Write notes on
    (a) Undecidability.
    (b) NP completeness.
    (c) Post Correspondence Problem.
    24. State and prove pumping lemma for existence of Non context free
    languages.
    25. Explain CYK algorithm for context-free grammar with an example.
    26. Write the properties of recursive and recursive enumerable languages.
    27. Construct a Turing machine accepting language L={anbnan}

    (3x4=12 weight)

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy