| Data Structures & Algorithms | Arrays, linked lists, trees (BST, AVL, heap), graphs, sorting, searching, hashing, complexity analysis, DP, greedy |
| Theory of Computation | Finite automata, regular languages, context-free grammars, PDAs, Turing machines, decidability, complexity classes |
| Operating Systems | Processes, threads, scheduling, memory management (paging, segmentation), virtual memory, file systems, deadlocks |
| Database Systems | ER model, relational algebra, SQL, normalisation (1NF to BCNF), B+ trees, transactions, concurrency control, recovery |
| Computer Networks | OSI/TCP-IP model, routing, switching, IP addressing, subnetting, transport protocols, DNS, HTTP, network security |
| Computer Organisation | ISA, CPU design, pipelining, cache memory hierarchy, memory organisation, I/O systems, interrupts |
| Digital Logic | Boolean algebra, combinational circuits, sequential circuits, minimisation, number representations |
| Compiler Design | Lexical analysis, parsing (LL, LR), semantic analysis, intermediate code, code optimisation, code generation |
| Aptitude — Part B | Numerical, logical, abstract and diagrammatic reasoning — 15 questions |