GATE Computer Science Engineering CSE Syllabus 2019 Complete GATE CSE Syllabus

GATE Entrance Examination 2019 Syllabus

The Indian Institute of Technology has released examination preparation material for Graduate Aptitude Test for Engineering. Candidates who had applied for the same and waiting for paper pattern & syllabus can check it here. Those who want to study in Computer Science & Engineering field they have to check GATE Computer Science Engineering CSE Syllabus 2019 from here. We have collected the entire and complete syllabus for CSE. Kindly check this page till the end and we are sure you will get what you want.

GATE Computer Science Engineering CSE Syllabus 2019

GATE Computer Science Engineering CSE Syllabus


Important Tips from Experts

English Preparation Rule

GK Preparation Tips

How to prepare for the exam

Section 1: Engineering Mathematics

Discrete Mathematics

Propositional and first-order logic

Sets, relations, functions, partial orders and lattices


Graphs: connectivity, matching, coloring

Combinatorics: counting, recurrence relations, generating functions

Linear Algebra: Matrices, determinants, the system of linear equations, eigenvalues and eigenvectors, LU decomposition


Limits, continuity and differentiability

Maxima and minima

Mean value theorem. Integration


Random variables

Uniform, normal, exponential, Poisson and binomial distributions

Mean, median, mode and standard deviation

Conditional probability and Bayes theorem

GATE Computer Science Engineering CSE Syllabus 2019

Section 2: Digital Logic

Boolean algebra

Combinational and sequential circuits


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


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, 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

GATE Computer Science Engineering CSE Syllabus 2019

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


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

GATE Computer Science Engineering CSE Syllabus 2019

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

Some Important Links for GATE 2019

GATE Previous Exam (Sample Paper)

Download (Subject Code Wide)

GATE 2019 Code Wise Syllabus

Click Here

Official Website

Click Here

Gate 2019 (CSE) Official Syllabus

Download Gate CSE Syllabus 2019

Want to get free job alerts to your email directly?

Leave a Reply

Your email address will not be published. Required fields are marked *