Scribd
Upload
92 views

ATC 17CS54 Module 5 Assignment Qs

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.

Uploaded by

Nitin Singh
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
92 views

ATC 17CS54 Module 5 Assignment Qs

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.

Uploaded by

Nitin Singh
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 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