School of Information Technology Indian Institute of Technology Kharagpur

Syllabus for MS and PhD Entrance Test

Basic Mathematics
Set theory Venn diagram, set operations, mathematical induction, functions and relations, partial and linear order. Matrix and linear algebra Matrices and determinant, rank, singularity, Eigen vectors and Eigen values, homogeneous and non-homogeneous linear equations, dot and cross products of vectors. Combinatorics Permutation and combination, Recurrence relations, sum and product rules, principles of exclusion and inclusion, pigeon-hole principle. Probability and statistics Mean, median, mode, basic notion of probability, expectation, variance and standard deviation, discrete and continuous probability distributions, binomial, Poissons and normal distributions, conditional probability and Bayes theorem.

Basics of Programming
The student should be familiar with the basic concepts of programming and should be able to write programs involving the following concepts in any one of the following languages: C, C++ or Java.

Decision, iteration, function or method call, recursion, recursive decomposition of a problem. Basic notions of space and time complexity Parameter passing mechanism, scope, binding Arrays, lists, stacks, queues, binary tree, binary search tree Basics of searching and sorting Graph and its representation

Basics of Computing Systems

Computer Organization 2's complement number representation and arithmetic on 2's complement numbers (addition, subtraction, multiplication, division), immediate, indexed, relative, direct and indirect addressing, execution of arithmetic, logical, branching and subroutine call instructions, memory and i/o mapped input/output, interrupt handling and organization of standard 5-stage pipelined CPU. Networking and Internets ISO/OSI stack, Ethernet (Manchester encoding, frame format, ethernet addresses, CRC), ARQ, IP addressing, ARP/RARP, sub netting, distance vector and link state routing, hubs, bridges, switches, routers, socket programming, ICMP, HTTP. Databases E-R diagrams, relational model, relational database design, integrity constraints, normal forms, B-tree and B+ tree indexing. Operating Systems (in the context of Unix) Processes, inter process communication, CPU scheduling, file systems, memory management, Bourne shell programming.

Logical Reasoning
Verbal reasoning 1. Analogy: A particular relationship is given and another similar relationship has to be identified from the alternatives provided. 2. Classification: Assort the items of a given group on the basis of certain common quality they possess and then spot the odd option out. 3. Series Completion: Given a series of numbers or letters, it is required to either complete the series or find out the wrong part in the series. 4. Logical Deduction: Given a brief passage, it is required to identify the correct or incorrect logical conclusions. Non-verbal reasoning 1. Pattern Perception: A certain pattern is given and generally a quarter is left blank. It is required to identify the correct quarter from the given four alternatives. 2. Figure Matrix: More than one set of figures is given in the form of a matrix, all of them following the same rule. The candidate is required to follow the rule and identify the missing figure. 3. Rule Detection: Given a particular rule and sets of figures, it is required to select a set of figures which obeys the rule and forms the correct series.