GATE 2017 Syllabus 
Learn 
Practice 
External Resources 
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.

Discrete Mathematics:
Set Theory  Introduction
Set Theory  Set Operations
Proposition Logic  Introduction
Propositional Equivalence
Predicates and Quantifiers
Combinatorics:
Recurrence relations
Pigeonhole Principle
Linear Algebra:
Eigen Values and Eigen Vectors
L U Decomposition
Calculus:
Lagrange’s Mean Value Theorem
Mean Value Theorem  Rolle’s Theorem
Probability:
Random Variables
Mean Variance And Standard Deviation
Conditional Probability
Bayes’s formula for Conditional Probability

Set Theory & Algebra
Linear Algebra
Numerical Methods and Calculus
Graph Theory
Combinatorics
Propositional and First Order Logic

Set theory,Algebra,Mathematical Logic
Book PDFSchaum’s
Graph Theory
Video LecturesIISC Banglore
Lecture NotesMIT

Section 2: Digital Logic
Boolean algebra.
Combinational and sequential circuits.
Minimization.
Number representations and computer arithmetic (fixed and floating point).

Half Adder
Half Subtractor
KMap
Counters
Last Minute Notes

Digital Logic & Number representation(28)

Video LecturesNPTEL
NotesNumber SystemSwarthmore

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

Machine Instructions
Addressing Modes
Cache Memory
Cache Organization  Introduction
Computer Arithmetic  Set – 1
Computer Arithmetic  Set – 2
Pipelining  Set 1 (Execution, Stages and Throughput)
Pipelining  Set 2 (Dependencies and Data Hazard)
Pipelining  Set 3 (Types and Stalling)

Computer Organization and Architecture(33) 
Book PDF Carl Hamacher
Book PDFMorris Mano 
Section 4: Programming and Data Structures
Programming in C.
Recursion.
Arrays,
stacks,
queues,
linked lists,
trees,
binary search trees,
binary heaps,
graphs.

C Programming
Recursion
Recursive functions
Tail Recursion
Arrays
Stack
Queue
Linked List
Binary Tree
Binary Search Tree
Binary Heap
Graph

C Language
Recursion
Linked List
Stack
Queue
Binary Trees
Tree Traversals
Binary Search Trees
Balanced Binary Search Trees
Array
Heap
Graph
Graph Traversals
B and B+ Trees
Misc
Data Structures and Algorithm

Video lecturesIITD
Book Introduction to Algorithms by Cormen, Thomas H. 
Section 5: Algorithms
Searching,
sorting,
hashing.
Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy,
dynamic programming and divideand‐conquer.
Graph search,
minimum spanning trees,
shortest paths. 
Searching and Sorting
Hashing
Analysis of Algorithms
Greedy Algorithms
Dynamic Programming
Divide and Conquer
Graph Algorithms (Search Algorithms)
Minimum Spanning Tree:
Prims Minimum Spanning tree
Prims Minimum Spanning Tree for adjacency list representation
Kruskals Minimum Spanning tree
Shortest Paths:
Dijikstras Shortest Path Algorithm
Dijkstra’s Algorithm for Adjacency List Representation
Bellman–Ford Algorithm
Floyd Warshall Algorithm
Shortest Path in Directed Acyclic Graph
Shortest path with exactly k edges in a directed and weighted graph

Searching
Sorting
Hash
Analysis of Algorithms
Analysis of Algorithms (Recurrences)
Divide and Conquer
Greedy Algorithms
Dynamic Programming
Backtracking
Graph Shortest Paths
Graph Minimum Spanning Tree
NP Complete
Misc
Data Structures and Algorithm

Video lecturesIITD
Book Introduction to Algorithms by Cormen, Thomas H. 
Section 6: Theory of Computation
Regular expressions and finite automata.
Contextfree grammars and pushdown automata.
Regular and contexfree languages,
pumping lemma.
Turing machines and undecidability.

Finite Automata  Introduction
Chomsky Hierarchy
Pumping Lemma
Designing Finite Automata from Regular Expression
Regular Expressions, Regular Grammar and
Regular Languages
Pushdown Automata
Closure Properties of Context Free Languages
Conversion from NFA to DFA
Minimization of DFA
Mealy and Moore Machines
Decidability
Turing Machine
Ambiguity in CFG and CFL
Simplifying Context Free Grammars
Recursive and Recursive Enumerable Languages
Undecidability and Reducibility
Last Minute Notes

