Previous year papers GATE CS, solutions and explanations year-wise and topic-wise.

This page contains GATE CS Preparation Notes / Tutorials on Operating Systems, DBMS (Database Management Systems), Theory of Computation, Mathematics, Computer Organization and Architecture, and Digital Electronics, Data Structures, Algorithms, Compiler Design, Computer Networks listed according to the GATE CS 2017 official Syllabus.

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.
counting, recurrence relations, generating functions.
Linear Algebra: Matrices,
system of linear equations,
eigenvalues and eigenvectors,
LU decomposition.
Calculus: Limits,
continuity and differentiability.
Maxima and minima.
Mean value theorem.
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
Recurrence relations
Pigeonhole Principle
Linear Algebra:
Eigen Values and Eigen Vectors
L U Decomposition
Lagrange’s Mean Value Theorem
Mean Value Theorem | Rolle’s Theorem
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
Propositional and First Order Logic
Set theory,Algebra,Mathematical Logic
Book PDF-Schaum’s
Graph Theory
Video Lectures-IISC Banglore
Lecture Notes-MIT
Section 2: Digital Logic
Boolean algebra.
Combinational and sequential circuits.
Number representations and computer arithmetic (fixed and floating point).
Half Adder
Half Subtractor
Last Minute Notes
Digital Logic & Number representation(28) Video Lectures-NPTEL
Notes-Number System-Swarthmore
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 PDF-Morris Mano
Section 4: Programming and Data Structures
Programming in C.
linked lists,
binary search trees,
binary heaps,
C Programming
Recursive functions
Tail Recursion
Linked List
Binary Tree
Binary Search Tree
Binary Heap

C Language
Linked List
Binary Trees
Tree Traversals
Binary Search Trees
Balanced Binary Search Trees
Graph Traversals
B and B+ Trees
Data Structures and Algorithm

Video lectures-IITD
Book- Introduction to Algorithms by Cormen, Thomas H.
Section 5: Algorithms
Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy,
dynamic programming and divide-and‐conquer.
Graph search,
minimum spanning trees,
shortest paths.
Searching and Sorting
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

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

Video lectures-IITD
Book- Introduction to Algorithms by Cormen, Thomas H.
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.
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
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 Push-down automata
Recursively enumerable sets and Turing machines
Automata Theory
Web Resource-ArsDigita University
Sample Problems and Solutions-Loyola Univ
Section 7: Compiler Design
Lexical analysis,
syntax-directed translation.
Runtime environments.
Intermediate code generation.
Lexical Analysis
Introduction to Syntax Analysis
Syntax Directed Translation
Runtime Environments
Classification of Context Free Grammars
Ambiguous Grammar
FIRST Set in Syntax Analysis
FOLLOW Set in Syntax Analysis
Lexical analysis
Parsing and Syntax directed translation
Code Generation and Optimization
Compiler Design

Lecture Slides-Stanford
Book-Aho and Ullman
Dragon Book Lecture Notes
Video Lectures-Stanford

Section 8: Operating System
inter-process 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
Banker’s Algorithm
Readers-Writers 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 Lectures-IIT KGP
Practice Problems and Solutions-William Stallings
Section 9: Databases
Relational model:
relational algebra,
tuple calculus,
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 Algebra-Overview
Relational Algebra-Basic Operators
Relational Algebra-Extended Operators
Lossless Decomposition
Dependency Preserving Decomposition
Attribute Closure/Candidate Key-Functional 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
Inner VS Outer Join
Having Vs Where Clause
Nested Queries in SQL
ACID Properties
Concurrency Control
View equal schedule
Conflict Serializability
Recoverability of Schedules
Indexing in Databases | Set 1
How to solve Relational Algebra problems for GATE

ER and Relational Models
Database Design (Normal Forms)
Transactions and concurrency control
Sequential files, indexing, B & B+ trees
Database Management Systems
Lecture Slides-Silberschatz, Korth and Sudarshan

Lecture Slides-Raghu Ramakrishnan and Johannes Gehrke
Lecture Slides-Stanford DBMS course
Video Lectures-IIT 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 Wi-Fi.
Network security: authentication,
basics of public key and private key cryptography,
digital signatures and certificates,
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 Wi-Fi

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 Notes-Prof. Dheeraj Sanghi, IIT Kanpur
Web Resources on Computer Networks by Andrew S. Tanenbaum.

Previous year papers GATE CS, solutions and explanations year-wise and topic-wise.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above!

GATE CS Corner

See Placement Course for placement preparation, GATE Corner for GATE CS Preparation and Quiz Corner for all Quizzes on GeeksQuiz.