GATE CSE syllabus and exam pattern

GATE CSE exam pattern at a glance

The paper uses three formats. MCQs have one correct option out of four. MSQs have one or more correct options, and you must pick all of them with no wrong one to get credit. NAT questions ask you to type a number using the on screen keypad. Only MCQs carry negative marks; MSQs and NATs do not.

In recent cycles the CS paper has been held in more than one session because of the number of candidates, and marks are then normalised across sessions. The GATE CSE exam pattern for your year is confirmed in the information brochure on the organising institute's website.

The 15 mark aptitude section

• Verbal aptitude: grammar, vocabulary, reading and verbal deduction
• Quantitative aptitude: data interpretation, ratios, percentages, simple statistics, numbers and basic mensuration
• Analytical aptitude: logical reasoning, inductive and deductive thinking, analogies and number based relations
• Spatial aptitude: rotating and mirroring figures, folding and cutting paper, and 2D or 3D shape patterns

These 15 marks are among the easiest in the paper. A few weeks of light practice is usually enough. The same section appears in every GATE paper, so material for the GATE aptitude syllabus applies here too.

Engineering mathematics for the CS paper

• Discrete mathematics: propositional and first order logic, sets, relations, functions, partial orders and lattices, monoids and groups, graphs (connectivity, matching, colouring), combinatorics including counting, recurrence relations and generating functions
• Linear algebra: matrices, determinants, systems of linear equations, eigenvalues and eigenvectors, LU decomposition
• Calculus: limits, continuity, differentiability, maxima and minima, mean value theorem, integration
• Probability and statistics: random variables, uniform, normal, exponential, Poisson and binomial distributions, mean, median, mode, standard deviation, conditional probability and Bayes theorem

Core subjects: hardware and programming side

Digital Logic

Boolean algebra, design and analysis of combinational and sequential circuits, minimisation (algebraic, Karnaugh map and tabular methods), number representations and computer arithmetic in fixed and floating point.

Computer Organisation and Architecture

Machine instructions and addressing modes, ALU design, hardwired and microprogrammed control units, instruction pipelining and pipeline hazards, memory interfacing and the memory hierarchy with cache mapping, and I/O through interrupts and DMA. Reports on the revised list say secondary storage is no longer named.

Programming and Data Structures

Programming in C, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps and graphs.

Algorithms

Searching, sorting and hashing, asymptotic worst case time and space complexity, greedy, dynamic programming and divide and conquer techniques, graph traversals, minimum spanning trees and shortest paths.

Core subjects: theory, systems and networks

Theory of Computation

Regular expressions and finite automata, context free grammars and push down automata, regular and context free languages and the pumping lemma, Turing machines and undecidability.

Compiler Design

Lexical analysis, parsing, syntax directed translation, runtime environments, intermediate code generation, local optimisation, and data flow analyses such as constant propagation, liveness analysis and common subexpression elimination.

Operating System

System calls, processes, threads, inter process communication, concurrency and synchronisation, deadlock, CPU and I/O scheduling, memory management and virtual memory, and file systems.

Databases

ER model, the relational model (relational algebra, tuple calculus, SQL), integrity constraints, normal forms, file organisation, indexing with B and B+ trees, transactions and concurrency control.

Computer Networks

Principles of layering, packet, circuit and virtual circuit switching with performance measures, the data link layer (error detection, medium access control, Ethernet), distance vector and link state routing, IPv4 with fragmentation, CIDR and NAT, TCP flow and congestion control and the socket interface, and application protocols such as DNS and HTTP. Reports say the revised list no longer names ARP, DHCP, ICMP, SMTP or FTP; older papers asked them, so confirm in the official CS PDF before dropping them.

Ordering the GATE CSE syllabus: what to study first

Past CS papers show that marks are spread across all ten sections, so skipping a subject is risky. Still, some subjects reward early effort because they feed into others:

1. Discrete mathematics and data structures, which underpin algorithms and theory of computation.
2. Algorithms, operating systems and databases, which are long and heavily asked.
3. Computer organisation and digital logic, which demand numerical practice.
4. Theory of computation, networks and compiler design, which are shorter and can be finished in focused blocks.

Books and preparation sources

The standard university textbooks used in B.Tech courses for each subject are the best base, since GATE tests concepts at that level. Supplement them with the official past papers released by the organising institutes, which are the most accurate guide to depth. You can find how to use them on our GATE previous year papers page, and the scores needed in recent years on the GATE cut off page.