Scribd
Upload
28 views2 pages

Sessional II Toc Set 2

The document outlines the examination structure for the Theory of Computation course at Krupanidhi College of Management for the academic year 2024-2025. It includes details on course outcomes, program outcomes, cognitive levels, and a list of questions for both Part A and Part B of the exam. The questions cover various topics such as DFA to CFG conversion, regular expressions, and the Chomsky hierarchy.

Uploaded by

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

Sessional II Toc Set 2

The document outlines the examination structure for the Theory of Computation course at Krupanidhi College of Management for the academic year 2024-2025. It includes details on course outcomes, program outcomes, cognitive levels, and a list of questions for both Part A and Part B of the exam. The questions cover various topics such as DFA to CFG conversion, regular expressions, and the Chomsky hierarchy.

Uploaded by

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

KRUPANIDHI COLLEGE OF MANAGEMENT

(AN AUTONOMOUS INSTITUTE AFFILIATED TO BNU, BENGALURU)


Note: CO= Course Outcome PO= Program Outcome CL= Cognitive Level as per Blooms Taxonomy

Date: Course: Theory of Name of the Course faculty:


Computation
Academic Year: 2024-2025 Course code: MCA106T AKILA.L
Time: 3 Hrs Semester: I Max marks: 70 Marks Program: MCA I
Part A CL CO PO
Answer any Five of the following 5 X 6 = 30
1 Write down the steps for conversion of DFA to CFG. 3 2 8

2 Show that L={w/na(w)=nb(w)} is not regular. 3 4 5


3 Construct ɛ-nfa For the regular expression 00*+1. 3 4 5
4 Prove that S 0S1S/1S0S/ɛ is ambiguous. 3 5 1
Construct regular expression from the given DFA

5 3 4 5

6 Explain the Chomsky hierarchy of Language. 3 3 3


7 Obtain a CFG for the set of all palindromes over ∑ 3 5 1
Is the PDA to accept the language L(M)={w/wɛ(a+b)* and
8 3 3 3
na(w)=nb(w)} deterministic?
Part B
Answer any Four of the following 4 X 10 = 40
9 State and prove pumping lemma. 3 2 8
Construct a PDA to accept the language
10 L(M)={wcwR/wɛ (a+b)*} where wR is the reverse of w by final 3 3 3
state acceptance.
11 Obtain a PDA to accept the language L={anb2n/n≥1} using final 3 3 3
KRUPANIDHI COLLEGE OF MANAGEMENT
(AN AUTONOMOUS INSTITUTE AFFILIATED TO BNU, BENGALURU)
Note: CO= Course Outcome PO= Program Outcome CL= Cognitive Level as per Blooms Taxonomy

state acceptance.

Explain the hypothesis for construction of ɛ-NFA from regular


12 3 2 8
expression
13 Construct DFA for the regular expression (a+b)*bba. 3 3 3
14 Show thatL={0n/n is prime} is not regular. 3 2 8
Note: CO= Course Outcome PO= Program Outcome CL= Cognitive Level as per Blooms Taxonomy

You might also like