Gate Syllabus for Computer Science

The full explanation of Gate syllabus for CSE subject & Topic wise. Gate exams are very important for taking admission in IIT & NIT for M. Tech and recruit in PSUs for various jobs profile. Read full article of Computer Science Gate Syllabus for complete details.

Engineering Mathematics

Discrete Mathematics - Propositional and first-order logic and example. Sets theory, relations, functions and numerical, partial orders and lattices concepts. And Groups.

Graphs Theory- Connectivity, matching, colouring.

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 distributionsand question. Mean, median, mode and standard deviation, & variance. Conditional probability and Bayes theorem Concepts.

cse gate syllabus
Gate Syllabus for Computer Science Engineering

Gate Syllabus for Computer Science and Information Technology

Digital Logic / Digital Electronics

Boolean algebra.

Combinational and sequential circuits.


Number representations and computer arithmetic (fixed and floating point).

Computer Organization and Architecture

Machine instructions and addressing modes.

ALU (Arithematics Logic Units).

Datapath and control unit.

Instruction pipelining.

Memory hierarchy- cache, main memory and secondary storage

I/O(Input-Output) Interface - Interrupt and DMA (Direct Pomeroy Addressing mode).

Programming and Data Structures

Programming in C.


Arrays and Stacks

Queues, linked lists, & trees

binary search trees, binary heaps, & graphs.


Searching, sorting, hashing.

Asymptotic worst-case time and space complexity.

Algorithm design techniques- Greedy

Dynamic programming concept 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 context-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, interprocess communication, concurrency, and synchronization.

Deadlock. And CPU scheduling.

Memory management and virtual memory.

File systems.



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

The 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 System- Authentication, basics of a public key and private key cryptography Concepts, digital signatures and certificates, and firewalls.

Read More Related article click below link:-

Thank you for reading this article on Gate CSE Syllabus, Gate Syllabus for CSE.