GATE Syllabus for CSE 2027 Released - New Topics & Download PDF

Topics

Chapters

Verbal Aptitude

Basic English grammar

Basic vocabulary

Reading and comprehension, Narrative sequencing

Quantitative Aptitude

Data interpretation

Numerical computation and estimation
Mensuration and geometry, Elementary statistics and probability.

Analytical Aptitude Logic

Deduction and induction, Analogy, Numerical relations and reasoning.

Spatial Aptitude

Transformation of shapes: translation, rotation, scaling, mirroring, assembling, and grouping paper folding, cutting, and patterns in 2 and 3 dimensions.

Topics

Chapters

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 and determinants; systems of linear equations; eigenvalues and eigenvectors; and LU decomposition.

Calculus

limits, continuity, differentiability, maxima and minima, the mean value theorem, and integration.

Probability and Statistics

The topics cover random variables and probability distributions such as uniform, normal, exponential, Poisson, and binomial distributions. It also includes mean, median, mode, standard deviation, conditional probability, and Bayes’ theorem.

Topics

Chapters

Digital Logic

Boolean algebra and minimization using algebraic methods, Karnaugh maps, and tabular methods.

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.

Programming and Data Structures

The topics cover programming in C and recursion, along with data structures such as arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, and graphs.

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.

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.

Compiler Design

The topics include lexical analysis, parsing, and syntax-directed translation. It also covers runtime environments, intermediate code generation, and local optimization. Data flow analysis includes constant propagation, liveness analysis, and common subexpression elimination.

Operating System

The topics cover system calls, processes and threads, inter-process communication, concurrency and synchronization, and deadlocks. It also includes CPU and I/O scheduling, memory management, virtual memory, and file systems.

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.

Computer Networks

The topics include the principles of layering and the basics of switching, such as circuit, packet, and virtual circuit switching, along with performance measures. It also covers the data link layer, including error detection, medium access control, and Ethernet. Routing topics include distance vector and link state routing.

Subject

Marks Weightage

General Aptitude

15

Engineering Mathematics

13

Discrete Mathematics

Digital logic

6

Computer Organization and Architecture

8

Programming and Data Structure

15

Algorithms

7

Theory of Computation

6

Compiler Design

4

Operation system

9

Databases

7

Computer Networks

10

Particulars

Specifications

Exam duration

3 hours

Exam mode

Online

Sections

General Aptitude + Engineering Mathematics + Subject core

Distribution of Marks in all Papers CSE

General Aptitude: 15 marks

Engineering Mathematics: 13 marks

Subject Questions: 72 marks

Total Marks

100

Marking Scheme

Questions carry either 1 mark or 2 marks

Negative Marking

For MCQ questions, marks are deducted when the selected answer is wrong. A wrong answer in a 1-mark question results in a deduction of 1/3 mark, while 2/3 mark is deducted for a wrong answer in a 2-mark question. MSQ and NAT questions do not have negative marking. Also, MSQ questions are not given partial marks.