8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Custom Search

COURSES Login

HIRE WITH US

GATE CS Notes according to GATE 2020 syllabus

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, Database Management
Systems (DBMS), and Computer Networks listed according to the GATE CS 2020 syllabus.
 

GeeksforGeeks Sudo GATE Course:

Register for Sudo GATE 2020

GATE 2020 SYLLABUS LEARN PRACTICE EXTERNA

Section 1: Numerical and Verbal Ability 1. Numerical Ability : 1. Numerical Ability : 1.

Placements Placements
Numerical Ability : Numerical
2. Verbal Ability : 2. Verbal Ability :
computation,
Placements | English | Error Detection and Placements
numerical estimation, numerical
Correction
reasoning and data interpretation
Placements | English | Passage/Sentence 2.
Verbal Ability : English grammar,
Re-arrangement
sentence completion,
Placements | English | Fill in the Blanks
verbal analogies, word groups,
Placements | English | Comprehension
instructions,
Passages
critical reasoning and verbal deduction

1. Discrete Mathematics : 1. Discrete 1.

Section 2: Mathematics Representation of Boolean Functions Mathematics :
Properties of Boolean algebra Propositional
1. Discrete Mathematics : PDNF and PCNF in Discrete Mathematics and First Order
Propositional and rst order logic Functional Completeness Logic
Sets, relations, functions, partial Introduction to Propositional Logic Set 1 Set Theory &
orders and lattices. Groups Introduction to Propositional Logic Set 2 Algebra
Combinatorics: counting, recurrence Propositional Equivalence Combinatorics
relations, generating functions Predicates and Quanti ers Set 1 Combinatorics |
Graphs: connectivity, matching, Predicates and Quanti ers Set 2 Set 1
coloring Some theorems on Nested Quanti ers Combinatorics |
2. Linear Algebra : Rules of Inference Set 2
Matrices, determinants Consensus theorem Graph Theory
LU decomposition Introduction to Proofs 2. Linear Algebra :
System of linear equations Combinatorics Basics Linear Algebra
Eigenvalues and eigenvectors Pigeonhole Principle 3. Probability :
3. Probability : PnC and Binomial Coe cients Probability
Random variables Generalized PnC Set 1 4. Calculus :
Mean, median, mode and standard Generalized PnC Set 2 Calculus 2.
deviation Inclusion-Exclusion and its various
Uniform, normal, exponential, Applications
▲
Poisson and binomial distributions Corollaries of Binomial Theorem
Introduction of Generating Functions

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 1/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Conditional probability and Bayes Generating Functions – Set 2 3.

theorem Set Theory | Introduction
4. Calculus : Set Theory | Set Operations
Limits, Continuity and Power Set and its Properties 4.
Differentiability Relations and their types
Maxima and Minima. Mean value Relations and their representations
theorem Representing Relations
Integration Closure of Relations and Equivalence
Relations
Functions | Properties and Types
Inverse functions and composition of
functions
Total number of possible functions
Number of possible equivalence relations
Groups
Partial Orders and Lattices
Hasse Diagrams
Graph Theory Basics – Set 1
Graph Theory Basics – Set 2
Walks, Trails, Paths, Cycles and Circuits in
Graph
Number of nodes and height of binary tree
Graph measurements: length, distance,
diameter, eccentricity, radius, center
Graph Isomorphisms and Connectivity
Planar Graphs and Graph Coloring
Euler and Hamiltonian Paths
Independent Sets, Covering and Matching
Matching (graph theory)
Graph theory practice questions
Recurrence relations
Different types of recurrence relations and
their solutions
Types of Recurrence Relations – Set 2
2. Linear Algebra :
Matrix Introduction
Different operations on matrices
L U Decomposition
Doolittle Algorithm : LU Decomposition
System of Linear Equations
Eigen Values and Eigen Vectors
3. Probability :
Probability
Random Variables
Mean, Variance And Standard Deviation
Law of total probability
Bayes’s formula for Conditional Probability
Probability Distributions Set 1 (Uniform
Distribution)
Probability Distributions Set 2 (Exponential
Distribution)
Probability Distributions Set 3 (Normal
Distribution)
Probability Distributions Set 4 (Binomial
Distribution)
Probability Distributions Set 5 (Poisson
Distribution)
Hypergeometric Distribution model
Conditional Probability
Covariance and Correlation
▲
4. Calculus :
Limits, Continuity and Differentiability

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 2/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Lagrange’s Mean Value Theorem

Mean Value Theorem | Rolle’s Theorem
Cauchy’s mean value theorem
Inde nite Integrals
Finding nth term of any polynomial
sequence
Sequence, Series and Summations
CATEGORY ARCHIVES: ENGINEERING
MATHEMATICS
Last Minute Notes – Engineering
Mathematics

Download PDF
Printable PDF (Free)

Download Here
frompdftodoc.com

OPEN

Section 3: Algorithms 1. Asymptotic Analysis of Algorithms : 1. Asymptotic Analysis

