Scribd
Upload
14 views3 pages

TE CS - TOC @PuneEngineers

This document appears to be an exam for a Theory of Computation course. It contains 8 questions covering various topics in formal languages and computability theory, including: simplifying a context free grammar, proving a language is not context free, designing pushdown automata and Turing machines, and complexity classes such as P and NP. The exam is worth 70 marks and has a time limit of 2.5 hours.

Uploaded by

sanghavikirkole2020.comp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views3 pages

TE CS - TOC @PuneEngineers

This document appears to be an exam for a Theory of Computation course. It contains 8 questions covering various topics in formal languages and computability theory, including: simplifying a context free grammar, proving a language is not context free, designing pushdown automata and Turing machines, and complexity classes such as P and NP. The exam is worth 70 marks and has a time limit of 2.5 hours.

Uploaded by

sanghavikirkole2020.comp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

AMRUTVAHINI COLLEGE OF ENGINEERING, SANGAMNER

DEPARTMENT OF COMPUTER ENGINEERING

Exam-:Prelim Subject: - Theory of Computation. Code: 310242


Semester: V (1stSem) Year: 2022-23 Marks:70
Class: TE COMP B-DIV Pattern:-2019 Time: 2.5 Hour

Q.No Questions Marks CO PO PSO BT


level
Q1 A Simplify the following Context Free Grammar (CFG) 06 03 1,2,3 1,2,3 01,3
S → ASB | ∈ ,12
A → aAS | ∈
B → Sbs | A | bb
G = {(S, A, B), (a , b), S, P : Productions are Given
Above).
B Give CFG for set of odd length strings in {0,1}* with 06 03 1,2,3 1,2,3 4,3
middle symbol 1. ,12
C Show that following grammar is ambiguous: 06 03 1,2,3 1,2,3 2,3
S → a | absb |aAb ,12
A → bs | aAAb

OR
Q2 A Prove that the language 06 03 1,2,3 1,2,3 2,3
L={ap | p is a prime} is not context free language. ,12
B Construct left linear and right linear grammar for the 06 03 1,2,3 1,2,3 4,5
language. ,12
0*(1 ( 0+1 ) )*
C Convert the grammar given below to its equivalent CNF: 06 03 1,2,3 1,2,3 02
S → PQP | ∈ ,12
P → 0P | ∈
Q → 1Q | ∈

Q3 A Define Pushdown Automata (PDA)? What are the 06 04 1,2,3 1,2,3 03


different types of PDA ? Explain any two applications of ,4,12
PDA?
B Design a PDA for accepting a language L = {an bm cn | m 06 04 1,2,3 1,2,3 04
,n>= l} ,4,12
C Construct PDA for the following regular grammar:- 06 04 1,2,3 1,2,3 02
S → 0A | 1B | 0 ,4,12
A → A0 | B
B → c| d
OR

Q4 A Explain the acceptance of language by PDA - 06 04 1,2,3 1,2,3 2,3


i) By Final State ,4,12
ii) By Empty Stack
B Design a PDA for detection of even palindrome 06 04 1,2,3 1,2,3 02
over{a,b}. ,4,12
C Construct PDA accepting {an.b2n | n>=1}. 06 04 1,2,3 1,2,3 04
,4,12

Q5 A Construct a Turing Machine to find 2's complement of a 06 05 1,2,3 1,2,3 02,3


binary number. ,4,12
B Design a TM Which recognizes words of the form www 06 05 1,2,3 1,2,3 03
over alphabet {a,b}. ,4,12
C Construct a Turing Machine which accepts odd length 05 05 1,2,3 1,2,3 02,3
palindrome over the ∑ ={a,b}. ,4,12

OR
Q6 A Design TM that recognizes occurrence of substring ‘101’ 06 05 1,2,3 1,2,3 02,4
and replaces it with 110. ,4,12
B Design a TM to recognize an arbitrary string divisible by 06 05 1,2,3 1,2,3 02,4
4, given ∑ ={0,1,2}. ,4,12
C Construct a TM that accepts a language L,a*ba*b. 05 05 1,2,3 1,2,3 02,4
,4,12
Q7 A Write a short note on Post Correspondence Problem? 06 06 1,2,3 1,2,3 2,3
,4
B What are Tractable and Intractable problems? Explain it? 06 06 1,2,3 1,2,3 2,3
,4
C Differentiate between P-class problems and NP-class 05 06 1,2,3 1,2,3 2,3
problem? ,4
OR
Q8 A What is Travelling Salesman Problem? Justify that it is a 06 06 1,2,3 1,2,3 2,3
NP-class ,4
Problem.
B Write a short note on Node-Cover Problem? 06 06 1,2,3 1,2,3 2.3
,4
C What is Polynomial Time Reduction? Explain It with 05 06 1,2,3 1,2,3 2,3
suitable example? ,4

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