Through this article, you’ll get a complete understanding about the GATE exam. You’ll learn about the **GATE eligibility criteria, syllabus, weightage of subjects, the paper pattern and reference books**. We’ll also tell you how to get access to Free Test Series and Online Coaching. So keep reading!

### GATE CSE (Computer Science) Exam 2022 Syllabus, Subjects, Weightage, Paper Pattern, Reference Books, Free Test Series, Online Coaching

## All Information About GATE CSE

The GATE (Graduate Aptitude Test in Engineering) is an All India level exam conducted by IISc-Bangalore and the Seven old IITs i.e. IIT Roorkee, IIT Delhi, IIT Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras and IIT Bombay. It’s goal is to test the technical aptitude of engineers. GATE 2022 is being conducted by IIT Kharagpur.

The exam is a computer based online exam. It is conducted on the second or third weekend of February each year across multiple cities and candidates will either take the paper in the forenoon (9:30 am – 12:30 pm) slot or in the afternoon (2:30 pm – 5:30 pm) slot. Once a student takes the GATE, their score is valid for 3 years.

## GATE CSE Syllabus Weightage 2022

### GATE CSE (Coumputer Science) Branch Syllabus 2022 - Exam subjects and subjectwise wightage

The GATE syllabus is a combination of the subjects taught in the third and final year of engineering. The detailed syllabus and weightage of each subject is as under:

### Section 1: Engineering Mathematics

**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.

**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 and Statistics:**

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, pipeline hazards. 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 traversals, minimum spanning trees, shortest paths

### Section 6: 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.

### Section 7: Compiler Design

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

### Section 8: Operating System

System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O 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: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuitswitching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.