Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE CS 2022 Syllabus

  • Last Updated : 20 Oct, 2021

In previous GATE authority has revised syllabus of GATE CS and has added few sections as you can see/analyse here.  

In this year, GATE authority did not make any change in syllabus of GATE CS 2022. It is same as syllabus of GATE CS 2021. 

IIT Kharagpur is organizing GATE 2022. There are two part of GATE CS 2022 syllabus (same as GATE CS 2021) :

  1. General Aptitude (GA) – for 15 marks
  2. Computer Science and Information Technology (CS/IT) – for 85 marks

These topics will be covered in these two parts :

1. General Aptitude (GA) – for 15 marks

  1. Verbal Aptitude Basic English grammar : 
    tenses, articles, adjectives, prepositions, conjunctions, verb-noun agreement, and other parts of speech Basic vocabulary: words, idioms, and phrases in context Reading and comprehension Narrative sequencing 
     
  2. Quantitative Aptitude Data interpretation : 
    data graphs (bar graphs, pie charts, and other graphs representing data), 2- and 3-dimensional plots, maps, and tables Numerical computation and estimation: ratios, percentages, powers, exponents and logarithms, permutations and combinations, and series Mensuration and geometry Elementary statistics and probability 
     
  3. Analytical Aptitude Logic :
    deduction and induction, Analogy, Numerical relations and reasoning
     
  4. Spatial Aptitude Transformation of shapes :
    translation, rotation, scaling, mirroring, assembling, and grouping Paper folding, cutting, and patterns in 2 and 3 dimensions

2. Computer Science and Information Technology (CS/IT) – for 85 marks

1. Engineering Mathematics :

  1. Discrete Mathematics –
    Propositional and first order logic. 
    Sets, relations, functions, partial orders and lattices. Monoids, Groups. 
    Graphs: connectivity, matching, coloring. 
    Combinatorics: counting, recurrence relations, generating functions. 
     
  2. Linear Algebra –
    Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
     
  3. Calculus –
    Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
     
  4. Probability and Statistics –
    Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

2. Digital Logic :

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

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;
  5. I/O interface (interrupt and DMA mode).

4. Programming and Data Structures :

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

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

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.

7. Compiler Design :

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

8. Operating System :

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

9. Databases :

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

10. Computer Networks :

  1. Concept of layering: OSI and TCP/IP Protocol Stacks;
  2. Basics of packet, circuit and virtual circuit switching;
  3. Data link 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,
  6. Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT);
  7. Transport layer: flow control and congestion control, UDP, TCP, sockets;
  8. Application layer protocols: DNS, SMTP, HTTP, FTP, Email.

Important Note –  You can learn these concept for free as listed here by GeeksforGeeks. You can also access previous years solved papers/quizzes. For the last minute notes, you can read/lean here for free.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!