IIT Madras Ms Written Test Syllabus

Hello ! myself jagran and pursuing M.tech (MS) from International Institute of Technology (IIT) of Madras and my professor told me that syllabus for M.tech has met with some changes so kindly provide the revised syllabus for M.tech of IIT madras??

I want the syllabus of MS Written Test of Indian Institute of Technology IIT Madras so will you provide me?

[pooja]

I am providing you the syllabus of MS Written Test of Indian Institute of Technology IIT Madras

IIT Madras MS Written Test Syllabus

Math

Mathematical Logic:
Propositional Logic; First Order Logic.

Probability:
Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables;
Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra:
Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatorics:
Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

CS

Digital Logic:
Logic functions, Minimization, Design and synthesis of combinational and sequential circuits;
Number representation and computer arithmetic (fixed and floating point).
Computer Organization and Architecture:
Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory
interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main
memory, Secondary storage.

Programming and Data Structures:
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data
types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms:
Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case
analysis; Design:
Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic
analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts
of complexity classes P, NP, NP-hard, NP-complete.
Theory of Computation:
Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Books Referred
Math
Discrete Mathematics in Computer Science by Stanat and McAllister.
Discrete Mathematics by Kenneth Rosen

CS
Digital Logic - Morris Mano
Computer Organization - V. Carl Hamacher, Zvonko G. Vranesic, Safwat G. Zaky
Algo and Data Structures
Introduction to the Design and Analysis of Algorithms - Anany Levitin
Introduction to Algorithms - Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, and Clifford Stein [CLRS]
Theory of computation - Introduction to Automata Theory - John E. Hopcroft, Rajeev
Motwani, Jeffrey D. Ullman
For algorithms, CLRS has rigorous mathematical approach, while Levitin is light comparatively.
I used CLRS for initial preparation and Levitin for last minute revision.
For architecture, Computer Architecture: A Quantitative Approach by John L. Hennessy, David
A. Patterson, can be used for additional reading.

Contact-
IIT Madras
Sardar Patel Road, Opposite to C, L.R.I, Adyar, Chennai, Tamil Nadu 600036
044 2257 8101