GATE Syllabus for CSE (Computer Science Engineering): 

Download Free PDF

GATE CSE syllabus will help the aspirants in knowing about the topics to study for GATE 2022. Candidates planning to appear in the exam next year should analyze GATE computer science syllabus. The link to download the GATE CSE Syllabus PDF is available on this page below. GATE 2022 CSE syllabus is not available as of now. But candidates can refer to the previous year's syllabus to start the preparation.

The GATE syllabus for CSE is based out on the undergraduate engineering course. GATE 2022 CS and IT paper will consist of questions from aptitude and the subject (CS and IT) further divided into sections: Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating System, Databases, and Computer Networks. Apart from the syllabus, candidates should also check the GATE exam pattern as it will help them in making the GATE preparation strategy. The detailed information about topics and chapters included in the GATE CSE syllabus is given below. 

GATE 2022 Syllabus for CSE (Computer Science Engineering)

GATE 2022 syllabus for CSE is yet to be released by the exam conducting authority. Candidates can check the syllabus of the previous year below.

Section 1: 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, the 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.

Section 2: Digital Logic

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

Section 3: 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 4: Programming and Data Structures

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

Section 5: 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, and shortest paths.

Section 6: 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 7: Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

Section 8: Operating System

Processes, threads, inter?process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

Section 9: 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 10: 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.

Pdf :- Coming Soon 

GATE Exam Highlights

Particulars	Details
Exam Duration	Three hours
Mode of examination	Computer-based test
Question type	Objective type and Numerical Answer Type (NAT)
Number of questions	65
Total marks	100
Sections	Aptitude Engineering Mathematics Subject-specific questions
Marking Scheme	1 mark MCQs – 1/3 mark will be deducted  for every wrong answer. 2 mark MCQs – 2/3 mark will be deducted for  every wrong response. Zero marks will be awarded for unattempted  questions No negative marking will be done  for Numerical Answer Type (NAT) questions
Sectional Time-Limit	No