Government Exams > GATE CSE Syllabus

GATE  Exam Pattern & CSE Syllabus 2022, Download CSE Syllabus PDF

GATE CSE Syllabus PDF 2022: IIT Kharagpur, announced GATE 2022 Exam was conducted on 05th, 06th, 12th, and 13th February 2022. There are no major changes in the previous year’s syllabus. There are around 29 subjects and Computer Science is one among those which is chosen by around 30%-40% of students. For the students, we explained detailed exam patterns and topic-wise weightage for the GATE CSE syllabus 2022.

GATE Syllabus 2022

The Graduate Aptitude Test in Engineering (GATE), is conducted every year for engineering students. The GATE Exam is conducted once a year and a lot of engineering students appear for the GATE exam to grab master’s degrees in top colleges/universities. The competition for the GATE exam has increased so the candidates want to know the clear GATE Exam syllabus and pattern for GATE Exam 2022.

GATE Exam Highlights 2022

Highlights of the Gate Examination 2022 :

GATE 2022 Highlights
GATE Full Form Graduate Aptitude Test in Engineering
GATE 2022 Organizing Body IIT Kharagpur
Exam Level  All India Level
Mode of Exam Computer-based Test (Online)
Exam Frequency Once a year
Exam Duration 3 hours (180 minutes)
Number of Subject Papers 29 papers
Number of Questions 65
Applications Per Year More than 8 Lakhs
GATE 2022 Official Website gate.iitkgp.ac.in

GATE Syllabus for Computer Science & IT

The GATE Computer Science syllabus consists of 10 sections namely, Digital Logic, Computer Organization, Engineering Mathematics, Architecture, Programming and Data Structures, Algorithms, Theory of Computations, Compiler Design, Operating Systems, Databases, and Computer Systems. All the sections are clearly explained below for the GATE Exam 2022.

Section 1: Engineering Mathematics Syllabus

Chapters Topic
Discrete Mathematics
  1. Propositional and first-order logic
  2. Sets, relations, functions, partial orders, and lattices
  3. Monoids, Groups
  4. Graphs: connectivity, matching, coloring
  5. Combinatorics: counting, recurrence relations, generating functions
Line Graph
  1. Matrices
  2. Determinants
  3. System of linear equations
  4. Eigenvalues and Eigenvectors
  5. LU Decomposition
Calculus
  1. Limits
  2. Continuity and differentiability
  3. Maxima and minima
  4. Mean value theorem
  5. Integration
Probability & Statistics
  1. Random variables
  2. Uniform, normal, exponential, Poisson, and binomial distributions
  3. Mean, median, mode, and standard deviation
  4. Conditional probability and Bayes theorem

Section 2: Digital Logic

  1. Boolean algebra
  2. Combinational and sequential circuits
  3. Minimization
  4. Number representations and computer arithmetic (fixed and floating-point)

Section 3: Computer Organization and Architecture

  1. Machine instructions and addressing modes
  2. ALU, data path and control unit
  3. Instruction pipelining, pipeline hazards
  4. Memory hierarchy: cache, main memory, and secondary storage; I/O interface (interrupt and DMA mode)

Section 4: Programming and Data Structures

  1. Programming in C
  2. Recursion
  3. Arrays, stacks, queues, linked lists, trees, binary search trees, binary, heaps, graphs.

Section 5: Algorithms

  1. Searching, sorting, hashing
  2. Asymptotic worst-case time and space complexity
  3. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer
  4. Graph traversals, minimum spanning trees, shortest paths

Section 6: Theory of Computation

  1. Regular expressions and finite automata
  2. Context-free grammars and push-down automata
  3. Regular and context-free languages, pumping lemma
  4. Turing machines and undecidability

Section 7: Compiler Design

  1. Lexical analysis, parsing, syntax-directed translation
  2. Runtime environments
  3. Intermediate code generation
  4. Local optimization, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination

Section 8: Operating System

  1. System calls, processes, threads, inter-process communication, concurrency, and synchronization.
  2. Deadlock
  3. CPU and I/O scheduling
  4. Memory management and virtual memory
  5. File systems

Section 9: Databases

  1. ER-model
  2. Relational model: relational algebra, tuple calculus, SQL
  3. Integrity constraints, normal forms
  4. File organization, indexing (e.g., B and B+ trees)
  5. Transactions and concurrency control

Section 10: Computer Networks

  1. Concept of layering: OSI and TCP/IP Protocol Stacks
  2. Basics of the packet, circuit, and virtual circuit switching
  3. Datalink layer: framing, error detection, Medium Access Control, Ethernet bridging
  4. Routing protocols: shortest path, flooding, distance vector, and link-state routing
  5. Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT)
  6. Transport layer: flow control and congestion control, UDP, TCP, sockets
  7. Application layer protocols: DNS, SMTP, HTTP, FTP, Email
Check GATE Syllabus for other subjects

GATE Exam CSE Weightage Section-wise

The expected weightage for the CSE Subjects-wise. The weightage ar calculated by the previous year’s paper.

GATE Topic Expected Weightage in Marks
Theory of Computation 7.5
Compiler Design 2.75
Computer Organization & Architecture 9
Programming & Data Structures 10.5
Algorithms 8
Digital Logic 5.25
Operating System 9
General Aptitude 15
Computer Networks 7.5
Soft. Engg/ Web Technology 1.5
Engineering Maths 14.75
Database 7.5

GATE CSE Syllabus PDF

The candidates who choose the CSE disciplines/subjects are download cse syllabus pdf for the exam preparation.

Click to Download GATE CSE Syllabus PDF