# GATE 2022 – IIT Kharagpur

In this article we are sharing the syllabus of GATE 2022 Computer Science Engineering syllabus by IIT Kharagpur . All Computer Science and allied engineering branches candidates who want to appear in GATE 2022 with GATE 2022 Paper Code ‘CS’ must download this syllabus before starting preparation.

## IIT IIT Kharagpur : GATE 2022 Syllabus – Computer Science Engineering (CS)

GATE 2022 will be conducted by IIT Kharagpur . IIT Kharagpur tentative syllabus and paper pattern for GATE 2022 Computer Science Engineering is available in this post. Kindly read full article, download the GATE 2022 syllabus PDF and share this article with your friends.

Paper Sections Marks Distribution
Subject Questions 70% of the total marks.
Engineering Mathemetics 15% of the total marks.
General Aptitude 15% of the total marks. 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.
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 searchtrees, 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. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Lexical analysis, parsing, syntax-directed 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 Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.