Scribd Logo
Upload

Welcome to Scribd!

  • 89 views

    ATC 17CS54 Module 5 Assignment Qs

    Uploaded by

    Nitin Singh
    This document contains two assignments for an Automata Theory and Computability course. The first assignment contains 7 questions about topics like Turing machines, linear bounded automata, decidability, and the Post correspondence problem. The second assignment contains 5 questions about growth rates of functions, complexity classes P and NP, quantum computation, and the Church-Turing thesis. Both assignments list the relevant course outcomes, program outcomes, and program specific outcomes.

    Copyright:

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

    ATC 17CS54 Module 5 Assignment Qs

    Uploaded by

    Nitin Singh
    89 views2 pages
    This document contains two assignments for an Automata Theory and Computability course. The first assignment contains 7 questions about topics like Turing machines, linear bounded automata, decidability, and the Post correspondence problem. The second assignment contains 5 questions about growth rates of functions, complexity classes P and NP, quantum computation, and the Church-Turing thesis. Both assignments list the relevant course outcomes, program outcomes, and program specific outcomes.

    Original Title

    ATC 17CS54 Module 5 Assignment Qs (1)

    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 two assignments for an Automata Theory and Computability course. The first assignment contains 7 questions about topics like Turing machines, linear bounded automata, decidability, and the Post correspondence problem. The second assignment contains 5 questions about growth rates of functions, complexity classes P and NP, quantum computation, and the Church-Turing thesis. Both assignments list the relevant course outcomes, program outcomes, and program specific outcomes.

    Copyright:

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

    ATC 17CS54 Module 5 Assignment Qs

    Uploaded by

    Nitin Singh
    This document contains two assignments for an Automata Theory and Computability course. The first assignment contains 7 questions about topics like Turing machines, linear bounded automata, decidability, and the Post correspondence problem. The second assignment contains 5 questions about growth rates of functions, complexity classes P and NP, quantum computation, and the Church-Turing thesis. Both assignments list the relevant course outcomes, program outcomes, and program specific outcomes.

    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

    J S S Mahavidyapeetha

    J S S Academy of Technical Education, Bangaluru-60


    Department of Information Science & Engineering
    Course Assignments

    Faculty In charge: Mamatha G Unit no.: Module-5


    Subject With Code: Automata Theory and Computability [17CS54] Assignment no.: 1
    Announcement Date: 14/11/2019 Submission Date: 19 /11/2019

    Relevance of CO/PO/PSO:

    Course Outcome (CO) Program Outcomes (PO) Program Specific


    Outcomes (PSO)
    C304.5: Classify the problem into Decidable or Un- PO1,PO2, PO3, PO5, PO8, PO9, PSO1, PSO2,PSO3
    decidable language PO10, PO12

    Q No. Questions Marks


    1 Explain the features of the following variants of Turing Machines 2*3
     Multi tape TM
     Non deterministic TM
    2 With diagram, explain the model of Linear Bound Automaton 5
    3 Explain the following with examples 3*2
     Decidable problem,
     halting problems,
     Recursively enumerable language
    4  What is Post Correspondence Problem (PCP)? Explain with an example. 2*4
     What is Modified Post Correspondence Problem (MPCP)? Explain with
    an example.
    5 Solve the following and tell whether the PCP instances have solution or not 2*4

     x = ( b, bab3, ba) y = ( b3, ba, a)


     x = ( 110, 0011, 0110) y = ( 110110, 00, 110)
     x = ( 01, 1, 1) y = ( 012, 10, 1)
     x= ( b3, ab2 ) y = ( b3, bab3 )
    6 Explain with an example , how a PCP can be treated as a game of Dominoes 4

    7 Prove the following: 3+3


     PCP over ∑ for | ∑ | =1 is solvable
     PCP over ∑ for | ∑ | >= 2 is unsolvable

    Signature of the Faculty:


    J S S Mahavidyapeetha
    J S S Academy of Technical Education, Bangaluru-60
    Department of Information Science & Engineering

    Course Assignments

    Faculty In charge: Mamatha G Unit no.: Module-5


    Subject With Code: Automata Theory and Computability [17CS54] Assignment no.: 2
    Announcement Date: 15/11/2019 Submission Date: 22 /11/2019

    Relevance of CO/PO/PSO:

    Course Outcome (CO) Program Outcomes (PO) Program Specific


    Outcomes (PSO)
    C304.5: Classify the problem into Decidable or Un- PO1,PO2, PO3, PO5, PO8, PO9, PSO1, PSO2,PSO3
    decidable language PO10, PO12

    Q No. Questions Marks


    1  what is Growth rate of a function, explain with example functions 3+3
     give the growth rate table for polynomial and exponential functions and compare the
    rate
    2  Define the following - Class P and class NP languages 3+3

     Find the running time of Euclidean algorithm for gcd(a, b).


    3 What is Quantum computation? 4
    4 Explain the features of Quantum computers 4
    5 Write a note on Church- Turing Thesis 3

    Signature of the Faculty:

    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