Register No.

ASIAN
COLLEGE OF ENGINEERING AND TECHNOLOGY
Kondayampalayam, Coimbatore – 641 1110
Approved by AICTE & Affiliated to Anna University, Chennai
INTERNAL ASSESMENT EXAMINATION – I, April 2024
COURSE: B.E – COMPUTER SCIENCE AND ENGINEERING
SUB:CS3452 THEORY OF COMPUTATION
Class & Semester: II Year & IV Date:15.04.2024(FN)
Duration: 1.5 Hrs Maximum: 50 Marks
PART – A (7 x 2 = 14 Marks)
SL.NO ANSWER ALL QUESTIONS Marks CO BTL
1 Define Theory of Computation 2 CO1 Re (K1)
2 Differentiate between Deductive and Inductive proof. Marks) 2 CO1 Un (K2)
3 What is induction principle? 2 CO1 Re (K1)
4 Define Finite Automata. 2 CO2 Re (K1)
5 Define the term epsilon transition. 2 CO2 Re (K1)
6 Define Deterministic Finite Automata. 2 CO2 Un (K2)
7 Construct NFA that starts with ab where inputs ={a,b}. 2 CO3 Cr (K6)
PART – B (3 x 12 = 36 Marks)
Sl. No. ANSWER ALL QUESTIONS Marks CO BTL
8 a. Explain the different forms of proof with examples. 12 CO1 Un (K2)
Or
b. i)Prove that √2 is not rational.
6 CO1 Ap (K3)
ii)Prove that 12 + 22 + 32 +…..+n2 =∑𝑛𝑖=1 𝑖^2 = n(n+1)(2n+1)
6 CO1 Ev (K5)
6
9 a. 6 CO2 Ap (K3)
i) Prove that for every integer n > 0 the number 42n+1 + 3n+2 is multiple of 13.

ii) Prove for every n > 1 by mathematical induction ∑𝑛𝑖=1 𝑖^3= {n(n+1)/2}2 6 CO2 Ap (K3)

Or
b.
i) Explain the DFA for the types Strings Ending with problems with example. 6 CO2 Un (K2)

ii)Create a DFA for the string containing the substring bab. 6 CO2 Ap (K3)

10 a. i)Explain the type Strings Starting with problems with an example. 6 CO3 Un (K2)
ii)Create a DFA for string divisible by 3.
6 CO3 Ap (K3)
Or
b. i)Prove : 1+ 4+ 7+…..+(3n-2)= n(3n-1) for n>0
6 CO3 Ev (K5)
2
ii)Define Non-Deterministic Finite Automata with example.
6 CO3 Un (K2)

Prepared by
Teaching Coordinator/ Approved by
Mrs. MAHESWARI S
IQAC Coordinator HoD – CSE
AP /CSE