Reg. No.

:
SET
3

IFET COLLEGE OF ENGINEERING

(An Autonomous Institution)
MODEL EXAMINATION
DEPARTMENT OF CSE & AIML
SUB CODE: 19UCSPC502 MAX MARKS: 100
SUB NAME: THEORY OF DURATION: 180Min
COMPUTATION
YEAR/
DATE: .10.2023/AN III/V
SEMESTER:
TIME MANAGEMENT CHART
Part Question No.’s Time allotted
A 1-10 1.15 pm-1.45 pm
11 1.45 pm-2.15 pm
12 2.15 pm-2.45 pm
B 13 2.45 pm-3.15 pm
14 3.15 pm-3.45 pm
15 3.45 pm-4.15 pm

PART-A (10¿ 2=20)

Answer All Questions
(Each answer should have minimum 7 lines)
1. What is structural induction? R CO1
2. What is the difference between DFA and NFA? U CO1
3. Define Regular expression. Give an example. R CO2
4. Prove or disprove that (r+s)* = r* + s*. A CO2
5. Derive 001011 from the grammar S→0S1|A; A→1A0 | S | ε S CO3
6. Show that id + id*id can be generated by two distinct leftmost derivation in the A CO3
grammar E →E+E | E*E | (E) | id.
7. Define instantaneous description of a PDA. R CO4
8. Design a Turing machine with no more than three states that accepts the language A CO4
a(a+b)*. Assume Σ = {a,b}.
9. Define diagonalization language. R CO5
10. Discover whether the lists M = (abb, aa, aaa) and N = (bba, aaa, aa) have a Post A CO5
Correspondence Solution?

PART-B (5¿ 16=80)

Answer All Questions
(Each answer should be written for minimum 6 pages with minimum 25 lines per
page)
11. A(i) 2 2 U (8) CO1
3 3 n (n+1)
3
Prove that 1 +2 +… … .+n = by mathematical induction.
4
A(ii) Prove that S(n)=an–bn is divisible by a-b for all n>0 S (8) CO1
(OR)
11. B Convert the given NFA with ε to DFA A (16) CO1

δ a b c ε
→p {p} {q} {r} ϕ
q {q} {r} ϕ {p}
*r {r} ϕ {p} {q}

12. A(i) Design a FA from given regular expression 10 + (0 + 11)0* 1. A (8) CO2
A(ii) Show that L={0n10n|n≥1} is not regular. S (8) CO2
(OR)
12. B Construct a minimized DFA that can be derived from the following U (16) CO2
regular expression 0*(01)(0/111)*

13. A(i) Let G be a grammar S→0B | 1A, A→0 | 0S | 1AA, B→1 |1S | 0BB. U (8) CO3
For the string 00110101 find its leftmost derivation and derivation tree.
A(ii) Show that the language L= { 02 i /i ≥ 1 } is not a context free grammar A (8) CO3

(OR)
13. B(i) Convert the following to Greibach Normal Form. S (8) CO3
S → a | AB, A→a | BC, B→b,C→b.
B(ii) Find the CNF Grammar for the following grammar S (8) CO3
S→AB/aB
A→aab/ε
B→bbA

14. A Construct a CFG accepting L= {am bn | n<m} and construct a PDA A (16) CO4
accepting L by empty stack.
(OR)
14. B(i) Design a TM to recognize all strings that has an even number of 1’s or S (6) CO4
accept that the language L={1n | n is even}.
B(ii) Draw a Turing machine to find 2’s complement of a binary number. A (10) CO4

15. A(i) Let ∑ = {0,1} A and B be the lists of three strings each defined as. S (8) CO5
List A ( wi ) List B (wi )
1. 1 111
2 10111 10
 3 10 0
Does this PCP have a solution?
15. A(ii) Show that the language Lu is recursively enumerable but not recursive. S (8) CO5
(OR)
15. B Explain Class P and NP with an example. R (16) CO5

Mapping of Course Outcomes (CO) to Programme Outcomes (PO)

Course/Course Mapping with Programme outcomes
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
C303.1 1 3 - - - - - - - - - -
C303.2 2 3 - - - - - - - - - -
C303.3 - 3 2 - - - - - - - - -
C303.4 - 3 2 - - - - - - - - -
C303.5 - 3 - - - - - - - - - -
TOC 2 3 2 - 3 - - - - 3 - -
3- Strong Correlation, 2 – Medium Correlation, 1- Weak Correlation

------All the Best-----