IIT Kharagpur CSE M.Tech

Can you provide me the Curriculum for M.Tech course offered by Department of Computer Science and Engineering of IIT to Indian Institute of Technology Kharagpur?

[Shaleen]

The Curriculum for M.Tech course offered by Department of Computer Science and Engineering of IIT to Indian Institute of Technology Kharagpur is as follows:

CS60003 ALGORITHM DESIGN AND ANALYSIS
Algorithmic paradigms: Dynamic Programming, Greedy, Branch-and-bound;
Asymptotic complexity, Amortized analysis; Graph Algorithms: Shortest
paths, Flow networks; NP-completeness; Approximation algorithms;
Randomized algorithms; Linear programming; Special topics: Geometric
algorithms (range searching, convex hulls, segment intersections, closest
pairs), Numerical algorithms (integer, matrix and polynomial multiplication,
FFT, extended Euclid's algorithm, modular exponentiation, primality testing,
cryptographic computations), Internet algorithms (text pattern matching, tries, information retrieval, data compression, Web caching).

CS69001 COMPUTING LABORATORY I
Object-oriented programming concepts and implementation of abstract data types. Implementation of graph algorithms. Linear programming with applications. Basics of OS programming: process creation and synchronization, shared memory and semaphore, shell programming.

CS60001 FOUNDATIONS OF COMPUTING SCIENCE
Discrete Structures: Sets, Relations and Functions; Proof Techniques, Algebraic Structures, Morphisms, Posets, Lattices and Boolean Algebras.
Logic: Propositional calculus and Predicate Calculus, Satisfiabiliy and validity, Notions of soundness and completeness.
Languages and Automata Theory: Chomsky Hierarchy of Grammars and the corresponding acceptors, Turing Machines, Recursive and Recursively Enumerable Languages; Operations on Languages, closures with respect to the operations.
Computability: Church-Turing Thesis, Decision Problems, Decidability and Undecidability, Halting Problem of Turing Machines; Problem reduction (Turing and mapping reduction).
Computational Complexity:
Time Complexity: Measuring Complexity, The class P, The class NP, NP-Completeness, Reduction, co-NP, Polynomial Hierarchy.
Space Complexity: Savich's Theorem, The class PSPACE.

CS69002 COMPUTING LABORATORY II
Socket programming, database creation and update, building large client server applications. Basics of compiler writing using lex and yacc.

CS60002 HIGH PERFORMANCE COMPUTER ARCHITECTURE
Introduction: review of basic computer architecture, quantitative techniques in computer design, measuring and reporting performance. CISC and RISC processors. Pipelining: Basic concepts, instruction and arithmetic pipeline, data hazards, control hazards, and structural hazards, techniques for handling hazards. Exception handling. Pipeline optimization techniques. Compiler techniques for improving performance. Hierarchical memory technology: Inclusion, Coherence and locality properties; Cache memory organizations, Techniques for reducing cache misses; Virtual memory organization, mapping and management techniques, memory replacement policies. Instruction-level parallelism: basic concepts, techniques for increasing ILP, superscalar, super-pipelined and VLIW processor architectures. Array and vector processors. Multiprocessor architecture: taxonomy of parallel architectures. Centralized shared-memory architecture: synchronization, memory consistency, interconnection networks. Distributed shared-memory architecture. Cluster computers. Non von Neumann architectures: data flow computers, reduction computer architectures, systolic architectures.

Contact Detail:
Department of Computer Science and Engineering
Indian Institute of Technology
Kharagpur 721302, West Bengal, India
Telephone +91-3222-282255
Fax +91-3222-278985 (Office)
+91-3222-277190 (SRIC)