GATE-CS

22 September 2018 11:04

• Section1: Engineering Mathematics

○ 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.
• 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.
○ 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.

GOALS Page 1
 ○ 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 contex-free languages, pumping lemma.
○ Turing machines and undecidability.
• 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.
○ Deadlock.
○ 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.
• 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.

Syllabus and Best Books for GATE CSE

Sections in GATE Important Topics Book Name and Author’s Name
Syllabus

GOALS Page 2
Syllabus
Engineering Matrix Determinant Discrete Mathematics and Its
Mathematics Eigenvalues Applications by Kenneth Rosen
Propositional Logic and Higher Engineering mathematics
Predicate Logic by B.S. Grewal
Conditional Probability Advanced Engineering
Relations Mathematics by Erwin Kreyszig
Digital Logic Combinational Circuits : Digital Design by Morris Mano
Multiplexers, De-multiplexers
and Decoders Digital Electronics by S.
Sequential Circuits : Counters Salivahanan & S. Arivazhagan
Logic Gates
Number System
Minimization of Boolean
Expressions
Computer Cache Organization Computer Architecture – A
Organization and Pipelining Quantitative Approach by
Architecture I/O Data Transfer Hennessy and Patterson
Addressing Modes
Number Representation Computer Organization and
Embedded systems by Carl
Hamacher
Programming and Recursive Programs The C Programming language by
Data Structures Stacks Dennis Richie
Queue
Trees Classic Data Structures by Debasis
Graphs Samanta
Algorithms Algorithm Analysis Introduction to Algorithms by
Sorting Algorithms Cormen
Heaps
Graph Algorithms Data Structures & Algorithms by
Divide and Conquer & Greedy R.S. Salaria
Algorithms
Theory of DFA An Introduction to Formal
Computation Regular Expressions Languages and Automata by Peter
Regular Languages Linz
Closure Properties
Undecidability NPTEL lectures by Kamala
Krithivasan
Compiler Design LR Parsers Compilers: Principles, Techniques
LL(1) Parser and Tools by Aho & Ullman
Predictive Parser
Minimum no of nodes and Compiler Design in C by Allen I
edges in DAG Holub
GOALS Page 3
 edges in DAG Holub
Intermediate code
Generation & its purpose
Operating System Synchronization Mechanisms, Operating System Concepts by
Concurrency in IPC Galvin
environment
Virtual Memory Modern Operating System by
CPU Scheduling Algorithms Andrew Tanenbaum
Techniques of Memory
Management Operating Systems by Stallings
Implementation issues of File
system design
Databases Relational Algebra Database System Concepts by
SQL Queries Henry. F. Korth
Transactions
Serializability Normalization and indexing by
Normalizations Shamkant B. Navathe
Computer Sliding Window Protocol Computer Networking: A Top-
Networks TCP/UDP Down Approach
IPV4/IPV6
Ethernet Data Communications and
Encryption and Decryption Networking by Kurose & Ross and
Algorithms Behrouz A. Forouzan

Computer Networks by Peterson &

Davie

GOALS Page 4