GATE Computer Science Engineering Syllabus 2020

GATE Computer Science Engineering Syllabus

GATE Computer Science Engineering Syllabus 2021: The syllabus has great importance to prepare any kind of exam. To prepare for the GATE Computer Science and Information Technology exam you should know the latest CSE Syllabus and marking scheme. The latest GATE Syllabus for Computer Science and Information Technology lets you know the important chapters and concepts to be covered in all subjects.

In the depth knowledge in every topic of Computer Science and Information Technology will also helpful to crack the exam.

Here we are providing you the complete guide on GATE Computer Science and Information Technology Syllabus 2021 and Marking Scheme.

GATE Computer Science and Information Technology Syllabus 2021

With the latest Computer Science and Information Technology Syllabus, you can create a solid study plan and score a better mark in GATE CS and IT exam. Based on the score in a GATE CS and IT, you can shape your career in the proper way.

You must have Computer Science books & study materials, Previous years questions paper along with the latest Computer Science Syllabus to enhance your semester exam preparation,

Check the latest GATE Computer Science and Information Technology Syllabus below.

Engineering Mathematics

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

Computer Science and Information Technology

  • Section 1- Digital Logic: Boolean algebra, Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
  • Section 2- Computer Organization and Architecture: 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).
  • Section 3- Programming and Data Structures: Programming in C, Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
  • Section 4- Algorithms: 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.
  • Section 5- Theory of Computation: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.
  • Section 6- Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
  • Section 7- Operating System: Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
  • Section 8- Databases: 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.
  • Section 9- Computer Networks: 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 Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

Download the latest GATE CS and IT Syllabus PDF from below.

GATE Computer Science Exam Pattern 2021

Check Latest GATE exam pattern and understand the type of questions and marking.



Exam Duration

Three hours

Mode of examination

Computer-based test

Question type

Objective type and Numerical Answer Type (NAT)

Total no. of questions


Full marks



Aptitude Engineering, Mathematics, Subject-specific questions

Marking Scheme

One mark MCQs – 1/3 score will be reduced for every incorrect response.

Two mark MCQs – 2/3 mark will be reduced for every incorrect answer.

No marks will be deducted for unattempted questions

No negative marking for Numerical Answer Type (NAT) questions

GATE 2021 Important Dates:



Release of GATE 2021 application form

August 31, 2021

GATE 2021 Exam

February 1, 2, 8 and 9, 2021

Result of GATE 2021

March 16, 2021

Books Recommended for GATE 2021 CS and IT Exam

You can take the help of the following books to prepare for the GATE 2021 CS and IT exam. Find the list of recommended books for CS and IT exam below:


Name of the Book



Discrete Mathematics and Its Applications

Kenneth Rosen


Computer Networking: A Top-Down Approach

Kurose & Ross


Computer Organization and Embedded systems

Carl Hamacher


Database System Concepts



Compilers: Principles, Techniques and Tools

Aho & Ullman


Software Engineering: A Practitioner’s Approach



The C Programming language

Dennis Richie


Introduction to Algorithms



Digital Design

Morris Mano


An Introduction to Formal Languages and Automata

Peter Linz

Here we have covered GATE Computer Science and Engineering Syllabus 2021. If you have any doubts related to GATE Computer Engineering Syllabus, please ask us in the comment section.

Leave a Comment