Analysis of Algorithms | Set 1 (Asymptotic of Algorithms : Algori
Searching, sorting, hashing
Analysis) Analysis of
Asymptotic worst case time and space
Analysis of Algorithms | Set 2 (Worst, Algorithms
complexity
Average and Best Cases) 2. Recurrence
Algorithm design techniques : greedy,
Analysis of Algorithms | Set 3 (Asymptotic Relations :
dynamic programming and divide‐and‐
Notations) Analysis of
conquer
Analysis of Algorithms | Set 4 (Analysis of Algorithms
Graph search, minimum spanning trees,
Loops) (Recurrences)
shortest paths
Analysis of Algorithm | Set 5 (Amortized Practice Set for
Analysis Introduction) Recurrence
Analysis of algorithms | little o and little Relations
omega notations 3. Divide and Conquer :
What does ‘Space Complexity’ mean? MergeSort
Articles | Analysis of Algorithms Divide and
2. Recurrence Relations : Conquer
Analysis of Algorithm | Set 4 (Solving 4. Greedy Techniques :
Recurrences) Graph
Different types of recurrence relations and Minimum
their solutions Spanning Tree
3. Divide and Conquer : Graph Shortest
Divide and Conquer | Set 1 (Introduction) Paths
Binary Search Greedy
Why is Binary Search preferred over Algorithms
Ternary Search? 5. Graph Based
Merge Sort Algorithms :
Merge Sort for Linked Lists Graph
Merge Sort for Doubly Linked List Graph
How to make Mergesort to perform O(n) Traversals
comparisons in best case? 6. Dynamic
QuickSort Programing :
Iterative Quick Sort Dynamic
QuickSort on Singly Linked List Programming ▲
QuickSort on Doubly Linked List 7. Searching, Sorting
and Hashing :

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 3/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

When does the worst case of Quicksort Searching

occur? Sorting
Why Quick Sort preferred for Arrays and Hashing
Merge Sort for Linked Lists? 8. Misc :
Write a program to calculate pow(x,n) Misc
Median of two sorted arrays Commonly
Count Inversions in an array | Set 1 (Using Asked
Merge Sort) Algorithm
Divide and Conquer | Set 2 (Closest Pair of Interview
Points) Questions | Set
Divide and Conquer | Set 5 (Strassen’s 1
Matrix Multiplication) Data Structures
Sort a nearly sorted (or K sorted) array and Algorithms
Search in an almost sorted array | Set 1
K-th Element of Two Sorted Arrays Data Structures
K’th Smallest/Largest Element in Unsorted and Algorithms
Array | Set 2 (Expected Linear Time) | Set 2
Searching and Sorting Data Structures
4. Greedy Techniques : and Algorithms
Greedy Algorithms | Set 1 (Activity | Set 3
Selection Problem) Data Structures
Job Sequencing Problem | Set 1 (Greedy and Algorithms
Algorithm) | Set 4
Greedy Algorithms | Set 3 (Huffman Data Structures
Coding) and Algorithms
Greedy Algorithms | Set 4 (E cient | Set 5
Huffman Coding for Sorted Input) Data Structures
Greedy Algorithms | Set 2 (Kruskal’s and Algorithms
Minimum Spanning Tree Algorithm) | Set 6
Greedy Algorithms | Set 5 (Prim’s Minimum Data Structures
Spanning Tree (MST)) and Algorithms
Greedy Algorithms | Set 6 (Prim’s MST for | Set 7
Adjacency List Representation) Data Structures
Applications of Minimum Spanning Tree and Algorithms
Problem | Set 8
Greedy Algorithms | Set 7 (Dijkstra’s Data Structures
shortest path algorithm) and Algorithms
Greedy Algorithms | Set 8 (Dijkstra’s | Set 9
Algorithm for Adjacency List Data Structures
Representation) and Algorithms
Greedy Algorithm to nd Minimum number | Set 10
of Coins Data Structures
Strongly Connected Components and Algorithms
Greedy Algorithms | Set 11
5. Graph Based Algorithms : Data Structures
Graph and its representations and Algorithms
Breadth First Traversal or BFS for a Graph | Set 12
Depth First Traversal or DFS for a Graph Data Structures
Applications of Depth First Search and Algorithms
Detect Cycle in a Directed Graph | Set 13
Disjoint Set (Or Union-Find) | Set 1 (Detect Data Structures
Cycle in an Undirected Graph) and Algorithms
Detect cycle in an undirected graph | Set 14
Topological Sorting Data Structures
Longest Path in a Directed Acyclic Graph and Algorithms
Biconnected Components | Set 15
Bellman–Ford Algorithm Data Structures
Floyd Warshall Algorithm and Algorithms
Shortest Path in Directed Acyclic Graph | Set 16
Some interesting shortest path questions | Data Structures
▲
Set 1 and Algorithms
| Set 17

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 4/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Shortest path with exactly k edges in a Data Structures

directed and weighted graph and Algorithms
Biconnected Components | Set 18
Biconnected graph Data Structures
Articulation Points (or Cut Vertices) in a and Algorithms
Graph | Set 19
Check if a graph is strongly connected | Data Structures
Set 1 (Kosaraju using DFS) and Algorithms
Bridges in a graph | Set 20
Transitive closure of a graph Data Structures
Graph Algorithms | DFS and BFS | and Algorithms
Minimum Spanning Tree | Shortest Paths | | Set 21
Connectivity Data Structures
6. Dynamic Programing : and Algorithms
Dynamic Programming | Set 1 | Set 22
(Overlapping Subproblems Property) Data Structures
Dynamic Programming | Set 2 (Optimal and Algorithms
Substructure Property) | Set 23
Dynamic Programming | Set 4 (Longest Data Structures
Common Subsequence) and Algorithms
Dynamic Programming | Set 8 (Matrix | Set 24
Chain Multiplication) Data Structures
Dynamic Programming | Set 10 ( 0-1 and Algorithms
Knapsack Problem) | Set 25
Dynamic Programming | Set 6 (Min Cost Data Structures
Path) and Algorithms
Dynamic Programming | Set 25 (Subset | Set 26
Sum Problem) Data Structures
Dynamic Programming | Set 23 (Bellman– and Algorithms
Ford Algorithm) | Set 27
Dynamic Programming | Set 16 (Floyd Data Structures
Warshall Algorithm) and Algorithms
Total number of non-decreasing numbers | Set 28
with n digits Data Structures
Vertex Cover Problem | Set 2 (Dynamic and Algorithms
Programming Solution for Tree) | Set 29
Smallest power of 2 greater than or equal Data Structures
to n and Algorithms
Travelling Salesman Problem | Set 1 (Naive | Set 30
and Dynamic Programming) Data Structures
Travelling Salesman Problem | Set 2 and Algorithms
(Approximate using MST) | Set 31
Dynamic Programming Data Structures
7. Searching, Sorting and Hashing : and Algorithms
Linear Search | Set 32
Linear Search vs Binary Search Data Structures
Selection Sort and Algorithms
Bubble Sort | Set 33
Insertion Sort Data Structures
Heap Sort and Algorithms
Radix Sort | Set 34
Counting Sort Data Structures
Hashing | Set 1 (Introduction) and Algorithms
Hashing | Set 2 (Separate Chaining) | Set 35
Hashing | Set 3 (Open Addressing)
Hash Table vs STL Map
Advantages of BST over Hash Table
8. Misc :
Find subarray with given sum | Set 2
(Handles Negative Numbers)
▲
Largest subarray with equal number of 0s
and 1s

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 5/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Find four elements a, b, c and d in an array

