M Tech in Andhra University

Provide me the syllabus of M. Tech Computer Science & Technology course offered by Andhra University College of Engineering at Visakhapatnam?

[Kiran Chandar]

Andhra University was established in 1926. Andhra University College of Engineering at Visakhapatnam, India is an autonomous college of Andhra University.

M Tech in Andhra University Computer Science & Technology Syllabus

1. INTRODUCTION TO FINITE AUTOMATA: 6 Periods 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 – Proofs those Languages Are and Are Not Regular.

2. CONTEXT FREE LANGUAGES: 9 Periods 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.

3. TURING MACHINES: 5 Periods The Definition of Turing Machine – Computing with Turing Machines – Combining Turing Machines – some Examples of More Powerful Turing Machines .

4. CHURCH’ THESIS: 6 Periods Church’s Thesis – The Primitive Recursive functions – Godelization – The µ-Recursive Functions – Turing – Computability of the µ-Recursive functions – Universal Turing Machines.

5. UNCOMPUTABILITY: 6 Periods The Halting Problem – Turing-Enumerability, Turing – Acceptability, and Turing - Decidability – Unsolved problems about Turing machines and µ-Recursive Functions- Post’s correspondence problem. 6. COMPUTATIONAL COMPLEXITY:

6 Periods Time-bounded Turing Machines – Rate of Growth of functions – Time-Bounded simulations – The Classes P and NP – NP-Completeness – Some NP-complete Problems – Integer Programming – The Traveling Salesman Problem.

7. THE PREPOSITIONAL CALCULUS 5 Perods Introduction – Syntax of the Prepositional Calculus – Truth-Assignments – Validity and Satisfiability – Equivalence and Normal Forms – resolution in Prepositional Calculus.

8 THE PREDICATE CALCULUS: 5 Periods Syntax of the Predicate Calculate Calculus – Structures and Satisfiability – Equivalence – Unsolvability and NP-Completeness- Resolution in the Predicate Calculus.

1. INTRODUCTION: 4 Periods.
Overview of C++ classes, pointers, parameters passing, templates, using Matrices.


2. ALGORITHM ANALYSIS: 3 Periods
Basics of time complexity estimates, General norms for running time calculation
3. LISTS, STACKS & QUEUES: 10 Periods
Abstract Data Types, Representation & implementation of ADT list, Doubly linked list, Circular linked lists, Representation, Implementation and applications of ADT stack and Queue.

4. TREES: 10 Periods
Implementation and traversal of trees, Binary Trees and Binary search trees in C++, Concepts of AVL Trees, Splay Trees and B-Trees.


5. HASHING: 4 Periods.
Hash Function, Separate chains, Open addressing, rehashing, Extendible Hashing.


6. INTERNAL SORTING ALGORITHMS: 7 Periods.
Sorting like insertion Sort, shell Sort, Heap Sort, Merge Sort, Quick Sort and Simple external Sorting algorithm.


7. GRAPH ALGORITHMS: 10 Periods.
Representation of graph Topological Sort, shortest-path Algorithm, Network flow problem, Minimum spanning tree algorithm, Applications of Depth – First search. Introduction to NP-Completeness.


for more details attached a pdf file
M Tech in Andhra University Computer Science & Technology Syllabus