**May 15-21**

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

**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 22-28**

**Quantitative Aptitude: Ratios, speedtime, directions, workcode, clock, other numericals **

**May 29 -June 4**

**Discrete Mathematics: Mathematical Logic: Propositional Logic; First Order Logic. **

**Webpage for Mathematical Logic**

**June 5-11**

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

**Webpage for Set Theory & Algebra**

**June 12-18**

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

**June 19-25**

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

**June 26-30**

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

**--------------------------------------BREAK-------------------------------------**

**July 3-9**

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

**July 10-16**

**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**

**July 17-23**

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

**July 24-30**

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

**August 1-6**

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

**August 7-13**

**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.**

**August 14-20**

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

**August 21-27**

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

**August 28-31**

**Break for revision**

**September 1-10**

**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).**

**September 11-17**

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

**September 18-24**

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

**October 1-8**

**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 9-15**

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

**October 16-24**

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

**November for revision,solving tests**