Courses in NIT Goa

Can you provide me the course curriculum for Master of Technology Programme in Computer Science and Engineering offered by NIT (National Institute of Technology) Goa?

[pawan]

The course curriculum for Master of Technology Programme in Computer Science and Engineering offered by NIT (National Institute of Technology) Goa is as follows:

Subject Code CS600
Advanced Algorithms & Analysis (AAA)

Module
Formal models of computation, time and space complexity, Proof of lower.
Algorithm design techniques: Greedy algorithms, divide-and-conquer algorithms, dynamic programming, Branch-and-bound, amortization, optimal algorithms.

Module 2
Algorithms on arrays: Selection and median-finding, counting, radix and bucket sorts, string matching (Rabin-Karp and Knuth-Morris-Pratt algorithms) etc,
Geometric algorithms: Convex hulls, sweep paradigm, Voronoi diagrams. Etc.,
Algorithms on graphs : Traversal, topological sort, minimum spanning trees, shortest path, network flow -preflow-push algorithms, max flow algorithm etc.,
Arithmetic algorithms: GCD, modular arithmetic, primality testing etc., Numerical algorithms, Internet algorithms.

Module 3
NP-Completeness: Polynomial time, Verification, NP-Completeness and reducibility, NP Completeness proofs, NP-Complete problems.

Module 4
Randomized algorithms: Monte Carlo and Las Vegas algorithm. Randomized algorithms for the problems in various domains viz., Graph algorithms, Geometric algorithms parallel and distributing algorithms, online algorithms, Number theory and algebra., etc.,

Module 5
Approximation Algorithms: PTAS and FPTAS algorithms, combinatorial algorithms- Set cover, cut, TSP etc. Exact exponential algorithms:

Reference Books
1. T. Cormen, Charles E. Leiserson and Ronald D River, Introduction to
Algorithms, PHI, 3rd edition, 2009
2. Aho, Hopcroft and Ullman The design and analysis of Computer
Algorithms, Addison Weseley, 1st edition, 1974
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1st edition, 1979.
4. Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge
University, 1st edition, 1995
5. Vijay V Vazirani, Approximation Algorithms, Springer, 2002.


Course Curriculum M Tech in Computer Science and Engineering NIT Goa