12 weeks to the exam

Study plan

One subject at a time in the order that builds on itself, a subject test at the end of each week, then full mocks once the syllabus is done. Tick items off as you go; your ticks stay in this browser.

1. WEEK 01

   Discrete mathematics

   Logic, sets and graphs show up in almost every paper and feed into TOC and algorithms later.

   • Propositional and first order logic
   • Sets, relations, functions, partial orders and lattices
   • Monoids and groups
   • Graph theory
   • Combinatorics
2. WEEK 02

   Linear algebra, calculus, probability, digital logic

   Quick marks if the formulas are automatic. Finish Engineering Mathematics and all of Digital Logic.

   • Linear algebra
   • Calculus
   • Probability and statistics
   • Boolean algebra and minimization
   • Combinational circuits
   • Sequential circuits
   • Number representation and arithmetic
   • Engineering Mathematics test, Set A
   • Digital Logic test, Set A
3. WEEK 03

   Programming and data structures

   C output tracing and tree/heap questions are high-frequency and need practice, not just reading.

   • Programming in C
   • Recursion
   • Arrays, stacks and queues
   • Linked lists
   • Trees and binary search trees
   • Binary heaps
   • Graphs as a data structure
   • Programming and DS test, Set A
4. WEEK 04

   Algorithms

   The largest single subject by marks in most recent papers.

   • Asymptotic complexity
   • Searching and sorting
   • Hashing
   • Greedy algorithms
   • Dynamic programming
   • Divide and conquer
   • Graph traversals, MST and shortest paths
   • Algorithms test, Set A
5. WEEK 05

   Computer organization

   Cache and pipeline numericals reward a fixed method; learn it once and drill it.

   • Instruction set and addressing modes
   • ALU and control unit design
   • Memory hierarchy and cache
   • I/O interface: interrupts and DMA
   • Instruction pipelining and hazards
   • Computer Organization test, Set A
6. WEEK 06

   Operating systems

   Scheduling, paging and synchronization are near-certain questions.

   • System calls, processes and threads
   • Concurrency and synchronization
   • Deadlock
   • CPU and I/O scheduling
   • Memory management and virtual memory
   • File systems
   • Operating Systems test, Set A
   • Full mock 1 (3 hours, then review every wrong answer)
7. WEEK 07

   Theory of computation

   Short, scoring questions once closure and decidability facts are memorised.

   • Regular expressions and finite automata
   • Context-free grammars and PDAs
   • Pumping lemma and closure properties
   • Turing machines and undecidability
   • Theory of Computation test, Set A
   • Full mock 2 (3 hours, then review every wrong answer)
8. WEEK 08

   Databases

   Normalization and SQL output questions are mechanical with practice.

   • ER model
   • Relational algebra and tuple calculus
   • SQL
   • Integrity constraints and normal forms
   • File organization and indexing
   • Transactions and concurrency control
   • Databases test, Set A
   • Full mock 3 (3 hours, then review every wrong answer)
9. WEEK 09

   Computer networks

   Mostly numericals: subnetting, sliding window, TCP windows, CRC.

   • Layering, switching and performance
   • Data link layer
   • Routing
   • IPv4
   • TCP and sockets
   • DNS and HTTP
   • Computer Networks test, Set A
   • Full mock 4 (3 hours, then review every wrong answer)
10. WEEK 10

    Compiler design, then mocks

    The smallest subject. Finish it, then switch to full mocks.

    • Lexical analysis
    • Parsing
    • Syntax-directed translation
    • Runtime environments
    • Intermediate code generation
    • Local optimisation and data flow analysis
    • Compiler Design test, Set A
    • Full mock 5 (3 hours, then review every wrong answer)
    • Full mock 6 (3 hours, then review every wrong answer)
    • Full mock 7 (3 hours, then review every wrong answer)
11. WEEK 11

    Revision and Set B tests

    Fix weak subjects using your mock results. Read every formula sheet once.

    • Engineering Mathematics formula sheet
    • Digital Logic formula sheet
    • Computer Organization and Architecture formula sheet
    • Programming and Data Structures formula sheet
    • Algorithms formula sheet
    • Theory of Computation formula sheet
    • Compiler Design formula sheet
    • Operating Systems formula sheet
    • Databases formula sheet
    • Computer Networks formula sheet
    • Engineering Mathematics test, Set B
    • Digital Logic test, Set B
    • Computer Organization and Architecture test, Set B
    • Programming and Data Structures test, Set B
    • Algorithms test, Set B
    • Theory of Computation test, Set B
    • Compiler Design test, Set B
    • Operating Systems test, Set B
    • Databases test, Set B
    • Computer Networks test, Set B
    • Full mock 8 (3 hours, then review every wrong answer)
    • Full mock 9 (3 hours, then review every wrong answer)
    • Full mock 10 (3 hours, then review every wrong answer)
12. WEEK 12

    Final mocks

    Exam conditions: same start time as your session, calculator only, no breaks. Keep the last two days light.

    • Full mock 11 (3 hours, then review every wrong answer)
    • Full mock 12 (3 hours, then review every wrong answer)
    • Full mock 13 (3 hours, then review every wrong answer)
    • Full mock 14 (3 hours, then review every wrong answer)
    • Full mock 15 (3 hours, then review every wrong answer)
    • Full mock 16 (3 hours, then review every wrong answer)