GATE CSE Syllabus 2021
GATE 2021 Examination will be conducted by one of the IIT’s. Candidates preparing for GATE CSE 2021 can check the Exam Pattern, GATE CSE Syllabus & Marking Scheme of the Examination. Candidates who are preparing for GATE CSE (Computer Science Engineering) have to understand the GATE CSE Syllabus before starting the Preparation. GATE Syllabus gives a better understanding of the Important Topics and Level of Examination. Generally, all the questions will be from the Syllabus provided by the GATE Officials. Candidates can also give the previous Year & Practice Mock test for preparation by doing so they will come to know about the Exam Pattern & Difficulty Level of the Examination.
This article consists of GATE Syllabus for Computer Science & Information Technology to help the candidates in Preparing for the Examination. We have listed down the Sections for GATE CSE 2021 as per the information provided by the GATE Officials and Exam Pattern.
GATE CSE Exam Pattern
The paper will have two types of Questions MCQ’s & NAT, duration of the Examination will be 03 Hours. GA & Maths consist of 30% of the weightage & rest 70% will be CS Based. Refer the table below to have an Idea of Exam pattern for GATE CSE:
|Number of Questions||65|
|Type of Questions||MCQs and NAT|
|Number of Sections||3 (General Aptitude, Engineering Mathematics and Subject Specification Section)|
GATE General Aptitude Syllabus:
GATE General Aptitude Syllabus consists of Verbal Ability and Numerical Ability. General Aptitude Section is the same for all the GATE 2021 Examination. There will be a total of 10 Questions of 1 & 2 Marks. The Verbal Ability consists of English Grammer, Vocabulary & Sentence Completion. Numerical Ability consists of Numerical Computation & Data Interpretation.
GATE CSE Syllabus
Before starting the preparation, All Candidates must go through the GATE CSE Syllabus to understand the Important Topics of Computer Science & Technology. Detailed view of sections & topics are given below.
Section 1: Engineering Mathematics
Discrete Mathematics: Propositional and the first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Linear Algebra: Matrices, determinants, the system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Section 2: Computer Science and Information Technology
Digital Logic: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and a floating point).
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)
Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
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.
Theory of Computation: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Operating System: Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.S
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.
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.
By going through the exam pattern & GATE CSE Syllabus, a candidate will get an estimate about the exam difficulty level and how to prepare for the GATE CSE Examination. A well prepared exam comprises thorough knowledge of the syllabus, previous year papers and/or mock papers. Candidates can consult the adda247 website for study material related to question papers/mock papers.