Hello sir, I am looking for M.Tech Computer Science Syllabus Of MDU Rohtak. Can you provide me with that?

As you have asked about the M.Tech Computer Science Syllabus of MDU Rohtak, check below for the information
THEORY OF COMPUTATION

1. Introduction:
Mathematical notions and terminology of sets, sequences and tuples,
functions and relations, graphs, strings and languages. Boolean logic properties and
representation. Definition, Theorems and types of proofs, formal proofs, deductive,
reduction to definition, proof by construction, contradiction, induction, counter-examples.
2. Regular Languages:
Alphabets and languages, Finite Representation of Languages.
Deterministic Finite Automata, Non- deterministic Finite Automata, Equivalence of
Deterministic and Non-Finite Automata, Properties of the Languages Accepted by Finite
Automata, Finite Automata and Regular Expressions.
3. Context free languages:
Context-Free Grammar, Regular Languages and Context-
Free Grammar, Pushdown Automata – Pushdown Automata and Context-Free Grammar,
Properties of Context-Free Languages, Closure Properties, Periodicity Properties,
Determinism and Parsing, Deterministic Pushdown Automata and Context – Free
Languages, Top- down Parsing, Bottom – Up parsing.
4. Turing Machines:
The Definition of Turing Machine, Computing with Turing
Machines, variants of TMs, programming techniques for TMs, TMs and computers.
5. Decidability:
Decidable languages, decidable problems concerning Context free
languages. The halting problem – Diagonalization method, halting problem is
undecidable.
6. Reducibility:
Undecidable problems from language theory. Regular expressions,
Turing machines, Reduction, A simple undecidable problem (PCP).
7. Computability:
Primitive recursive functions, more examples, the recursion theorem


M.Tech Computer Science Syllabus Of MDU Rohtak







For full syllabus, you refer to the attached file

Attached Files

M.Tech Computer Science Syllabus Of MDU Rohtak.pdf (127.4 KB, 632 views)