Theory of Computation–Question Bank ( All Units )

Anna University

Department of Computer Science and Engineering

Theory of Computation
QUESTION BANK


Subject Code : CS2303

Subject Name : Theory of Computation

Year / Sem: III / V


UNIT-I AUTOMATA

PART-A(2-MARKS)

1 List any four ways of theorem proving.

2 Define Alphabets.

3 Write short notes on Strings.

4 What is the need for finite automata?

5 What is a finite automaton? Give two examples.

6 Define DFA.

7 Explain how DFA process strings.

8 Define transition diagram.

9 Define transition table.

Click Here to download full Question Bank.

Download :

theory_of_compu.pdf (300 kb)