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

This page contains GATE CS Preparation Notes / Tutorials on Mathematics, Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating Systems, DBMS (Database Management Systems), and 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.
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:
Proposition Logic | Introduction
Propositional Equivalence
Predicates and Quantifiers
Set Theory | Introduction
Set Theory | Set Operations
Relations and their types
Relations and their representations
Groups (New)

Set Theory & Algebra
Linear Algebra
Numerical Methods and Calculus
Graph Theory
Combinatorics
Propositional and First Order Logic
Set theory,Algebra,Mathematical Logic
Discrete Mathematics-NPTEL Video Lectures
Book PDF-Schaum’s
Graph Theory
Video Lectures-IISC Banglore
Lecture Notes-MIT
Section 2: Digital Logic
Boolean algebra.
Combinational and sequential circuits.
Minimization.
Number representations and computer arithmetic (fixed and floating point).
Digital Logic & Number representation(28) Video Lectures-NPTEL
Notes-Number System-Swarthmore
Section 3: Computer Organization and Architecture
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
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)
Memory hierarchy:
Cache Memory
Cache Organization | Introduction
I/O Interface (Interrupt and DMA Mode)
Computer Organization and Architecture(33) Book PDF- Carl Hamacher
Book PDF-Morris Mano
Section 4: Programming and Data Structures
Programming in C.
Recursion.
Arrays,
stacks,
queues,
trees,
binary search trees,
binary heaps,
graphs.
C Programming
Recursion
Recursive functions
Tail Recursion
Arrays
Stack
Queue
Binary Tree
Binary Search Tree
Binary Heap
Graph

C Language
Recursion
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 lectures-IITD
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 divide-and‐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

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 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
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 Push-down automata
Recursively enumerable sets and Turing machines
Undecidability
Automata Theory
Web Resource-ArsDigita University
Sample Problems and Solutions-Loyola Univ
Section 7: Compiler Design
Lexical analysis,
parsing,
syntax-directed translation.
Runtime environments.
Intermediate code generation.
Lexical Analysis
Introduction to Syntax Analysis

Lexical analysis
Parsing and Syntax directed translation
Code Generation and Optimization
Compiler Design
Section 8: Operating System
Processes,
inter-process communication,
concurrency and synchronization.
Memory management and virtual memory.
File systems.
Process Management| Introduction
Process Scheduling
Process scheduler
Disk Scheduling
Process Synchronization| Introduction
Process Synchronization | Monitors
Memory Management | Partition Allocation Method
Page Replacement Algorithm
Inter-Process Communication
Fork System Call
Paging
Segmentation
Banker’s Algorithm
Readers-Writers Problem | Set 1 (Introduction and

Difference between Priority Inversion
and Priority Inheritance

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
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 Algebra-Overview
Relational Algebra-Basic Operators
Relational Algebra-Extended Operators
Normalization:
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 and Relational Models
Database Design (Normal Forms)
SQL
Transactions and concurrency control
Sequential files, indexing, B & B+ trees
Database Management Systems
Lecture Slides-Silberschatz, Korth and Sudarshan

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.
Network Topologies (New)
LAN Technologies
Network Devices
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
Leaky Bucket Algorithm (New)
Stop and Wait ARQ
Sliding Window Protocol | Set 1 (Sender Side)
Sliding Window Protocol | Set 2 (Receiver Side)
Difference between http and https
DNS
SMTP
ICMP (New)

Commonly asked Computer Networks Interview Questions | Set 1

Network Layer
Transport Layer
Misc Topics in Computer Networks
Application Layer
Network Security
Computer Networks
Video Lectures by University of Washington.
Lecture Notes-Prof. Dheeraj Sanghi, IIT Kanpur
Web Resources on Computer Networks by Andrew S. Tanenbaum.