such that a+b = c+d
Print all subarrays with 0 sum
Given an array A[] and a number x, check
for pair in A[] with sum as x
Union and Intersection of two Linked Lists
Find whether an array is subset of another
array | Added Method 3
Count pairs with given sum
Top 20 Hashing Technique based
Interview Questions
CATEGORY ARCHIVES: ALGORITHMS
Last Minute Notes – Algorithms

Section 4: Programming and Data Structures 1. Programming in C, Recursion : 1. Programming in C, Progr

C Programming Recursion : Struc
Programming in C, Recursion
Recursion Principle of
Arrays, stacks, queues, linked lists, trees,
Tail Recursion programming
binary search trees, binary heaps, graphs
Recursive functions languages | Set
2. Array, Stack, Queue : 1
Arrays C Language
Stack Recursion
Queue C Language |
3. Linked Lists : Set 1
Linked List C Language |
4. Trees, Binary search trees, Binary heaps : Set 2
Binary Tree C Language |
Binary Search Tree Set 3
D
Binary Heap C Language | P
5. Graphs : Set 4
f
Graph C Language |
CATEGORY ARCHIVES: DATA Set 5
P
STRUCTURES C Language |
(
CATEGORY ARCHIVES: C Set 6
Last Minute Notes – DATA STRUCTURE C Language | D
Last Minute Notes – C/C++ Set 7
C Language |
Set 8
C Language |
Set 9
C Language |
Set 10
2. Array, Stack, Queue :
Array
Stack
Queue
3. Linked Lists :
Linked List
4. Trees, Binary search
trees, Binary heaps :
Binary Trees
Tree Traversals
Binary Search
Trees
Balanced
Binary Search
Trees
Heap
5. Graphs :
Graph ▲
Graph
Traversals

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 6/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Commonly
Asked Data
Structure
Interview
Questions | Set
1

Section 5: Operating Systems 1. Processes, threads, CPU scheduling : 1. Processes, threads, Opera
What happens when we turn on computer? CPU scheduling :
Processes, threads, CPU scheduling
Introduction of Operating System Process
Inter‐process communication,
Functions of Operating System Management
concurrency and synchronization,
Types of Operating Systems CPU
deadlock
Dual Mode operations in OS Scheduling
Memory management and virtual
Privileged and Non-Privileged Instructions 2. Inter‐process
memory
32-bit and 64-bit operating systems communication,
File systems
Real time systems concurrency and
Operating Systems | Need and Functions synchronization :
Process Management | Introduction Concurrency
States of a process and
Process Table and Process Control Block synchronization
(PCB) 3. Deadlock :
Process Scheduler Deadlock
Difference between dispatcher and 4. Main memory
scheduler management :
Process Management | CPU Scheduling Memory
Preemptive and Non-Preemptive Management
Scheduling 5. Virtual memory :
Program for FCFS Scheduling | Set 1 Virtual Memory
Program for FCFS Scheduling | Set 2 | Questions
(Processes with different arrival times) 6. File system and disk
Convoy Effect in Operating Systems scheduling :
Program for preemptive priority CPU Input Output
scheduling Systems
Program for Round Robin scheduling | Set UNIX – I Node
1 Commonly
Round Robin Scheduling with different Asked
arrival times Operating
Program for Shortest Job First (or SJF) Systems
scheduling | Set 1 (Non- preemptive) Interview
Program for Shortest Job First (SJF) Questions | Set
scheduling | Set 2 (Preemptive) 1
Shortest Job First scheduling with Operating
predicted burst time Systems | Set 1
Longest Remaining Time First (LRTF) Operating
algorithm Systems | Set 2
Longest Remaining Time First (LRTF) Operating
Program Systems | Set 3
Highest Response Ratio Next (HRRN) Operating
Scheduling Systems | Set 4
Program for Priority Scheduling | Set 1 Operating
Priority Scheduling with different arrival Systems | Set 5
time | Set 2 Operating
Multilevel Queue Scheduling Systems | Set 6
Multilevel Feedback Queue Scheduling Operating
Multiple-Processor Scheduling Systems | Set 7
Measure the time spent in context switch Operating
Starvation and Aging in Operating Systems Systems | Set 8
Introduction of System Call Operating
Operating System | Thread Systems | Set 9
Threads and its types Operating ▲
Multithreading Systems | Set
Multi threading models 10

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 7/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Bene ts of Multithreading Operating

Process-based and Thread-based Systems | Set
Multitasking 11
User Level thread Vs Kernel Level thread Operating
Microkernel Systems | Set
Monolithic Kernel and key differences 12
from Microkernel Operating
Difference between multitasking, Systems | Set
multithreading and multiprocessing 13
fork() in C Operating
Boot Block Systems | Set
2. Inter‐process communication, concurrency and 14
synchronization: Operating
Process Synchronization | Introduction Systems | Set
Operating System | Process 15
Synchronization | Set 2 Operating
Critical Section Systems | Set
Inter Process Communication 16
IPC using Message Queues Operating
IPC through shared memory Systems | Set
Interprocess Communication: Methods 17
Semaphores in operating system
Mutex vs Semaphore
Lock variable synchronization mechanism
Peterson’s Algorithm for Mutual Exclusion
| Set 1 (Basic C implementation)
Peterson’s Algorithm for Mutual Exclusion
| Set 2 (CPU Cycles and Memory Fence)
Peterson’s Algorithm (Using processes
and shared memory)
Readers-Writers Problem | Set 1
(Introduction and Readers Preference
Solution)
Reader-Writers solution using Monitors
Producer Consumer Problem using
Semaphores | Set 1
Producer-Consumer solution using
Semaphores in Java | Set 2
Sleeping Barber problem
Process Synchronization | Monitors
Dining-Philosophers Solution Using
Monitors
Dining Philosopher Problem Using
Semaphores
Dekker’s algorithm
Bakery Algorithm
Priority Inversion : What the heck !
What’s difference between Priority
Inversion and Priority Inheritance ?
Deadlock, Starvation, and Livelock
3. Deadlock :
Process Management | Deadlock
Introduction
Program for Deadlock free condition
Deadlock Prevention And Avoidance
Deadlock Detection And Recovery
Resource Allocation Graph (RAG)
Banker’s Algorithm
Program for Banker’s Algorithm | Set 1
(Safety Algorithm)
▲
Banker’s Algorithm : Print all the safe state
Deadlock detection algorithm

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 8/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Methods of resource allocation to

processes by operating system
4. Main memory management :
Mapping virtual address to physical
addresses
Logical vs Physical Address in Operating
System
Paging
Page Table Entries
Inverted Page Table
Segmentation
Memory Management | Partition
Allocation Method
Program for First Fit algorithm in Memory
Management
Program for Next Fit algorithm in Memory
Management
Non-Contiguous Allocation
Fixed (or static) Partitioning
Variable (or dynamic) Partitioning
Working with Shared Libraries | Set 1
Static and Dynamic Libraries | Set 1
Buddy System
Buddy System Memory Allocation
Buddy System Memory Deallocation
Allocating kernel memory
Requirements of memory management
system
5. Virtual memory :
Virtual Memory
Secondary memory – Hard disk drive
Page Fault Handling
Page Replacement Algorithms
Belady’s Anomaly
Program for Optimal Page Replacement
Algorithm
Second Chance (or Clock) Page
Replacement Policy
Techniques to handle Thrashing
What exactly Spooling is all about?
Difference between Spooling and Buffering
Overlays in Memory Management
Swap Space
6. File system and disk scheduling :
File Systems
Structures of Directory
File Directory | Path Name
File Access Methods
File Allocation Methods
Operating System | Free space
management
Difference between FAT32, exFAT, and
NTFS File System
Disk Scheduling Algorithms
Program for SSTF disk scheduling
algorithm
CATEGORY ARCHIVES: OPERATING
SYSTEMS
Last Minute Notes – Operating Systems

Section 6: Databases 1. ER‐model : 1. ER‐model: Datab

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 9/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

ER‐model, Relational model : relational Database Management System – ER and

algebra, tuple calculus, SQL Introduction | Set 1 Relational
Integrity constraints, normal forms Database Management System Models
Transactions and concurrency control Introduction | Set 2 (3-Tier Architecture) 2. Relational model
File organization, indexing (e.g., B and B+ DBMS Architecture 2-Level, 3-Level (relational algebra,
trees) Need for DBMS tuple calculus):
Advantages of DBMS over File system ER and
Choice of DBMS | Economic factors Relational
Data Abstraction and Data Independence Models
ER Model 3. Database design
Recursive Relationships (integrity
Minimization of ER Diagram constraints, normal
Enhanced ER Model forms):
Mapping from ER Model to Relational Database
Model Design(Normal
2. Relational model (relational algebra, tuple Forms)
calculus) : 4. Query languages
Relational Model (SQL) :
Relational Algebra – Overview SQL
DBMS | Anomalies in Relational Model 5. Transactions and
Relational Model Introduction and Codd concurrency control:
Rules Transactions
Keys in Relational Model (Candidate, and
Super, Primary, Alternate and Foreign) concurrency
Relational Algebra-Basic Operators control
Relational Algebra – Extended Operators 6. File structures
Tupple Relational Calculus (sequential les,
DBMS | How to solve Relational Algebra indexing, B and B+
problems for GATE trees):
DBMS | Row oriented vs. column oriented File structures
data stores (sequential
3. Database design (integrity constraints, normal les, indexing,
forms) : B and B+ trees)
Database Normalization | Introduction Practice
Database Normalization | Normal Forms questions on B
Functional Dependency and Attribute and B+ Trees
Closure Commonly
Finding Attribute Closure and Candidate asked DBMS
Keys using Functional Dependencies interview
Number of possible Superkeys questions | Set
Lossless Decomposition 1
Dependency Preserving Decomposition Commonly
Lossless Join and Dependency Preserving asked DBMS
Decomposition interview
DBMS | How to nd the highest normal questions | Set
form of a relation 2
DBMS | Minimum relations satisfying 1NF Database
Equivalence of Functional Dependencies Management
Armstrong’s Axioms in Functional Systems | Set 1
Dependency Database
Canonical Cover Management
Denormalization in Databases Systems | Set 2
Introduction of 4th and 5th Normal form Database
4. Query languages (SQL) : Management
Structured Query Language (SQL) Systems | Set 3
Inner VS Outer Join Database
Having Vs Where Clause Management
Database Objects Systems | Set 4
Nested Queries in SQL Database
Join operation Vs nested query Management
▲
Indexing in Databases | Set 1 Systems | Set 5

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 10/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

SQL queries on clustered and non- Database

clustered Indexes Management
SQL Tutorial Systems | Set 6
5. Transactions and concurrency control : Database
Concurrency Control -Introduction Management
Database Recovery Techniques Systems | Set 7
ACID Properties in DBMS Database
Log based recovery Management
DBMS | Why recovery is needed? Systems | Set 8
Transaction Isolation Levels in DBMS Database
Concurrency Control | Types of Schedules Management
DBMS | Types of Recoverability of Systems | Set 9
Schedules and easiest way to test Database
schedule Management
Con ict Serializability Systems | Set
Precedence Graph For Testing Con ict 10
Serializability Database
How to test if two schedules are View Management
Equal or not ? Systems | Set
Recoverability of Schedules 11
Deadlock in DBMS
Starvation in DBMS
Concurrency Control Protocols | Lock
Based Protocol
Concurrency Control Protocol | Two Phase
Locking (2-PL)-I
Concurrency Control Protocol | Two Phase
Locking (2-PL)-II
Concurrency Control Protocol | Two Phase
Locking (2-PL)-III
Concurrency Control Protocol | Thomas
Write Rule
Concurrency Control Protocols |
Timestamp Ordering Protocols
Concurrency Control Protocol | Multiple
Granularity Locking
Concurrency Control Protocol | Graph
Based Protocol
Introduction to TimeStamp and Deadlock
Prevention Schemes
Implementation of Locking in DBMS
DBMS | Challenges of database security
6. File structures (sequential les, indexing, B
and B+ trees) :
Indexing in Databases | Set 1
File Organization – Set 1
File Organization – Set 2 (Hashing in
DBMS)
File Organization – Set 3
B-Tree | Set 1 (Introduction)
B-Tree | Set 2 (Insert)
B-Tree | Set 3 (Delete)
Database File Indexing – B+ Tree
(Introduction)
RAID
Data Warehousing
Data Mining
Data Replication
CATEGORY ARCHIVES: DBMS
Last Minute Notes – DBMS
▲

Section 7: Computer Networks 1. Network Fundamental and Physical layer : 1. Network Comp

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 11/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Concept of layering, LAN technologies Basics of Computer Networking Fundamental and

(Ethernet) Network goals Physical layer :
Flow and error control techniques, Network Topologies Computer
switching Types of area networks – LAN, MAN and Networks
IPv4/IPv6, routers and routing algorithms WAN 2. Data Link layer :
(distance vector, link state) MANET: Mobile Ad hoc Network Data Link Layer
TCP/UDP and sockets, congestion Types of MANET 3. Network layer :
control Types of Transmission Media Network Layer
Application layer protocols (DNS, SMTP, Transmission Modes in Computer IP Addressing
POP, FTP, HTTP) Networks (Simplex, Half-Duplex and Full- 4. Transport layer :
Basics of Wi-Fi Duplex) Transport Layer
Network security : authentication, basics Redundant link problems 5. Application layer :
of public key Digital Subscriber Line (DSL) HTTP Non-
and private key cryptography, digital What is Scrambling? Persistent &
signatures and certi cates, rewalls Difference between Unipolar, Polar and Persistent
Bipolar Line Coding Schemes Connection |
Manchester Encoding Set 2 (Practice
Analog to digital conversion Question)
Digital to Analog Conversion Application
Analog to Analog Conversion (Modulation) Layer
Difference between Broadband and 6. Network security :
Baseband Transmission Network
Let’s experiment with Networking Security
Layers of OSI Model Commonly
TCP/IP Model asked
2. Data Link layer : Computer
Multiple Access Protocols Networks
P2P(Peer To Peer) File Sharing Interview
Framing In Data Link Layer Questions | Set
LAN Technologies | ETHERNET 1
Ethernet Frame Format Computer
Token Ring frame format Networks | Set
Bit Stu ng 1
Difference between Byte stu ng and Bit Computer
stu ng Networks | Set
Hamming Code 2
Carrier sense multiple access (CSMA) Computer
Controlled Access Protocols Networks | Set
Back-off Algorithm for CSMA/CD 3
Collision Detection in CSMA/CD Computer
E ciency of CSMA/CD Networks | Set
E ciency Of Token Ring 4
Computer Networks | Error Detection Computer
Stop and Wait ARQ Networks | Set
Sliding Window Protocol | Set 1 (Sender 5
Side) Computer
Sliding Window Protocol | Set 2 (Receiver Networks | Set
Side) 6
Sliding Window Protocol | Set 3 (Selective Computer
Repeat) Networks | Set
Sliding Window protocols Summary With 7
Questions Computer
Program to remotely Power On a PC over Networks | Set
the internet using the Wake-on-LAN 8
protocol Computer
Program to calculate the Round Trip Time Networks | Set
(RTT) 9
Introduction of MAC Address Computer
Collision Avoidance in wireless networks Networks | Set
Maximum data rate (channel capacity) for 10
▲
noiseless and noisy channels Computer
Types of switches Networks | Set

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 12/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

3. Network layer : 11
Internetworking Computer
Line Con guration in Computer Networks Networks | Set
Difference between Unicast, Broadcast 12
and Multicast
Collision Domain and Broadcast Domain
IP Addressing | Introduction and Classful
Addressing
Network Layer | Introduction and IPv4
Datagram Header
Network Layer | Ipv4 Datagram
Fragmentation and Delays
Fragmentation at Network Layer
Internet Protocol v6 | IPv6
Internet Protocol version 6 (IPv6) Header
IP Addressing | Classless Addressing
Supernetting
Computer Networks | Longest Pre x
Matching in Routers
Program to determine class, Network and
Host ID of an IPv4 address
C Program to nd IP Address, Subnet
Mask & Default Gateway
IPv4 classless Subnet equation
Introduction to variable length subnet
mask (VLSM)
Network address translation (NAT)
Types of Network address translation
(NAT)
Classi cation of Routing Algorithms – Set
1
Types of routing – Set 2
Classes of routing protocols – Set 3
Distance vector routing v/s Link state
routing
Fixed and Flooding Routing algorithms
Routing v/s Routed Protocols
Unicast Routing – Link State Routing
Routing Protocols Set 1 (Distance Vector
Routing)
Route Poisoning and Count to in nity
problem
Onion Routing
Router on a stick
Internet Control Message Protocol (ICMP)
| Computer Networks
Hot Standby Router Protocol (HSRP)
OSPF protocol fundamentals
OSPF protocol States
OSPF router roles and con guration
Root Bridge Election in Spanning Tree
Protocol
Types of Spanning Tree Protocol (STP)
EIGRP fundamentals
Features of Enhanced Interior Gateway
Routing Protocol (EIGRP)
Routing Information Protocol (RIP)
Routing Interface Protocol (RIP) V1 & V2
Link state advertisement (LSA)
Administrative Distance (AD) and
▲
Autonomous System (AS)
Circuit Switching

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 13/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Packet Switching and Delays

Differences between Virtual Circuits &
Datagram Networks
Computer Network | Circuit Switching VS
Packet Switching
Traceroute
How ARP works?
ARP, Reverse ARP(RARP), Inverse
ARP(InARP), Proxy ARP and Gratuitous
ARP
Packet ow in the same network
Packet ow in different network
Difference between layer-2 and layer-3
switches
What’s difference between Ping and
Traceroute?
Computer Network | Servers
What is Local Host?
4. Transport layer :
Transport Layer responsibilities
Congestion Control
Leaky Bucket Algorithm
TCP | Services and Segment structure
TCP Congestion Control
TCP 3-Way Handshake Process
TCP Connection Establishment
TCP Connection Termination
Error Control in TCP
TCP Timers
TCP ags
TCP Server-Client implementation in C
User Datagram Protocol (UDP)
Differences between TCP and UDP
Multiplexing and Demultiplexing in
Transport Layer
5. Application layer :
Protocols in Application Layer
DNS (Domain Name Server) | NetWorking
Address Resolution in DNS
DNS Spoo ng or DNS Cache poisoning
Why does DNS use UDP and not TCP?
Dynamic Host Con guration Protocol
(DHCP)
DHCP Relay Agent
How DHCP server dynamically assigns IP
address to a host?
Simple network management protocol
(SNMP)
Simple Mail Transfer Protocol (SMTP)
File Transfer Protocol (FTP)
HTTP Non-Persistent & Persistent
Connection
Multipurpose Internet mail extension
(MIME)
What’s difference between http:// and
https:// ?
What’s difference between HTML and
HTTP ?
What’s difference between The Internet
and The Web ?
▲
Basics of Wi-Fi
Wi protected setup (WPS)

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 14/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Wi protected access (WPA)

LiFi vs. WiFi
Network Devices (Hub, Repeater, Bridge,
Switch, Router and Gateways)
6. Network security :
Basic Network Attacks
Types of Viruses
Introduction to Firewall
Zone-based rewall
Firewall methodologies
Deniel of Service and Prevention
Cryptography | Introduction to Crypto-
terminologies
Denial of Service DDoS attack
Types of DNS Attacks and Tactics for
Security
Types of Security attacks | Active and
Passive attacks
Birthday attack
Digital Signatures and Certi cates
LZW (Lempel–Ziv–Welch) Compression
technique
RC4 Encryption Algorithm
RC5 Encryption Algorithm
SHA-512 Hash
RSA Algorithm in Cryptography
RSA Algorithm using Multiple Precision
Arithmetic Library
Weak RSA decryption with Chinese-
remainder theorem
Implementation of Di e-Hellman
Algorithm
DNA Cryptography
Port security
Unicode
Message Authentication Codes
How message authentication code works?
System security
Hash Functions in System Security
The CIA triad
Image Steganography
Access-lists (ACL)
Data encryption standard (DES)
Difference between AES and DES ciphers
CATEGORY ARCHIVES: COMPUTER
NETWORKS
Last Minute Notes – Computer Networks

Section 8: Computer Organization and 1. Machine instructions and addressing modes :

Architecture Von Neumann architecture Computer Organization and Comp
Basic Computer Instructions Architecture : Archit
Machine instructions and addressing
Instruction Formats (Zero, One, Two and
modes
Three Address Instruction) Quiz on
ALU, data‐path and control unit
Stack based CPU Organization Microprocessors
Instruction pipelining
General Register based CPU Organization Computer
Memory hierarchy: cache, main memory
Single Accumulator based CPU Organization and
and secondary storage
organization Architecture
I/O interface (Interrupt and DMA mode)
Problem Solving on Instruction Format
Addressing Modes
Machine Instructions ▲
Difference between CALL and JUMP
instructions

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 15/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Simpli ed Instructional Computer (SIC)

Hardware architecture (parallel
computing)
Flynn’s taxonomy
Generations of computer
Amdahl’s law and its proof
2. ALU, data‐path and control unit :
Control Unit and design
Hardwired v/s Micro-programmed Control
Unit
Hardwired Vs Micro-programmed Control
unit | Set 2
Horizontal micro-programmed Vs Vertical
micro-programmed control unit
Synchronous Data Transfer
3. Instruction pipelining :
Pipelining | Set 1 (Execution, Stages and
Throughput)
Pipelining | Set 2 (Dependencies and Data
Hazard)
Pipelining | Set 3 (Types and Stalling)
Different Instruction Cycles
Performance of Computer
Micro-Operation
RISC and CISC
RISC and CISC | Set 2
4. Cache Memory :
Memory Hierarchy Design and its
Characteristics
Cache Memory
Cache Organization | Introduction
Locality and Cache friendly code
What’s difference between CPU Cache and
TLB?
Read and Write operations in memory
Memory Interleaving
Introduction to memory and memory units
2D and 2.5D Memory organization
Types of computer memory (RAM and
ROM)
Different Types of RAM
RAM vs ROM
5. I/O interface (Interrupt and DMA mode) :
I/O Interface (Interrupt and DMA Mode)
Input-Output Processor
Kernel I/O Subsystem
Memory mapped I/O and Isolated I/O
BUS Arbitration
Priority Interrupts | (S/W Polling and Daisy
Chaining)
Asynchronous input output
synchronization
Computer Ports
Clusters In Computer Organisation
Human – Computer interaction through
the ages
CATEGORY ARCHIVES: COMPUTER
ORGANIZATION & ARCHITECTURE

Section 9: Theory of Computation 1. Regular expression, langauges, grammar and 1. Regular expression, ▲ Theo
nite automata : langauges, grammar
Regular expressions and nite automata
Introduction of Theory of Computation and nite automata :

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 16/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Context-free grammars and push-down Finite Automata | Introduction Regular

automata Chomsky Hierarchy languages and
Regular and context-free languages, Regular Expressions, Regular Grammar nite automata
pumping lemma and Regular Languages Practice
Turing machines and undecidability Pumping Lemma problems on
Arden’s Theorem nite automata
How to identify if a language is regular or Practice
not problems on
Designing Finite Automata from Regular nite automata
Expression | Set 2
NFA with epsilon move to DFA Conversion 2. Context free
Conversion from NFA to DFA langauges, grammar
Minimization of DFA and push down
Generating regular expression from nite automata :
automata Context free
Union & Intersection of Regular languages languages and
with CFL Push-down
Designing Deterministic Finite Automata automata
(Set 1) 3. Context Sensitive
Designing Deterministic Finite Automata langauges :
(Set 2) .
DFA of a string with at least two 0’s and at 4. Turing machines
least two 1’s and undecidability :
DFA machines accepting odd number of Recursively
0’s or/and even number of 1’s enumerable
DFA for accepting the language L = {anbm | sets and Turing
n+m=even} machines
DFA for Strings not ending with “THE” Undecidability
Union process in DFA Automata
Concatenation process in DFA Theory
Star Height of Regular Expression and Automata
Regular Language Theory | Set 1
Mealy and Moore Machines Automata
Difference between Mealy machine and Theory | Set 2
Moore machine Automata
2. Context free langauges, grammar and push Theory | Set 3
down automata : Automata
Pushdown Automata Theory | Set 4
Pushdown Automata Acceptance by Final Automata
State Theory | Set 5
Check if the language is Context Free or Automata
Not Theory | Set 6
Construct Pushdown Automata for given
languages
Construct Pushdown automata for L =
{0n1m2m3n | m,n ≥ 0}
Construct Pushdown automata for L =
{0n1m2(n+m) | m,n ≥ 0}
Construct Pushdown Automata for all
length palindrome
NPDA for the language L ={wϵ{a,b}*| w
contains equal no. of a’s and b’s}
NPDA for accepting the language L = {an
bn | n>=1}
NPDA for accepting the language L = {an
bm cn | m,n>=1}
NPDA for accepting the language L = {an
bn cm | m,n>=1}
NPDA for accepting the language L = {am
b(2m) | m>=1}
▲
NPDA for accepting the language L =
{ambncpdq | m+n=p+q ; m,n,p,q>=1}

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 17/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Construct Pushdown automata for L =

{a(2*m)c(4*n)dnbm | m,n ≥ 0}
NPDA for accepting the language L =
{ambnc(m+n) | m,n≥1}
NPDA for accepting the language L =
{amb(m+n)cn | m,n≥1}
NPDA for accepting the language L =
{a2mb3m | m≥1}
NPDA for accepting the language L =
{amb(2m+1) | m≥1}
NPDA for L = {0i1j2k | i==j or j==k ; i , j , k >=
1}
Closure Properties of Context Free
Languages
Ambiguity in CFG and CFL
Simplifying Context Free Grammars
Converting Context Free Grammar to
Chomsky Normal Form
Converting Context Free Grammar to
Greibach Normal Form
Relationship between grammar and
language
3. Context Sensitive langauges :
Context-sensitive Grammar (CSG) and
Language (CSL)
4. Turing machines and undecidability :
Recursive and Recursive Enumerable
Languages
Turing Machine
Halting Problem
Turing Machine for addition
Turing machine for subtraction
Turing Machine for subtraction | Set 2
Turing machine for multiplication
Turing machine for copying data
Construct a Turing Machine for language L
= {0n1n2n | n≥1}
Construct a Turing Machine for language L
= {wwr | w ∈ {0, 1}}
Construct a Turing Machine for language L
= {ww | w ∈ {0,1}}
Construct Turing machine for L = {anbm
a(n+m) | n,m≥1}
Construct a Turing machine for L = {aibjck |
i*j = k; i, j, k ≥ 1}
Proof that Hamiltonian Path is NP-
Complete
Proof that vertex cover is NP complete
Decidability
Decidable and undecidable problems
Undecidability and Reducibility
Computable and non-computable
problems
CATEGORY ARCHIVES: THEORY OF
COMPUTATION & AUTOMATA
Last Minute Notes – Theory of
Computation

Section 10: Compiler Design 1. Introduction of Compiler : 1. Introduction of Comp

Introduction of Compiler design Compiler : ▲
Lexical analysis, parsing, syntax-directed
Phases of a Compiler MCQ on
translation
Symbol Table in Compiler Memory

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 18/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Runtime environments Static and Dynamic Scoping allocation and

Intermediate code generation Generation of Programming Languages compilation
Error Handling in Compiler Design process
Error detection and Recovery in Compiler 2. Lexical analysis :
Linker Lexical analysis
2. Lexical analysis : 3. Parsing :
Lexical Analysis Compiler
C program to detect tokens in a C program Theory | Set 1
Fast Lexical Analyzer Generator Compiler
3. Parsing : Theory | Set 2
Classi cation of Context Free Grammars 4. Syntax directed
Ambiguous Grammar transalation :
Why FIRST and FOLLOW? Parsing and
FIRST Set in Syntax Analysis Syntax directed
FOLLOW Set in Syntax Analysis translation
Program to calculate First and Follow sets 5. Runtime
of given grammar environments :
Introduction to Syntax Analysis .
Parsing Set 1 6. Intermediate code
Parsing Set 2 generation :
Parsing Set 3 Code
Shift Reduce Parser in Compiler Generation and
Classi cation of top down parsers Optimization
Operator grammar and precedence parser
4. Syntax directed transalation :
Syntax Directed Translation
S – attributed and L – attributed SDTs in
Syntax directed translation
5. Runtime environments :
Runtime Environments
6. Intermediate code generation :
Intermediate Code Generation
Three address code in Compiler
Detection of a Loop in Three Address Code
Code Optimization
Introduction of Object Code
Data ow analysis in Compiler
CATEGORY ARCHIVES: COMPILER DESIGN
Last Minute Notes – Compiler Design

Section 11: Digital Logic 1. Introduction of Boolean Algebra and Logic

Gates : Digital Logic : Digita
Boolean algebra
Logic Gates
Combinational and sequential circuits.
Properties of Boolean algebra Digital Logic (101)
Minimization
Minimization of Boolean Functions Number
Number representations and computer
Representation of Boolean Functions representation
arithmetic ( xed and oating point)
Canonical and Standard Form
Functional Completeness
K-Map
Implicants in K-Map
PDNF and PCNF
Variable entrant map (VEM)
Consensus theorem
Difference between combinational and
sequential circuit
2. Combinational Circuits :
Half Adder
Full Adder
Half Subtractor
Full Subtractor ▲
Half Adder and Half Subtractor using
NAND NOR gates

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 19/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

Encoders and Decoders

Encoder
Binary Decoder
Combinational circuits using Decoder
Multiplexers
Carry Look-Ahead Adder
Parallel Adder & Parallel Subtractor
BCD Adder
Magnitude Comparator
BCD to 7 Segment Decoder
Programmable Logic Array
Programming Array Logic
Read-Only Memory (ROM)
Static Hazards
3. Sequential Circuits :
Introduction of Sequential Circuits
Flip- op types and their Conversion
Synchronous Sequential Circuits
Counters
Ring Counter
n-bit Johnson Counter
Ripple Counter
Design counter for given sequence
Master Slave JK Flip Flop
Asynchronous Sequential Circuits
Shift Registers
Design 101 sequence detector
Amortized analysis for increment in
counter
4. Number Representation and Computer
Airthmetic :
Number System and base conversions
Code Converters – BCD(8421) to/from
Excess-3
Code Converters – Binary to/from Gray
Code
Program for Decimal to Binary Conversion
Program for Binary To Decimal Conversion
Program for Decimal to Octal Conversion
Program for Octal to Decimal Conversion
Program for Hexadecimal to Decimal
Conversion
Computer Arithmetic | Set – 1
Computer Arithmetic | Set – 2
Floating Point Representation
What’s difference between 1’s
Complement and 2’s Complement?
Booth’s Algorithm
Restoring Division Algorithm For Unsigned
Integer
Non-Restoring Division For Unsigned
Integer
CATEGORY ARCHIVES: DIGITAL
ELECTRONICS & LOGIC DESIGN
Last Minute Notes – Digital Electronics

Last Updated on : 25th April, 2019

Other Useful Links : ▲

1. Important Topics for GATE 2020 Computer Science

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 20/21
8/14/2019 GATE CS Topic wise preparation Notes | GeeksforGeeks

2. Last Minute Notes – GATE 2020

3. Top 5 Topics for Each Section of GATE CS Syllabus

4. GATE CS 2020 Syllabus

5. GATE CS 2019 important dates and links

6. Articles on Computer Science

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

8. GATE CS 2018 Mock Tests

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

Load Comments

5th Floor, A-118,

Sector-136, Noida, Uttar Pradesh - 201305
feedback@geeksforgeeks.org

COMPANY LEARN
About Us Algorithms
Careers Data Structures
Privacy Policy Languages
Contact Us CS Subjects
Video Tutorials

PRACTICE CONTRIBUTE
Courses Write an Article
Company-wise Write Interview Experience
Topic-wise Internships
How to begin? Videos

@geeksforgeeks, Some rights reserved

https://www.geeksforgeeks.org/gate-cs-notes-gq/ 21/21