GATE Computer Science (CS/IT)

Complete guide to GATE CS syllabus, topics, and preparation strategy.

Overview

GATE CS (Computer Science and Information Technology) is one of the most competitive GATE papers, with over 100,000 candidates appearing every year. It tests knowledge across 10 core areas of computer science. A strong score (above 700) in GATE CS opens doors to M.Tech at IITs/NITs, research programs at IISc, and direct recruitment at top PSUs.

The paper consists of 65 questions worth 100 marks: 10 questions (15 marks) from General Aptitude and 55 questions (85 marks) from the CS syllabus. The exam is 3 hours long.

Syllabus by Section

Below is the complete GATE Computer Science and Information Technology syllabus with approximate marks weightage based on historical papers.

Engineering Mathematics

~13 marks
  • Discrete Mathematics: Propositional and first order logic, sets, relations, functions, partial orders, lattices, monoids, groups, graphs, trees, planarity, graph coloring
  • Linear Algebra: Matrix algebra, systems of linear equations, eigenvalues, eigenvectors
  • Calculus: Limits, continuity, differentiability, maxima and minima, mean value theorem, integration
  • Probability: Random variables, uniform, normal, exponential, Poisson distributions, conditional probability, Bayes theorem
  • Numerical Methods: LU decomposition, numerical solutions of equations

Digital Logic

~3 marks
  • Boolean algebra, minimization of Boolean functions
  • Logic gates, combinational and sequential circuits
  • Multiplexers, decoders, encoders, flip-flops
  • Latches, registers, counters, memory

Computer Organization and Architecture

~5 marks
  • Machine instructions and addressing modes
  • ALU, data-path and control unit
  • Instruction pipelining, pipeline hazards
  • Memory hierarchy: cache, main memory, secondary storage
  • I/O interface and interrupt handling
  • RISC vs CISC architecture

Programming and Data Structures

~5 marks
  • Programming in C: recursion, functions, pointers
  • Arrays, stacks, queues, linked lists
  • Trees: binary trees, BST, AVL trees, heaps
  • Graphs: BFS, DFS, spanning trees, shortest paths
  • Hashing

Algorithms

~8 marks
  • Searching, sorting, hashing
  • Asymptotic complexity, time and space analysis
  • Algorithm design: divide and conquer, greedy, dynamic programming
  • Graph algorithms: Prim, Kruskal, Dijkstra, Bellman-Ford, Floyd-Warshall
  • NP-completeness: P, NP, NP-hard, NP-complete

Theory of Computation

~5 marks
  • Regular languages: DFA, NFA, regular expressions, pumping lemma
  • Context-free languages: CFG, PDA, Chomsky Normal Form, CYK algorithm
  • Turing machines: decidability, undecidability, reducibility
  • Computability and complexity classes

Compiler Design

~5 marks
  • Lexical analysis, tokenization
  • Parsing: LL, LR, SLR, LALR parsers
  • Syntax directed definitions and translation
  • Runtime environments, symbol tables
  • Intermediate code generation, code optimization

Operating Systems

~8 marks
  • Processes, threads, interprocess communication
  • CPU scheduling algorithms: FCFS, SJF, Round Robin, Priority
  • Synchronization: semaphores, monitors, deadlocks
  • Memory management: paging, segmentation, virtual memory, page replacement
  • File systems: allocation methods, directory structure, disk scheduling

Databases

~8 marks
  • ER model, relational model, relational algebra
  • SQL: queries, views, integrity constraints, triggers
  • Normalization: 1NF, 2NF, 3NF, BCNF
  • Transactions: ACID properties, concurrency control, serializability
  • Locking, deadlock handling, recovery techniques

Computer Networks

~8 marks
  • Concept of layering: OSI and TCP/IP models
  • Physical layer: transmission media, encoding, modulation
  • Data link layer: error detection/correction, sliding window, MAC protocols
  • Network layer: IP addressing, CIDR, routing algorithms (RIP, OSPF, BGP)
  • Transport layer: TCP vs UDP, congestion control, flow control
  • Application layer: DNS, HTTP, FTP, SMTP, DHCP

Available Practice Papers

All papers below are available on Deep Prep with the full exam simulator.

GATE Computer 2025

Two sessions (Set 1 and Set 2)

2 sets available

GATE Computer 2024

Two sessions (Set 1 and Set 2)

2 sets available

GATE Computer 2023

Single session

1 set available

GATE Computer 2022

Single session

1 set available

Recommended Books

Algorithms

Introduction to Algorithms — Cormen, Leiserson, Rivest, Stein (CLRS)

Operating Systems

Operating System Concepts — Silberschatz, Galvin; Modern Operating Systems — Tanenbaum

Database Systems

Database System Concepts — Silberschatz, Korth, Sudarshan; Database Management Systems — Navathe

Computer Networks

Computer Networks — Tanenbaum; Data Communications and Networking — Forouzan

Theory of Computation

Introduction to Automata Theory — Hopcroft, Ullman; Theory of Computation — Sipser

Compiler Design

Compilers: Principles, Techniques and Tools — Aho, Lam, Sethi, Ullman (Dragon Book)

Tips for GATE Computer Science and Information Technology

  1. Algorithms and OS carry the most weight — Together they often account for 15–20 marks. Master these first.
  2. Don't skip Engineering Mathematics — It's 13 marks and many students underestimate it. Discrete math and probability are especially important.
  3. NAT questions require precise calculation — Practice numerical problems where the answer must be typed in. There is no guessing option here.
  4. GATE CS repeats patterns — After solving 5 years of papers, you will notice recurring question types in algorithms, OS scheduling, and database normalization.
  5. Time allocation matters — Spend roughly 30 minutes on General Aptitude and 150 minutes on the CS section. Don't get stuck on a single hard question.