May 1-8

Verbal Ability: Finding appropriate word, reading passages, basic grammar usage

May 9-15

Quantitative Aptitude: Ratios, speed-time, directions, work-code, clock, other numericals

May 16-22

Logical Reasoning and Data Interpretation: Verbal reasoning - deriving conclusion from passage, conclusions as in puzzles (can be in mathematical logic also), deriving conclusion from graphs, pie/bar charts, sequence and series etc.

May 23-29

Discrete Mathematics: Mathematical Logic: Propositional Logic; First Order Logic. (including puzzles from Rosen)

Webpage for Mathematical Logic Materials

May 30-June 5

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

Webpage for Set Theory & Algebra

June 6-12

BREAK for revision. Some skill training for Masters - 2016 admission takers can participate. Includes basic training for

- Latex
- Shell commands
- Text file processing
- Graph plotting
- ...

June 13-19

Linear Algebra: Matrices, determinants, systems of linear equations, Eigen values and Eigen vectors, LU decomposition.

June 20 - June - 26

Discrete Mathematics: Combinations; Counting; generating functions; recurrence relations.

June 27-July 3

Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

July 4-10

Programming and Data Structures: Programming in C. Recursion

(includes writing simple C code like for checking if a machine is little endian)

July 11-17

Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps,graphs

July 18-24

Discrete Mathematics: Graph Theory: Connectivity; Matching, Colouring.

July 25-31

Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.

August 1-7

Algorithms: Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.

best, average case analysis;, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

August 8-14

Algorithms: Graph search, minimum spanning trees, shortest paths.

August 15-21

BREAK for revision.

August 22-28

Theory of Computation: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.

Webpage for Theory of Computation

August 29 - September 4

Digital Logic: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

September 5-11

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling,

September 12-18

Operating System: Memory management and virtual memory, File systems.

I/O systems, Protection and security.

September 19 - September 25

Databases: ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.

September 26-October 2

Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

target code generation,

October 3-9

Break for Revision

October 10-16

Computer Organization and Architecture: Machine instructions and addressing modes, ALU, data‐path and control unit, Instruction pipelining, Memory hierarchy: Cache and main memory, Secondary storage, I/O interface (Interrupt and DMA mode).

October 17-23

Computer Networks: Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).

October 24-30

Computer Networks: Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.