Syllabus

WEEK DATES TOPICS CHAPTERS
1 23 - 27 September

Finite Automata

1.1
2 30 Sep. - 04 Oct.

Regular Operations

1.1
3 07 - 11 October

Nondeterminism

1.2
4 14 - 18 October

Regular Expressions

1.3
5 21 - 25 October

Pumping Lemma

1.4
6 28 Oct. - 01 Nov.

Context Free Grammars

2.1
7 04 - 08 November

Pushdown Automata

2.2
8 11 - 15 November

Non-context-free Languages

2.3
9 18 - 22 November

Turing Machines

3.1
10 25 - 29 November

Variants of Turing Machines

3.2
11 02 - 06 December

Definition of Algorithm

3.3
12 09 - 13 December

Decidability and Halting Problem

4.1 - 4.2
13 16 - 20 December

P and NP

7.1 - 7.3
14 23 - 27 December

NP Completeness

7.4 - 7.5