J.K.K.NATTRAJA COLLEGE OF ENGINEERING & TECHNOLOGY J.K.K.

NATTRAJA COLLEGE OF ENGINEERING & TECHNOLOGY

Department of Computer Science Engineering Department of Computer Science Engineering
INTERNAL ASSESSMENT TEST – I REGULATION INTERNAL ASSESSMENT TEST – I REGULATION
2017 2017
Max Marks:50 Max hours: 1.30 hours Date & Session:& AN Max Marks:50 Max hours: 1.30 hours Date & Session:& AN
YEAR/SEM:III/V SubCode/Name: CS8501 / TOC YEAR/SEM:III/V SubCode/Name: CS8501 / TOC

PART – A (5x2=10 Marks) PART – A (5x2=10 Marks)

1. Define finite automata 1. Define finite automata

2. Difference between DFA and NFA. 2. Difference between DFA and NFA.

3. Write the notations of DFA. 3. Write the notations of DFA.

4. Define alphabet, string, powers of an alphabet and 4. Define alphabet, string, powers of an alphabet and

concatenation of strings. concatenation of strings.

5. Define formal and deductive proff. 5. Define formal and deductive proff.

PART – B (3x10=30 Marks) PART – B (3x10=30 Marks)

1. (a) Prove for every n>=1 by mathematical induction 1+2+3+…..n=n(n+1)/2 6. (a) Prove for every n>=1 by mathematical induction
(10) 1+2+3+…..n=n(n+1)/2 (10)
(OR) (OR)
(b) Explain finite Automata with Epsilon Transition (10) (b) Explain finite Automata with Epsilon Transition (10)

2. (a) write in brief about additional form of proof 7. (a) write in brief about additional form of proof
Proof: a = RU(S∩T) Proof: a = RU(S∩T)
Proff B= (RUS) ∩(RUT) (10) Proff B= (RUS) ∩(RUT) (10)

(OR) (OR)

(b) Construct a DFA accepting binary string such that the third symbol (b)Construct a DFA accepting binary string such that the third symbol
from the right end is 1. (10) from the right end is 1. (10)

3. (a) construct the transition diagram of finite automata accepting all binary strings 8. (a) construct the transition diagram of finite automata accepting all binarystrings
with even number of 0s and 1s (10) with even number of 0s and 1s (10)
(OR) (OR)

(b) Explain the difference between NFA and DFA with an example. (10) (b) Explain the difference between NFA and DFA with an example. (10)

PART – C (1x10=10 Mark) PART – C (1x10=10 Mark)

1. Prove for every n>=1 by mathematical induction 1. Prove for every n>=1 by mathematical induction
1^3+2^3+3^3…. n^3={n(n+1)/2}^2 (10) 1^3+2^3+3^3…. n^3={n(n+1)/2}^2 (10)