Grammar, Vocabulary, CodingDecoding & Series, Directions, Blood Relations, Arrangements, Syllogism, Inference & Assumptions, Clocks and Puzzles.
Fundamentals, Equations, Percentage, Averages, Ratio & Propotions, Mixture and Alligations, Data Interpretation & Data Suffiency, Time, Speed & Distance, Time & Work, Set Theory & Venn Diagrams, Progression, Functions & Graphs, Logarthims, Permutations and Combinations, Probability, Geometry & Mensuration.
Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Machine instructions and addressing modes. ALU, data?path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide?and?conquer. Graph search, minimum spanning trees, shortest paths.
Regular expressions and finite automata. Contextfree grammars and pushdown automata. Regular and contexfree languages, pumping lemma. Turing machines and undecidability.
Lexical analysis, parsing, syntaxdirected translation. Runtime environments. Intermediate code generation.
Processes, threads, inter?process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
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.
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of WiFi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
Download  GATE 2022 CSE Syllabus (PDF)
Understanding the GATE syllabus with Subject wise weighting analysis will help the candidates set the preparation time for high score subjects. The GATE paper section for the CS & IT exam is divided into three sections and the GATE marks are divided accordingly between Core Subject, Engineering Mathematics and General Aptitude . Check Subjectwise weighting for GATE CS & IT Paper:
GATE SUBJECTS  GATE 2013  GATE 2014  GATE 2015  GATE 2016  GATE 2017  GATE 2018  GATE 2019  GATE 2020  GATE 2021 

Engineering Mathematics*  13%  23%  19%  13.75%  8%  7%  6%  5%  9% 
Discrete Mathematics & Graph Theory  9%  12.7%  11%  3.5%  7%  12%  5%  10%  8% 
Design & Analysis Algorithms  8%  8%  7.5%  10.75%  5.5%  7%  7%  6%  11% 
Programming & Data Structure  18%  13%  18%  10.75%  14.5%  10%  12%  12%  8% 
Digital Logic  3%  5%  7%  5%  5%  4%  9%  4%  5% 
Computer Organization*  11%  8%  5%  7%  9%  11%  3%  11%  6% 
Theory Of Computation  8%  6%  6%  9.25%  9.5%  7%  8%  9%  8% 
Compiler design  3%  3%  2%  3.5%  4%  6%  6%  4%  7% 
Operating Systems*  12%  7%  8%  16.5%  10%  10%  10%  10%  6% 
DBMS*  7%  8%  5%  4.75%  6%  4%  8%  8%  8% 
Computer Networks  7%  9%  8%  9%  6.5%  7%  10%  6%  9% 
General Aptitude*  15%  15%  15%  15%  15%  15%  15%  15%  15% 
Particulars  Details 

Examination Mode 
Computer Based Test (CBT) 
Duration 
3 Hours 
Number of Subjects (Papers) 
27 
Sections 
General Aptitude (GA) + Candidate’s Selected Subject 
Type of Questions 

Questions test these abilities 

Number of Questions 
10 (GA) + 55 (subject) = 65 Questions 
Distribution of Marks in all Papers EXCEPT papers AR, CY, EY, GG, MA, PH, XH and XL 
General Aptitude: 15 Marks + Engineering Mathematics: 13 Marks + Subject Questions: 72 Marks = Total: 100 Marks 
Distribution of Marks in papers AR, CY, EY, GG, MA, PH, XH and XL 
General Aptitude: 15 Marks + Subject Questions: 85 Marks = Total: 100 Marks 
Marking Scheme 
All of the questions will be of 1 mark or 2 marks 
1. Check all the Important Topics & Mark them.
2. Collect previous year GATE question paper.
3. Make study notes of most asked questions on important topics.
4. Update yourself with online study notes from the GATE syllabus.
5. Practice complex topics more & more in order to solve them easily for the exam.
6. Prepare calendar on the weekly and monthly basis to study the subjects on the priority basis.
7. Start revision of the most frequently asked topics in the syllabus before 15 days of the exam.
GATE Syllabus for CSE 2022 – Check Computer Science Syllabus Here!
Quick Links:
Every year, GATE Syllabus remains almost the same as the previous one, but there is a rare chance that GATE Syllabus will be changed. Students who would write the GATE exam must refer the GATE CS and the IT syllabus defined by IIT Bombay to start with GATE Preparation as the questions are formulated in accordance with the official GATE syllabus .
Understanding GATE syllabus prior to starting GATE preparation will help candidates effectively plan the preparation strategy and score better marks. The GATE CS and IT exam paper consists of questions from aptitude and core subjects (CS and IT).
Check the detailed information about topics from GATE CSE Paper here,