Regular languages and finite automata
Context free languages and Pushdown automata
Recursively enumerable sets and Turing machines
Undecidability
Automata Theory

Web ResourceArsDigita University
Sample Problems and SolutionsLoyola Univ 
Section 7: Compiler Design
Lexical analysis,
parsing,
syntaxdirected translation.
Runtime environments.
Intermediate code generation.

Lexical Analysis
Introduction to Syntax Analysis
Syntax Directed Translation
Runtime Environments
Classification of Context Free Grammars
Ambiguous Grammar
Why FIRST and FOLLOW?
FIRST Set in Syntax Analysis
FOLLOW Set in Syntax Analysis

Lexical analysis
Parsing and Syntax directed translation
Code Generation and Optimization
Compiler Design 
Lecture SlidesStanford
BookAho and Ullman
Dragon Book Lecture Notes
Video LecturesStanford

Section 8: Operating System
Processes,
threads,
interprocess communication,
concurrency and synchronization.
Deadlock. CPU scheduling.
Memory management and virtual memory.
File systems.

Process Management Introduction
Process Scheduling
Process scheduler
Disk Scheduling
Process Synchronization Introduction
Process Synchronization  Monitors
Deadlock  Introduction
Deadlock Prevention And Avoidance
Deadlock Detection And Recovery
Memory Management  Partition Allocation Method
Page Replacement Algorithm
User Thread VS Kernel Thread
Multi threading Model
Fork System Call
Paging
Segmentation
Banker’s Algorithm
ReadersWriters Problem  Set 1 (Introduction and
Readers Preference Solution)
Difference between Priority Inversion
and Priority Inheritance
Operating System Notes
Last Minute Notes
Commonly Asked Interview Question

Process Management
CPU Scheduling
Memory Management
Input Output Systems
Operating Systems 
Web resource VirginiaTech Univ.
Lecture Slides Silberschatz, Galvin, Gagne
Video LecturesIIT KGP
Practice Problems and SolutionsWilliam Stallings

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.

Need for DBMS
Relational Model and Algebra :
Relational ModelRelational Model Introduction and Codd Rules
Keys in Relational Model (Candidate, Super, Primary, Alternate and Foreign)
Relational AlgebraOverview
Relational AlgebraBasic Operators
Relational AlgebraExtended Operators
Normalization:
Lossless Decomposition
Dependency Preserving Decomposition
Attribute Closure/Candidate KeyFunctional Dependencies
Database Normalization  Introduction
Database  Normal Form
Equivalence of Functional Dependencies
Find the highest normal form of a relation
ER Model :
ER Model
Minimization of ER Diagram
Mapping from ER Model to Relational Model
SQL:
SQL
Inner VS Outer Join
Having Vs Where Clause
Nested Queries in SQL
Concurrency:
ACID Properties
Concurrency Control
View equal schedule
Conflict Serializability
Recoverability of Schedules
Misc:
Indexing in Databases  Set 1
How to solve Relational Algebra problems for GATE 
ER and Relational Models
Database Design (Normal Forms)
SQL
Transactions and concurrency control
Sequential files, indexing, B & B+ trees
Database Management Systems 
Lecture SlidesSilberschatz, Korth and Sudarshan
Lecture SlidesRaghu Ramakrishnan and Johannes Gehrke
Lecture SlidesStanford DBMS course
Video LecturesIIT KGP 
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 WiFi.
Network security: authentication,
basics of public key and private key cryptography,
digital signatures and certificates,
firewalls. 
Network Devices
IP Addressing  Introduction and Classful Addressing
IP Addressing  Classless Addressing
Network Layer  Introduction
Network Layer  IPv4 Datagram Fragmentation and Delay
Longest Prefix Matching in Routers
Why DNS uses UDP not TCP
Error Detection
Congestion Control
Stop and Wait ARQ
Sliding Window Protocol  Set 1 (Sender Side)
Sliding Window Protocol  Set 2 (Receiver Side)
Difference between http and https
Circuit Switching VS Packet Switching
Basics of WiFi
Commonly asked Computer Networks Interview Questions  Set 1 
Data Link Layer
Network Layer
Transport Layer
Misc Topics in Computer Networks
Application Layer
Network Security
Computer Networks 
Lecture NotesProf. Dheeraj Sanghi, IIT Kanpur
Web Resources on Computer Networks by Andrew S. Tanenbaum.
