Theory of Computer Science Syllabus.

Part 1 Mathematical Preliminaries for Computer Science Introduction; Sets and Cartesian product of sets; Functions and Relations; Equiv alence Relations; Matrix Representations; Closure Relation: Part 2 Recursive Functions, Strings and Growth Functions Introduction; Recursive Functions; Integer Functions; Sequences and Strings; Gro wth Function: Part 3 Methods of Proof Introduction; Proof Techniques: Part 4 Graphs and Binary Trees Introduction; Definitions and Examples; Isomorphism; Trees; Rooted Tree: Part 5 Formal Languages and Grammars Introduction; Grammars and Languages; Classification of Grammars: Part 6 Deterministic Finite Automata Introduction; Basic Terms; Deterministic Finite Automaton (DFA); Transition Syst em (Transition graph); Language accepted by a DFA: Part 7 Non Deterministic Finite Automata Introduction; Non-Deterministic Finite Automata; Language accepted by a NDFA; Co nversion from NDFA to DFA; Moore and Mealy Machines: Part 8 Further Problems on DFA and NDFA Introduction; Problems on DFA; Problems on NDFA; Difference between DFA and NDFA Part 9 Regular Expressions and Regular Languages Regular expressions; Regular Expressions accepted by the Language; Finite Automa ton from Regular Grammar; Regular Grammar from Finite Automata Part 10 Properties of Regular Languages and Pumping Lemma Introduction; Closure Properties of Regular Sets; Pumping Lemma; Applications of Pumping Lemma: Part 11 Context Free Grammars Introduction; CFG for various types of CFL; Derivations; Ambiguous Grammar: Part 12 Mathematical Fundamentals for Computer Science Introduction; Sets and Properties; Functions and Relations; Equivalence Relation s ; Recursive Functions; Strings and Growth Functions: Part 13 Proof Techniques Introduction; Proof Techniques Part 14 Trees and Binary Trees Introduction; Graphs; Trees; Binary Trees; Walks and Paths; Directed Graphs: Part 15 Grammar and Formal Languages Introduction; Grammars and Languages; Types of Grammar: Part 16 Deterministic Finite Automata (DFA) Introduction; Basic Terms; Deterministic Finite Automata (DFA); Transition Syste m (Transition graph); Language accepted by a DFA:

Part 17 Nondeterministic Finite Automata (NFA) Introduction; Nondeterministic Finite Automata; Language accepted by a NFA; Cons truction from NFA to DFA; Moore and Mealy Machines: Part 18 Regular Expressions and Regular Languages Introduction; Regular expressions; Regular Expressions accepted by the Language; Finite Automata from Regular Grammar; Regular Grammar from Finite Automata: Part 19 Regular Languages-Properties and Pumping Lemma Introduction; Closure Properties of Regular Sets; Pumping Lemma; Applications of Pumping Lemma: Part 20 Context Free Grammars Introduction; CFG for various types of CFL; Derivations; Ambiguous Grammar: Part 21 Pushdown Automata (PDA) Introduction; Definition of PDA and Moves; Graphical Representation; Constructio n of Pushdown Automata; Deterministic and Non-deterministic PDA: Part 11 Context Free Languages - Properties Introduction; Pumping Lemma; Applications of Pumping Lemma for CFL; Closed Prope rties of CFL Part 22 Turing Machines- Construction Introduction; Turing Machine Model; Language Accepted by a Turing Machine; Desig n or Construction of a Turing Machine: