NIT Goa Fee Structure for M. Tech
 

Can you provide me the fee structure and course structure of M. Tech. programme in Computer Science and Engineering offered by NIT (National Institute of Technology) Goa?

Re: NIT Goa Fee Structure for M. Tech
 

M. Tech. programme in Computer Science and Engineering of NIT (National Institute of Technology) Goa prepare Computer professionals for research, academics, design and development in hardware, software and co-design technologies.

It offers an opportunity to work on latest research topics in Computer Science and Engineering. It provides exposure to emerging cutting edge technologies, adequate training & opportunities to work as teams on multidisciplinary projects with effective communication skills and leadership qualities.


NIT Goa Fee Structure for M. Tech

https://mba.ind.in/img/b/NIT-Goa-Fee...-M.-Tech-1.jpg
https://mba.ind.in/img/b/NIT-Goa-Fee...-M.-Tech-2.jpg

M. Tech. programme in Computer Science and Engineering Syllabus

Advanced Algorithms & Analysis (AAA)

Module 1
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
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 –pre flow-push algorithms, max flow algorithm etc., Arithmetic algorithms: GCD, modular arithmetic, primarily 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: