GATE Syllabus – Computer Science Engineering

(CSE)
CSE stands for Computer Science Engineering. This field deals with
implementation, designing and management of information system of both
software and hardware processes. GATE Syllabus for CSE with important
topics is tabulated below:

Programming and Data Structures Algorithms

 Recursive Programs  Algorithm Analysis
 Trees and Graphs  Heap Trees
 Trees  Sorting and Graph Algorithm
 Stacks  Searching and Sorting Algorithm
 Queues Trees  Dynamic Programming Algorithm
 Recursive Functions  Divide and Conquer
 Pointers  Greedy Algorithm

Operating Systems Digital Logic

 Combinational Circuits:
 CPU Scheduling Algorithms
Multiplexer, Decoder and De-
 Paging
Multiplexer
 Semaphores
 Combinational Circuits
 Page Replacement Algorithm
 Minimizational Circuits
 Deadlock
 Sequential Circuits
 Disk Scheduling Algorithm
 Minimization and Counters
 Page Replacement
 Number System
 Segmentation
 Fixed and Floating Point Registers

Computer Organization & Architecture Databases

 Pipelining
 Cache Organization
 Addressing Modes
 Machine Cycles
 I/O Data Transfer
 Relational Algebra
 Relational Algebra
 Normalization
 SQL/ SQL Queries
 Tuple Calculus
 Transactions
 Serializability

Computer Network Theory of Computation

 IP Addressing  DFA
 Routing Algorithms
 TCP and UDP
 Application Protocols
 Ethernet
 Congestion Control
 Encyption and Decryption
Algorithms
 CFL and DCFL
 Regular Languages
 Regular Expressions
 Undecidability
 Closure Properties
 Formal Grammars
 CNF