Scribd
Upload
7 views3 pages

Model Question ToC

The document outlines the model examination for the academic year 2024-2025 for the course CS3452 - Theory of Computation, covering various topics in computation theory. It includes a structured format with questions divided into three parts, assessing knowledge on context-free grammars, pushdown automata, decidability, and Turing machines. The examination is designed for students in the AIML and Cyber Security branches, with specific marks allocated to each question.

Uploaded by

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

Model Question ToC

The document outlines the model examination for the academic year 2024-2025 for the course CS3452 - Theory of Computation, covering various topics in computation theory. It includes a structured format with questions divided into three parts, assessing knowledge on context-free grammars, pushdown automata, decidability, and Turing machines. The examination is designed for students in the AIML and Cyber Security branches, with specific marks allocated to each question.

Uploaded by

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

ACADEMIC YEAR 2024-2025 (EVEN)

MODEL EXAMINATION
YEAR& SEMESTER: II & IV BRANCH: AIML, Cyber Security
DATE&SESSION: 17.05.2025 & FN TIME: 3 HOURS
COURSE CODE & NAME: CS3452-THEORY OF COMPUTATION

ANSWER ALL QUESTIONS


PART – A (10X2=20 MARKS)

S.N QUESTIONS LEVEL CO MARK


O S
1. Construct a CFG for the language L = { aⁿbᵐ | n ≥ 1, m ≥ 1 }. L2-UN CO3 2
2. Define the Languages accepted by PDA L2-UN CO3 2
3. Convert the following Context-Free Grammar (CFG) to an L1-RE CO3 2
equivalent Pushdown Automaton (PDA):
Given the Context-Free Grammar:
S → aSb | ab
S→ε
4. Define Pumping lemma for CFL. L1-RE CO4 2
5. Define the language Lu L1-RE CO5 2
6. When do you say a problem is decidable? Give example. L2-UN CO5 2
7. Define the language Ld. L1-RE CO5 2
8. Given a PCP instance: L2-UN CO5 2
List A = [ab, a], List B = [a, abb]
Check whether the first pair matches directly.
9. Give an example of a language in NP but not known to be in P. L1-UN CO5 2
10. Is Halting Problem decidable? Explain briefly. L1-UN CO5 2
PART – B (5X13= 65 MARKS)

11.a) Construct PDA for the language L = { wwᴿ | w ∈ {a, b}* }. L4-AP CO1 13
OR
11.b) Explain the design and working of a PDA for L2-UN CO1 13
L = { aⁿbᵐcⁿ⁺ᵐ | n, m ≥ 0 }

12.a) Convert the following Pushdown Automaton (PDA) to an equivalent L3-AP CO2 13
Context-Free Grammar (CFG):
Given the PDA with the following transitions:
States: {q₀, q₁, q₂}
Start state: q₀, Accepting state: q₂
Input alphabet: {a, b}
Stack alphabet: {Z, A, B}
Transitions:
q₀ → (a, Z → AZ)
q₀ → (a, A → AA)
q₀ → (b, A → ε)
q₀ → (ε, Z → ε)

OR
12.b) (i). Let G = (V, E, R, S) be the CFG, where V = {A, B, S}, E = {a, b}, L3-AP CO2 6+7
S is the start variable and R consist of the rules:
S aB / bA, A a / aS / BAA, B b / bS / ABB, Prove that ababba
∑ L(G). Prove that L(G) is the set of all non-empty strings w over the
alphabet {a, b} such that the number a’s in w is equal to the number of
b’s in w
(ii). Design the PDA to accept the language L={anbmcmd(n/2) | n,m
>=1}

13.a) Convert the following Context-Free Grammar (CFG) into Chomsky L3-AP CO2 13
Normal Form (CNF):
S → AB | a
A→a|ε
B → bB | ε
OR
13.b) Convert the following Context-Free Grammar (CFG) into Greibach L3-AP C02 13
Normal Form (GNF):
S → aAb | bB
A → aA | b
B → aB | ε

14.a) (i) Consider the following CFG: 13


S→A|B
A → aA | a
B → bB | b
i. Show the derivation of the string aaabbb using the grammar.
ii. Identify whether the grammar is ambiguous or not.
iii. If the grammar is ambiguous, provide at least two different
derivations for the string aaabbb and explain the nature of the
ambiguity.
iv. Convert the CFG to Chomsky Normal Form (CNF) and show
the step-by-step process of conversion.

OR
14.b) Consider the following CFG: 13
S → SS | aSb | ab
i. Derive the string aabb using the grammar.
ii. Identify whether the grammar is ambiguous. If it is, provide
two different derivations for the string aabb and explain why
the grammar is ambiguous.
iii. Discuss the implications of ambiguity in this context-free
grammar.
iv. Convert the CFG to Greibach Normal Form (GNF) and show
the conversion steps.

15.a) Explain the Modified Post Correspondence Problem (MPCP) and 13


prove its undecidablility.
OR
15.b) (i) Show that the class of recursive languages is closed under union 13

L₁ ∪ L₂ and L₁ ∩ L₂ are also recursive.


and intersection.Prove that if L₁ and L₂ are recursive languages, then

(ii) Consider the following languages:


L₃ = { w | w is a string that halts on a Turing Machine}
L₄ = { w | w is a string that does not halt on a Turing Machine}
Identify whether L₃ and L₄ are recursive or recursively enumerable.
Explain why they belong to one class but not the other, and discuss
any decidability or non-decidability aspects of these languages.
PART – C (1X15=15 MARKS)
16.a) Analyze the design of a Turing Machine that multiplies two binary L4-AN CO4 15
numbers using a subroutine.

Design a Turing Machine to decide the language L = { w ∈ {0,1} | w


OR
16.b) L4-AN CO4 15
is a palindrome }

Prepared by Verified By
Name: Dr. Deepalakshmi R Name: Dr. Deepalakshmi R
Designation: Professor&Head Designation: Professor&Head
Signature: Signature:

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