DATE: 30.04.2024 REG.

NO

GRT INSTITUTE OF
ENGINEERING AND
TECHNOLOGY, Tiruttani
Accredited by NBA(ECE), NAAC WITH “A++” Grade & An ISO 9001 : 2015 Certified Institution
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai.

ASSESSMENT TEST – I
ACADEMIC YEAR 2023-2024 [EVEN SEMESTER] – MARCH 2024
Second year / Fourth Semester
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
CS3452 – THEORY OF COMPUTATION (Regulation 2021)
SET - A

Time:2 Hours Maximum Marks: 60

Q. No Answer ALL Questions CO PO BL
PART – A (10 x 2 = 20 Marks)
Construct a DFA for the following:
1 a) All strings that contain exactly 4- zeros. CO1
b) All strings that don’t contain the substring 110.
2 Differentiate NFA and DFA. CO1
Convert the given NFA to an DFA.
a a,b

3 2 CO1
1
b

4 Design DFA to accept strings over Σ={0,1} with two consecutive 0’s. CO1
5 Define Deterministic Finite Automata(DFA). CO1
6 Prove that reversal of any regular language is also regular. CO2
Write a regular expression that recognizes the set of all strings (0+1)* that do
7 CO2
not contain the substrings 00 and 11 over the alphabet Σ={0,1}.
8 Is the following language regular? Justify your answer. L={02n | n>=1}. CO2
9 State the pumping lemma for regular languages. CO2
10 Define Regular expression. Give an example. CO2
PART –B (4 x 10 = 40 Marks)
11(a) Consider the NFA N=(Q, Σ, δ, q, F), where Q={1,2,3}, Σ={a,b,c}, q=1,
F={2} and δ is given by the following table:
a b c
1 {3} {2}
CO1
2 {1}
3 {2} {2,3
}
Convert the NFA into DFA that accepts the same Language.
(or)
11(b) i) Construct DFA for the following Language and check whether
w=’01101’ is valid string or not. n

ii) Prove that 12+22+32+…………..+n2 = Σi 2

= n(n+1)(2n+1) CO1
i=1 6
using Mathematical Induction.
12(a) Consider the following ε-NFA to NFA and then convert the resultant NFA to CO1
DFA.
DATE: 30.04.2024 REG.NO

GRT INSTITUTE OF
ENGINEERING AND
TECHNOLOGY, Tiruttani
Accredited by NBA(ECE), NAAC WITH “A++” Grade & An ISO 9001 : 2015 Certified Institution
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai.

(or)
12(b) Minimize the DFA as given below.

CO1

13(a) Prove that any language accepted by a DFA can be represented by a regular
expression and also construct a finite automata for the regular expression CO2
10+(0+11)0*1.
(or)
13(b) Prove that regular expressions are closed under union, Concatenation, Kleene
CO2
Closure, Complement.
14(a) Constructs the regular expression corresponding to the state diagram given in
the following figure.

CO2

(or)
14(b) Construct Finite Automation to accept the regular expression (0+1)*(00+11)
CO2
(0+1)*
COURSE OUTCOMES:
At the end of this course, the students will be able to:
 CO1: Construct automata theory using Finite Automata
 CO2: Write regular expressions for any pattern
 CO3: Design context free grammar and Pushdown Automata
 CO4: Design Turing machine for computational functions
 CO5: Differentiate between decidable and undecidable problems

COURSE COORDINATOR FACULTY INCHARGE HOD / CSE

ASSESSMENT TEST – I
ACADEMIC YEAR 2023-2024 [EVEN SEMESTER] – MARCH 2024
DATE: 30.04.2024 REG.NO

GRT INSTITUTE OF
ENGINEERING AND
TECHNOLOGY, Tiruttani
Accredited by NBA(ECE), NAAC WITH “A++” Grade & An ISO 9001 : 2015 Certified Institution
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai.

Second year / Fourth Semester

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
CS3452 – THEORY OF COMPUTATION (Regulation 2021)
SET - A

Time:2 Hours Maximum Marks: 60

Q. No Answer ALL Questions CO PO BL
PART – A (10 x 2 = 20 Marks)
1 CO1
2 CO1
3 CO1
4 CO1
5 CO1
6 CO2
7 CO2
8 CO2
9 CO2
10 CO2
PART –B (4 x 10 = 40 Marks)
11(a) CO1
(or)
11(b) CO1
12(a) CO1
(or)
12(b) CO1
13(a) CO2
(or)
13(b) CO2
14(a) CO2
(or)
14(b) CO2
COURSE OUTCOMES:
At the end of this course, the students will be able to:
 CO1: Construct automata theory using Finite Automata
 CO2: Write regular expressions for any pattern
 CO3: Design context free grammar and Pushdown Automata
 CO4: Design Turing machine for computational functions
 CO5: Differentiate between decidable and undecidable problems

COURSE COORDINATOR FACULTY INCHARGE HOD / CSE