GATE CS 2027: syllabus and marking scheme
Computer Science and Information Technology (paper code CS)
The official GATE 2027 syllabus, paper CS (IIT Madras) lists 13 syllabus lines in 10 sections, shown below in the exact official wording. The exam lasts 3 hours. Multiple choice: a wrong answer costs 1/3 of the marks of that question; an unanswered question scores 0.
Pattern and marking
| Section | Questions | Type | Marking |
|---|---|---|---|
| General Aptitude (1 mark) | 5 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| General Aptitude (2 marks) | 5 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| Subject including Engineering Mathematics where present (1 mark) | 25 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| Subject including Engineering Mathematics where present (2 marks) | 30 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
More verified facts
- Duration: 3 hours (180 minutes).
- Total marks: 100.
- Language of the paper: English.
- Calculator: on-screen virtual scientific calculator; physical calculators are prohibited in the hall.
- Numerical answers: on-screen virtual numeric keypad for NAT answers (the computer keyboard is disabled); the answer is a signed real number, an integer or with up to three decimals, and the question states the decimal places required; no options are shown.
- Multiple choice: a wrong answer costs 1/3 of the marks of that question; an unanswered question scores 0.
- Multiple select: no negative marking and no partial marks.
- Numerical answer type: no negative marking.
Pattern source: GATE 2027 Information Brochure, revised version dated 17 October 2026 (IIT Madras) (official document). Last checked 2026-11-21. Every pattern fact above cites a section of that document in our data. The split of the subject questions into 25 one-mark and 30 two-mark questions is worked out from the stated totals (55 questions carrying 85 marks), not quoted.
Official syllabus lines (2027)
Copied from GATE 2027 syllabus, paper CS (IIT Madras), read on 2026-11-20. Each line is shown unchanged.
Section 1: Engineering Mathematics
- Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs: connectivity, matching, colouring. Combinatorics: counting, recurrence relations, generating functions.
- Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
- Calculus: Limits, continuity and differentiability, Maxima and minima, Mean value theorem, Integration.
- Probability and Statistics: Random variables, Uniform, normal, exponential, Poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Section 2: Digital Logic
- Boolean algebra and minimization – algebraic technique, Karnaugh map, tabular method. Design of combinational and sequential circuits. Number representation and arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
- Instruction set and addressing modes. Design of arithmetic and logic unit (ALU). Design of control unit – hardwired and microprogrammed. Memory interfacing and hierarchy: performance, cache memory mapping. I/O interface (interrupt and DMA). Instruction pipelining, pipeline hazards.
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 and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths.
Section 6: 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.
Section 7: Compiler Design
- Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common sub expression elimination.
Section 8: Operating System
- System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.
Section 9: 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.
Section 10: Computer Networks
- Principles of Layering; Basics of switching (circuit, packet and virtual circuit) and performance metrics; Data link layer: error detection, Medium Access Control, Ethernet; Distance vector and link state routing; IPv4 - Fragmentation, CIDR Notation, Network Address Translation; TCP- flow control and congestion control, socket API; DNS and HTTP.
What is next
Question pages, topic notes and practice sets for this exam are being prepared on the same syllabus graph as JEE Main. Until a question has passed our checks it is not shown as verified.