GATE 2027 Computer Science and Information Technology Official Syllabus
Section 1: General Aptitude (Common to All Papers • 15 Marks)
Verbal, Quantitative, Analytical & Spatial Reasoning
Verbal Aptitude (English grammar, sentence completion, verbal analogies); Quantitative Aptitude (Data interpretation, numerical computation, numerical reasoning); Analytical Aptitude (Logic deduction, analogy); Spatial Aptitude (Transformations of shapes, paper folding, grouping).
Section 2: Engineering Mathematics (Core Component)
Mathematical Foundations
Discrete Mathematics (Propositional logic, predicate calculus, sets, relations, functions, partial orders, lattices, groups, graphs: connectivity, matching, coloring, combinatorics: counting, recurrence relations, generating functions); Linear Algebra (Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition); Calculus (Limits, continuity, differentiability, maxima and minima, mean value theorem, evaluation of definite and improper integrals); Probability and Statistics (Random variables, uniform, normal, exponential, Poisson, binomial distributions, mean, median, mode, standard deviation, conditional probability, Bayes theorem).
Section 3: Subject-Specific Core Syllabus (85 Marks)
Technical Domain Breakdown
Digital Logic (Boolean algebra, combinational and sequential circuits, minimization, number representations); Computer Organization and Architecture (Machine instructions and addressing modes, ALU, data-path and control unit, instruction pipelining, pipeline hazards, memory hierarchy: cache, main memory and secondary storage, I/O interface); Programming and Data Structures (Programming in C, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs); Algorithms (Searching, sorting, hashing, asymptotic worst case time and space complexity, algorithm design techniques: greedy, dynamic programming, divide-and-conquer, graph search, minimum spanning trees, shortest paths); Theory of Computation (Regular expressions and finite automata, context-free grammars and push-down automata, regular and context-free languages, pumping lemma, Turing machines, undecidability); Compiler Design (Lexical analysis, parsing, syntax-directed translation, runtime environments, intermediate code generation, local optimization, data flow analyses); Operating System (System calls, processes, threads, inter-process communication, concurrency and synchronization, deadlocks, CPU and I/O scheduling, memory management and virtual memory, file systems); Databases (ER-model, relational model: relational algebra, tuple calculus, SQL, integrity constraints, normal forms, file organization, indexing: B and B+ trees, transactions and concurrency control); Computer Networks (Concept of layering: OSI and TCP/IP protocol stacks, basics of packet, circuit and virtual circuit-switching, data link layer: framing, error detection, Medium Access Control, Ethernet bridging, routing protocols: shortest path, flooding, distance vector and link state routing, fragmentation and IP addressing: IPv4, CIDR notation, basics of IP support protocols: ARP, DHCP, ICMP, Network Address Translation, transport layer: flow control and congestion control, UDP, TCP, sockets, application layer protocols: DNS, SMTP, HTTP, FTP, Email).