GATE 2025 Syllabus - Computer Science

Study Notes

Computer Science and Information Technology - GATE 2025 Syllabus

Section 1: Engineering Mathematics
- Discrete Mathematics: Propositional logic, first-order logic, sets, relations, functions, partial orders, lattices, monoids, groups, graphs (connectivity, matching, colouring), combinatorics (counting, recurrence relations, generating functions).
- Linear Algebra: Matrices, determinants, systems of linear equations, eigenvalues, eigenvectors, LU decomposition.
- Calculus: Limits, continuity, differentiability, maxima/minima, Mean Value Theorem, integration.
- Probability and Statistics: Random variables, uniform, normal, exponential, Poisson, binomial distributions, mean, median, mode, standard deviation, conditional probability, Bayes' theorem.
Section 2: Digital Logic
- Boolean algebra, combinational and sequential circuits, minimization, number representations, computer arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
- Machine instructions, addressing modes, ALU, data-path, control unit, instruction pipelining, pipeline hazards, memory hierarchy (cache, main memory, secondary storage), I/O interface (interrupt and DMA mode).
Section 4: Programming and Data Structures
- Programming in C, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Section 5: Algorithms
- Searching, sorting, hashing, asymptotic worst-case time and space complexity, algorithm design techniques (greedy, dynamic programming, divide-and-conquer), graph traversals, minimum spanning trees, shortest paths.
Section 6: Theory of Computation
- Regular expressions, finite automata, context-free grammars, push-down automata, regular and context-free languages, pumping lemma, Turing machines, undecidability.
Section 7: Compiler Design
- Lexical analysis, parsing, syntax-directed translation, runtime environments, intermediate code generation, local optimization, data flow analyses (constant propagation, liveness analysis, common subexpression elimination).
Section 8: Operating System
- System calls, processes, threads, inter-process communication, concurrency, synchronization, deadlock, CPU and I/O scheduling, memory management, virtual memory, file systems.
Section 9: Databases
- ER-model, relational model, relational algebra, tuple calculus, SQL, integrity constraints, normal forms, file organization, indexing (B, B+ trees), transactions, concurrency control.
Section 10: Computer Networks
- Layering (OSI and TCP/IP), packet, circuit, and virtual circuit switching, data link layer (framing, error detection, MAC, Ethernet bridging), routing protocols (shortest path, flooding, distance vector, link state), fragmentation, IP addressing (IPv4, CIDR), IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT), transport layer (flow control, congestion control, UDP, TCP, sockets), application layer protocols (DNS, SMTP, HTTP, FTP, email).