GATE CS Topic Wise Preparation Notes - GeeksforGeeks

2/12/24, 6:07 PM GATE CS Topic wise preparation Notes | GeeksforGeeks
GATE CS Notes (According to GATE 2024 Syllabus)

Read
GATE stands for Graduate Aptitude Test in Engineering. GATE is a national-level exam conducted by
IISc-Bangalore and the seven old IITs; GATE 2024 is going to be conducted by IISc-Bangalore. GATE 2024
Notification is already released by IISC Bangalore and Registration Process is closed now. After clearing
the GATE exam, candidates are eligible for Master of Technology (M.Tech)/Master of Engineering (ME) from
the most prestigious institutes, and job opportunities in PSUs (Public Sector Undertakings). It is a com-
puter-based online exam and the main goal of GATE CSE is to test the technical aptitude of engineers.
The GATE Computer Science exam is generally conducted in the first or second week of February, and the
GATE score is valid for 3 years. The GATE 2024 Exam is going to happen on 3rd, 4th, 10th and 11th
February,2024. The exam is conducted once a year. The GATE exam consists of 65 questions, including 10
General Aptitude and 55 core subject questions. The duration of the exam is 3 hours.
There are three types of questions that come into the GATE exam:
90% Refund @Courses Trending Now Data Structures & Algorithms
Multiple Choice Questions (MCQs)
Foundational Courses Data Science
Multiple Select Questions (MSQs)
Numerical Answer Type (NAT)
This GATE CS Tutorial will help you to understand the GATE Syllabus in a very organized man-
ner and helps you in preparing for the exams for each subject. In this tutorial page, you will find
the articles related to each topic that are mentioned in the GATE Syllabus as provided by IISC
Bangalore.
https://www.geeksforgeeks.org/gate-cs-notes-gq/ 1/43
...
Book your date today
Book Now *Terms & conditions apply
General Aptitude
The syllabus or important topics of General Aptitude for the GATE CSE exam are provided below.
GENERAL APTITUDE NOTES FOR GATE CSE
Verbal Aptitude Basic English Grammar
Tenses
Articles
Adjectives
Prepositions
Conjunctions
Verb-Noun
Agreement
Parts of Speech
Basic Vocabulary
Words
Idioms
Phrases in context Reading and comprehension
Narrative sequencing
Quantitative Aptitude Data interpretation
Data graphs (bar graphs, pie charts, and other graphs representing data)
2- and 3-dimensional plot
Maps
Tables
Numerical computation and estimation
Ratios
Percentages
Powers
Exponents and logarithms permutations and combinations
Series
Mensuration and Geometry
Elementary Statistics and Probability
Analytical Aptitude Logic: deduction and induction
Analogy
Numerical relations and reasoning
Spatial Aptitude Spatial Aptitude
Transformation of shapes
Translation
Rotation
Scaling
Mirroring
Assembling
Grouping
Paper folding, cutting, and patterns in 2 and 3 dimensions
Engineering Mathematics
The syllabus or important topics of Engineering Mathematics for the GATE CSE exam are provided below.
Engineering Mathematics Notes for GATE CSE
Introduction to Matrix
Linear Algebra
Different operations on matrices
Properties of Determinants of Matrices
Determinant of a Matrix – Formula, Properties, Examples
Program for Rank of Matrix
Row Echelon Form
L U Decomposition
Null Space and Nullity of a Matrix
System of Linear Equations
Eigen Values and Eigen Vectors
Matrix Diagonalization
Finding Inverse of a Square Matrix using Cayley Hamilton
Introduction to Probability
Probability
Random Variables
Mean, Variance, and Standard Deviation
Law of total probability
Conditional Probability
Bayes’s formula for Conditional Probability
Probability Distribution
Uniform Distribution
Exponential Distribution
Normal Distribution
Binomial Distribution
Poisson Distribution
Covariance and Correlation
Limits, Continuity and Differentiability

Calculus
Introduction to Limits
Indeterminate Forms
Logarithmic Differentiation – Continuity and Differentiability
Lagrange’s Mean Value Theorem
Rolle’s Mean Value Theorem
Cauchy’s mean value theorem
Taylor’s Theorem and Taylor series
Maclaurin series
Euler’s Formula
Chain Rule Derivative – Theorem, Proof & Examples
Indefinite Integrals
Finding the Various nth term of any polynomial sequence
Application of Derivative – Maxima and Minima | Mathematics
Absolute Minima and Maxima
Sequence and Series
Summation Formula
CATEGORY ARCHIVES: ENGINEERING MATHEMATICS

Misc
Last Minute Notes – Engineering Mathematics
Discrete Mathematics
The syllabus or important topics of Discrete Mathematics for the GATE CSE exam are provided below.
DISCRETE MATHEMATICS NOTES FOR GATE CSE
Introduction to Propositional Logic

Propositional and First-Order Logic
Proposition Laws and Algebra
Propositional Equivalence
Predicates and Quantifiers Set 1
Predicates and Quantifiers Set 2
Some theorems on Nested Quantifiers
Rules of Inference
Consensus theorem
Introduction to Set Theory

Sets, Relations, Functions, Partial or-
Set Operations in Set Theory
ders,
Power Set and its Properties
and Lattices. Monoids, Groups
Cartesian Product of Two Sets
Relations and their types
Relations and their representations
Representing Relations
Closure of Relations and Equivalence Relations
Properties and Types of Functions
Inverse functions and composition of functions
Total number of possible functions
Number of possible equivalence relations
Groups
Sub-group and Order of Group
Modular Addition
Multiplication Modulo
Partial Orders and Lattices
Types of Lattices
Hasse Diagrams
Introduction to Proofs
Combinatorics: Counting,
Combinatorics Basics
Recurrence
Pigeonhole Principle
Relations, Generating Functions
PnC and Binomial Coefficients
Generalized PnC Set 1
Generalized PnC Set 2
Inclusion-Exclusion and its various Applications
Corollaries of Binomial Theorem
Introduction of Generating Functions
Introduction to Graph Theory

Graphs: Connectivity, Matching,
Graph Theory Basics
Coloring
Walks, Trails, Paths, Cycles, and Circuits in Graph
Number of nodes and height of a binary tree
Havel-Hakimi Theorem
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 in Graph Theory
Graph theory practice questions
Data Structures & C Programming
The syllabus or important topics of Data Structures & C Programming for the GATE CSE exam are pro-
vided below.
DATA STRUCTURES & C PROGRAMMING NOTES FOR GATE CSE
Introduction to C Programming
Programming in C
Data Types in C
Variables in C
Operators in C
Functions in C
Scope of a Variable
Pointers in C
Enum, Struct & Union in C
Type Casting in C
Introduction to Recursion
Recursion
Types of Recursion
Introduction to Arrays
Arrays
1D, 2D and 3D Arrays
Row Major Order and Column Major Order
Introduction to Stack
Stacks
Implementation of Stack using SLL
Applications, Advantages and Disadvantages of Stack
Infix to Postfix
Postfix Evaluation
Towers of Hanoi
Fibonaaci Series
Introduction to Queue
Queues
Implementation of Queue using Array
Implementation of Queue using Linked List
Implementation of Queue using Stack
Circular Queue
Priority Queue
Double Ended Queue
Introduction to Linked List

Linked List
Single Linked List(SLL)
Double Linked List(DLL)
Circular Linked List
Introduction to Trees
Trees
Introduction to Binary Search Tree

Binary Search Trees
BST Insertion
BST Deletion
AVL Trees
Tree Traversal
Introduction to Heap
Binary Heaps
Time Complexity of Building a Heap
Advanatges and Disadvanatges of Heap
Introduction to Graphs
Graphs
BFS in Graph
DFS in Graph
Types of Graph and Examples
Graph and its Representations
Basic Properties of Graph
Applications, Advanatges and Disadvantages of Graph
Introduction to Hashing
Hashing
Hash Function and Types
Collision Resolution Technique
Chaining
Open Addressing (Linear Probing, Quadratic Probing, Double Hashing)
Quadratic Probing
Double Hashing
CATEGORY ARCHIVES: DATA STRUCTURES

Misc
CATEGORY ARCHIVES: C
Last Minute Notes – DATA STRUCTURE
Last Minute Notes – C/C++
Algorithms
The syllabus or important topics of Algorithms for the GATE CSE exam are provided below.
ALGORITHMS NOTES FOR GATE CSE
Introduction of Algorithms
Asymptotic Analysis of Algorithms
Asymptotic Analysis
Worst, Average and Best Cases
Asymptotic Notations
Analysis of Loops
Small ‘o’ and Small ‘Omega’ Notation
What does ‘Space Complexity’ mean?
Introduction to Recurrence Relations

Recurrence Relations
Master Theorem
Different types of recurrence relations and their

solutions
Introduction to Divide and Conquer

Divide and Conquer
Binary Search
Merge Sort
Merge Sort for Linked Lists
How to make Mergesort to perform O(n) compar-

isons in best case?
QuickSort
Iterative Quick Sort
QuickSort on Singly Linked List
Median of two sorted arrays
Count Inversions in an array Using Merge Sort
Closest Pair of Points
Strassen’s Matrix Multiplication
Sort a nearly sorted (or K sorted) array
Search in an almost sorted array
K-th Element of Two Sorted Arrays
K’th Smallest/Largest Element in Unsorted Array
Introduction to Greedy Algorithms

Greedy Techniques
Activity Selection Problem
Job Sequencing Problem
Huffman Coding
Efficient Huffman Coding for Sorted Input
Fractional Knapsack Problem
Optimal File Merge Patterns
Kruskal’s Minimum Spanning Tree Algorithm
Prim’s Minimum Spanning Tree (MST)
Prim’s MST for Adjacency List Representation
Dijkstra’s shortest path algorithm
Dijkstra’s Algorithm for Adjacency List

Representation
Introduction to Graph Algorithms
Breadth First Traversal or BFS for a Graph
Depth First Traversal or DFS for a Graph
Applications of Depth First Search
Detect Cycle in a Directed Graph
Topological Sorting
Bellman–Ford Algorithm
Floyd Warshall Algorithm
Shortest path with exactly k edges in a directed and

weighted graph
Biconnected graph
Articulation Points (or Cut Vertices) in a Graph
Check if a graph is strongly connected (Kosaraju’s

Theoram)
Bridges in a graph
Transitive closure of a graph
Introduction to Dynamic Programming

Dynamic Programming
Overlapping Subproblems Property
Optimal Substructure Property
Longest Common Subsequence
Matrix Chain Multiplication
0-1 Knapsack Problem
Min Cost Path
Subset Sum Problem
Bellman–Ford Algorithm
Floyd Warshall Algorithm
Total number of non-decreasing numbers with n

digits
Smallest power of 2 greater than or equal to n
Introduction to Searching Algorithms

Searching, Sorting, Technique-based
Introduction to Sorting Algorithm
Theorem and Hashing
Linear Search
Linear Search vs Binary Search
Binary Search
Selection Sort
Bubble Sort
Insertion Sort
Merge Sort
QuickSort
Heap Sort
Counting Sort
Top 20 Hashing Technique based Interview

Misc Questions
CATEGORY ARCHIVES: ALGORITHMS
Last Minute Notes – Algorithms
Theory of Computation
The syllabus or important topics of the Theory of Computation for the GATE CSE exam are provided
below.
THEORY OF COMPUTATION NOTES FOR GATE CSE
Introduction of Theory of Computation

Regular Expression, Languages,
Introduction to Finite Automata
Grammar, and Finite Automata Designing Deterministic Finite Automata Set 1
Designing Deterministic Finite Automata Set 2
Designing Deterministic Finite Automata (Set 3)
DFA machines accepting odd number of 0’s or/and even number

of 1’s
DFA for accepting the language L = {anbm | n+m=even}
DFA for Strings not ending with “THE”
Union process in DFA
Concatenation process in DFA
Minimization of DFA
Designing Non-Deterministic Finite Automata (Set 1)
Designing Non-Deterministic Finite Automata (Set 3)
Conversion from NFA to DFA
NFA with epsilon move to DFA Conversion
Regular Expressions, Regular Grammar and Regular Languages
How to write Regular Expressions?
How to identify if a language is regular or not
Generating regular expression from finite automata
Designing Finite Automata from Regular Expression
Closure properties of Regular languages
Introduction To Grammar in Theory of Computation
Chomsky Hierarchy
Pumping Lemma
Mealy and Moore Machines
Difference between Mealy machine and Moore machine
Union & Intersection of Regular languages with CFL
Introduction to Context-sensitive Grammar (CSG) and Language

Context Sensitive Language
(CSL)
Introduction to Recursive and Recursive Enumerable Languages

Turing Machines and
Introduction to Turing Machine
Undecidability
Halting Problem
Turing Machine for addition
Turing machine for subtraction
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 a Turing machine for L = {aibjck | i*j = k; i, j, k ≥ 1}
Types of Complexity Classes | P, NP, CoNP, and NP hard
Introduction to NP-Completeness
Decidability
Decidable and undecidable problems
Undecidability and Reducibility
Computable and non-computable problems
CATEGORY ARCHIVES: THEORY OF COMPUTATION &

Misc AUTOMATA
Last Minute Notes – Theory of Computation
Compiler Design
The syllabus or important topics of Compiler Design for the GATE CSE exam are provided below.
COMPILER DESIGN NOTES FOR GATE CSE
Introduction of Compiler design

Lexical Analysis, Parsing, Syntax-di-
Phases of a Compiler
rected
Introduction to Compiler
Symbol Table in Compiler
Static and Dynamic Scoping
Generation of Programming Languages
Error Handling in Compiler Design
Error detection and Recovery in Compiler
Linker
Lexical Analysis
Fast Lexical Analyzer Generator
Classification of Context Free Grammars
Ambiguous Grammar
Removal of ambiguity
Why FIRST and FOLLOW?
FIRST Set in Syntax Analysis
FOLLOW Set in Syntax Analysis
Program to calculate First and Follow sets of given

grammar
Introduction to Syntax Analysis
Parsing Set 1
Bottom Up or Shift Reduce Parsers
SLR, CLR and LALR Parsers
Shift Reduce Parser in Compiler
Classification of top down parsers
Backtracking(Top down parser)
Recursive descent
Operator grammar and precedence parser
Practice Question on Lexical analysis, parsing, syntax-

directed
Runtime Environments
Runtime Environment
Stack Allocation
Heap Allocation
Parameters Passing
Pass by Value
Pass by Reference
Pass by Copy-restore
Pass by Name
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 flow analysis in Compiler
CATEGORY ARCHIVES: COMPILER DESIGN
Last Minute Notes – Compiler Design
Compile Time Evaluation

Local Optimization
Variable Propagation
Constant Propagation
Constant Folding
Copy Propagation
Common Sub Expression Elimination
Dead Code Elimination
Unreachable Code Elimination
Function Inlining
Induction Variable and Strength Reduction
Code Motion or Frequency Reduction
Loop Jamming
USE, IN & OUT

Data Flow Analysis
Data flow analysis
Database Management System
The syllabus or important topics of Database Management System for the GATE CSE exam are provided
below.
DATABASE MANAGEMENT SYSTEM NOTES FOR GATE CSE
Introduction to Database Management System

Introduction
DBMS 3-Tier Architecture
DBMS 2-Level, 3-Level Architecture
Need for DBMS
Challenges of Database Security in DBMS
Advantages of DBMS over File system
Data Abstraction and Data Independence
Introduction to ER Model
ER-Model
Recursive Relationships
Minimization of ER Diagram
Enhanced ER Model
Mapping from ER Model to Relational Model
Introduction to Relational Model

Relational Model (relational algebra, tuple
Relational Algebra – Overview
calculus)
Anomalies in Relational Model
Relational Model Introduction and Codd Rules
Keys in Relational Model (Candidate, Super, Primary,

Alternate and Foreign)
Relational Algebra – Extended Operators
Tuple Relational Calculus
How to solve Relational Algebra problems for GATE
Introduction to Database Normalization

Database Design (integrity constraints,
Normal Forms in Database Normalization
normal forms)
Functional Dependency and Attribute Closure
Types of Functional Dependency
Finding Attribute Closure and Candidate Keys using

Functional Dependencies
Number of possible Superkeys
Lossy and Lossless Decomposition
Dependency Preserving Decomposition
Lossless Join and Dependency Preserving

Decomposition
DBMS | How to find the highest normal form of a

relation
Minimum relations satisfying 1NF
Equivalence of Functional Dependencies
Canonical Cover
Multivalued Dependency
Introduction to Structured Query Language (SQL)

Structured Query Languages (SQL)
Parts of SQL
Data Manipulation Language in SQL
Data Definition in SQL
Joins in SQL
Inner VS Outer Join
Having Vs Where Clause
Database Objects
Nested Queries in SQL
Join operation Vs nested query
Indexing in Databases
SQL Clauses
SQL Views
SQL Indexes
SQL queries on clustered and non-clustered Indexes
SQL Tutorial
Introduction to Concurrency Control

Transactions and Concurrency Control
Database Recovery Techniques
ACID Properties in DBMS
Log based recovery
Why recovery is needed?
Transaction Isolation Levels in DBMS
Types of Schedules in Concurrency Control
Types of Recoverability of Schedules in DBMS
Conflict Serializability
Precedence Graph For Testing Conflict Serializability
How to test if two schedules are View Equal or not ?
Recoverability of Schedules
Cascadeless in DBMS
Deadlock in DBMS
Starvation in DBMS
Transaction and Concurrency Control
Lock Based Protocol
Concurrency Control Techniques
Two Phase Locking (2-PL)
Categories of Two Phase Locking (2-PL)
Thomas Write Rule
Timestamp Ordering Protocols
Multiple Granularity Locking
Graph Based Protocol
Introduction to TimeStamp and Deadlock Prevention

Schemes
Implementation of Locking in DBMS
Introduction to Indexing in Databases

File Structures (sequential files, indexing,
File Organization
B and B+ trees)
Hashing in DBMS
Introduction to B-Tree
Insertion in B-Tree
Deletion in B-Tree
Introduction to B+ Trees
Insertion in a B+ tree
Difference between B tree and B+ tree
CATEGORY ARCHIVES: DBMS

Misc
Last Minute Notes – DBMS
Computer Networks
The syllabus or important topics of Computer Networks for the GATE CSE exam are provided below.
COMPUTER NETWORKS NOTES FOR GATE CSE
Basics of Computer Networking

Network Fundamental
Network goals
and
Network Topologies
Physical Layer Types of area networks – LAN, MAN and WAN
Types of Transmission Media
Transmission Modes in Computer Networks

(Simplex, Half-Duplex and Full-Duplex)
Redundant link problems
Difference between Unipolar, Polar and

Bipolar Line Coding Schemes
Difference between Broadband and

Baseband Transmission
Let’s experiment with Networking
Layers of OSI Model
TCP/IP Model
Multiple Access Protocols

Data Link Layer
P2P(Peer To Peer) File Sharing
Framing In Data Link Layer
LAN Technologies | ETHERNET
Ethernet Frame Format
Token Ring frame format
Bit Stuffing
Difference between Byte stuffing and Bit stuffing
Hamming Code
Aloha
Slotted Aloha
Pure Aloha
Carrier sense multiple access (CSMA)
Controlled Access Protocols
Back-off Algorithm for CSMA/CD
Collision Detection in CSMA/CD
Efficiency of CSMA/CD
Efficiency of Token Ring
Computer Networks | Error Detection
Stop and Wait ARQ
Sliding Window Protocol | Set 1 (Sender Side)
Sliding Window Protocol | Set 2 (Receiver Side)
Sliding Window Protocol | Set 3 (Selective Repeat)
Sliding Window protocols Summary With Questions
Program to remotely Power On a PC over the internet using the Wake-on-

LAN protocol
Program to calculate the Round Trip Time (RTT)
To calculate the expected Round Trip Time
Introduction of MAC Address
Collision Avoidance in wireless networks
Maximum data rate (channel capacity) for noiseless and noisy channels
Switches
Routers
Types of switches
Internetworking
Network Layer
Line Configuration in Computer Networks
Difference between Unicast, Broadcast 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
Subnetting in Computer Network
Supernetting
Computer Networks | Longest Prefix Matching in Routers
Program to determine class, Network and Host ID of an IPv4 address
C Program to find 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)
Classification 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 infinity problem
Internet Control Message Protocol (ICMP) | Computer Networks
OSPF protocol fundamentals
OSPF protocol States
OSPF router roles and configuration
Root Bridge Election in Spanning Tree Protocol
Types of Spanning Tree Protocol (STP)
Routing Information Protocol (RIP)
Routing Interface Protocol (RIP) V1 & V2
Link state advertisement (LSA)
Administrative Distance (AD) and Autonomous System (AS)
Circuit Switching
Packet Switching and Delays
Differences between Virtual Circuits & Datagram Networks
Computer Network | Circuit Switching VS Packet Switching
RARP
Traceroute
How ARP works?
ARP, Reverse ARP(RARP), Inverse ARP(InARP), Proxy ARP and Gratuitous

ARP
Packet flow in the same network
Packet flow 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?
Transport Layer responsibilities

Transport Layer
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 flags
TCP Server-Client implementation in C
User Datagram Protocol (UDP)
Differences between TCP and UDP
Multiplexing and Demultiplexing in Transport Layer
Protocols in Application Layer

Application Layer
DNS (Domain Name Server) | NetWorking
Address Resolution in DNS
DNS Spoofing or DNS Cache poisoning
Why does DNS use UDP and not TCP?
Dynamic Host Configuration 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
HTTP parallel and non parallel
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
Wifi protected setup (WPS)
Wifi protected access (WPA)
LiFi vs. WiFi
Network Devices (Hub, Repeater, Bridge, Switch, Router and Gateways)
GATE PYQs
Misc
Operating System
The syllabus or important topics of Operating System for the GATE CSE exam are provided below.
OPERATING SYSTEM NOTES FOR GATE CSE
Introduction of System Call

Processes, Threads, CPU
Operating System | Thread
Scheduling
Threads and its types
Difference between thread and process
Multithreading
Multi threading models
Benefits of Multithreading
Process-based and Thread-based Multitasking
User Level thread Vs Kernel Level thread
Microkernel
Monolithic Kernel and key differences from Microkernel
Difference between multitasking, multithreading and

multiprocessing
Context Switching in OS
Fork function call
fork() in C
Process Synchronization | Introduction

Inter‐process Communication,
Operating System | Process Synchronization | Set 2
Concurrency, and Critical Section
Synchronization Inter Process Communication
IPC using Message Queues
IPC through shared memory
Interprocess Communication: Methods
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
Process Synchronization | Monitors
Dining Philosopher Problem
Dining-Philosophers Solution Using Monitors
Dining Philosopher Problem Using Semaphores
Priority Inversion : What the heck !
What’s difference between Priority Inversion and Priority

Inheritance ?
Deadlock, Starvation, and Livelock
Process Management | Deadlock Introduction

Deadlock
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
Methods of resource allocation to processes by operating system
Mapping virtual address to physical addresses

Main Memory Management
Logical vs Physical Address in Operating System
Paging
Page Table Entries
Multilevel Paging
Inverted Page Table
Segmentation
Demand Paging
Memory Management | Partition Allocation Method
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
Virtual Memory
Virtual Memory
Secondary memory – Hard disk drive
Page Fault Handling
Page Replacement Algorithms
Belady’s Anomaly
Program for Optimal Page Replacement Algorithm
Techniques to handle Thrashing
What exactly Spooling is all about?
Difference between Spooling and Buffering
Overlays in Memory Management
Swap Space
File Systems
File System and Disk
Structures of Directory
Scheduling
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
Digital Logic and Design
The syllabus or important topics of Digital Logic and Design for the GATE CSE exam are provided below.
DIGITAL LOGIC & DESIGN NOTES FOR GATE CSE
Logic Gates
Introduction of Boolean Algebra and Logic
Properties of Boolean algebra
Gates
Logical gates in logic design
Boolean functions
Minimization of Boolean Functions
Representation of Boolean Functions
Canonical and Standard Form
Functional Completeness
K-Map
Implicants in K-Map
Prime implicants and Explicit implicants
PDNF and PCNF
Variable entrant map (VEM)
Consensus theorem
Grey Code
Combinational Circuit
Half Adder
Full Adder
Half Subtractor
Full Subtractor
Half Adder and Half Subtractor using NAND NOR

gates
Encoders and Decoders
Encoder
Binary Decoder
Combinational circuits using Decoder
Multiplexers
De-MUX
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
Introduction of Sequential Circuits

Sequential Circuit
Flip-flop 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
S-R FlipFlop
T Flipflop
D Flipflop
Asynchronous Sequential Circuits
Shift Registers
Design 101 sequence detector
Amortized analysis for increment in counter
Number System and base conversions

Number Representation and Computer
Code Converters – BCD(8421) to/from Excess-3
Arithmetic
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
Computer Organization and Architecture
The syllabus or important topics of Computer Organization and Architecture for the GATE CSE exam are
provided below.
COMPUTER ORGANIZATION AND ARCHITECTURE NOTES FOR GATE CSE
Introduction to Computer Organization and Architecture

Machine Instructions and
Basic Computer Instructions
Addressing Modes
Instruction Design and Format
Computer Arithmetic
Microprogrammed Control
Memory Organization
A simple understanding of Computer
Issues in Computer Design
Computer System Level Hierarchy
Computer Architecture and Computer Organization
Von Neumann architecture
Harvard Architecture
Von Neumann architecture vs Harvard Architecture
Instruction Formats (Zero, One, Two and Three Address

Instruction)
Stack based CPU Organization
General Register based CPU Organization
Single Accumulator based CPU organization
Problem Solving on Instruction Format
Addressing Modes
Machine Instructions
Difference between CALL and JUMP instructions
Simplified Instructional Computer (SIC)
Hardware architecture (parallel computing)
Flynn’s taxonomy
Generations of computer
Amdahl’s law and its proof
Control Unit and design

ALU, Data‐Path and Control Unit
Hardwired v/s Micro-programmed Control Unit
Hardwired Vs Micro-programmed Control unit | Set 2
Horizontal micro-programmed Vs Vertical micro-pro-

grammed control unit
Synchronous Data Transfer
Asynchronous Data Transfer
Pipelining
Instruction Pipelining
Types of 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
Memory Hierarchy Design and its Characteristics

Cache Memory
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
I/O Interface (Interrupt and DMA Mode)

I/O interface (Interrupt and DMA
Input-Output Processor
mode)
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
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech land-
scape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable
prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've al-
ready empowered, and we're here to do the same for you. Don't miss out - check it out now!
Looking for a place to share your ideas, learn, and connect? Our Community portal is just the spot! Come
join us and see what all the buzz is about!
Participate in Three 90 Challenge! Enroll in any GeeksforGeeks course and get 90% refund by
completing 90% course. Explore offer now.
Last Updated : 12 Dec, 2023
Share your thoughts in the comments Add Your Comment
Similar Reads
How to Learn Python from Scratch in 2024 GATE
GATE Quiz GATE CS 2016 Mock Solutions
GATE CS 2016 Mock Test - Results GATE CS 2016
GATE CS 2016 Official Papers GATE CS MOCK 2017
GATE 2017 MOCK TEST GATE CS 2017 Mock Test - Results
A-143, 9th Floor, Sovereign Corporate

Tower, Sector-136, Noida, Uttar Pradesh -
201305
Company Explore
About Us Job-A-Thon Hiring Challenge
Legal Hack-A-Thon
Careers GfG Weekly Contest
In Media Offline Classes (Delhi/NCR)
Contact Us DSA in JAVA/C++
Advertise with us Master System Design
GFG Corporate Solution Master CP
Placement Training Program GeeksforGeeks Videos
Apply for Mentor Geeks Community
Languages DSA
Python Data Structures
Java Algorithms
C++ DSA for Beginners
PHP Basic DSA Problems
GoLang DSA Roadmap
SQL Top 100 DSA Interview Problems
R Language DSA Roadmap by Sandeep Jain
Android Tutorial All Cheat Sheets

Tutorials Archive
Data Science & ML HTML & CSS

Data Science With Python HTML
Data Science For Beginner CSS
Machine Learning Tutorial Web Templates
ML Maths CSS Frameworks
Data Visualisation Tutorial Bootstrap
Pandas Tutorial Tailwind CSS
NumPy Tutorial SASS
NLP Tutorial LESS
Deep Learning Tutorial Web Design
Python Computer Science

Python Programming Examples GATE CS Notes
Django Tutorial Operating Systems
Python Projects Computer Network
Python Tkinter Database Management System
Web Scraping Software Engineering
OpenCV Python Tutorial Digital Logic Design
Python Interview Question Engineering Maths
DevOps Competitive Programming

Git Top DS or Algo for CP
AWS Top 50 Tree
Docker Top 50 Graph
Kubernetes Top 50 Array
Azure Top 50 String
GCP Top 50 DP
DevOps Roadmap Top 15 Websites for CP
System Design JavaScript

High Level Design JavaScript Examples
Low Level Design TypeScript
UML Diagrams ReactJS
Interview Guide NextJS
Design Patterns AngularJS

OOAD NodeJS
System Design Bootcamp Lodash
Interview Questions Web Browser
NCERT Solutions School Subjects

Class 12 Mathematics
Class 11 Physics
Class 10 Chemistry
Class 9 Biology
Class 8 Social Science
Complete Study Material English Grammar
Commerce UPSC Study Material

Accountancy Polity Notes
Business Studies Geography Notes
Economics History Notes
Management Science and Technology Notes
HR Management Economy Notes
Finance Ethics Notes
Income Tax Previous Year Papers
SSC/ BANKING Colleges

SSC CGL Syllabus Indian Colleges Admission & Campus Experiences
SBI PO Syllabus List of Central Universities - In India
SBI Clerk Syllabus Colleges in Delhi University
IBPS PO Syllabus IIT Colleges
IBPS Clerk Syllabus NIT Colleges
SSC CGL Practice Papers IIIT Colleges
Companies Preparation Corner

META Owned Companies Company-Wise Recruitment Process
Alphabhet Owned Companies Resume Templates
TATA Group Owned Companies Aptitude Preparation
Reliance Owned Companies Puzzles
Fintech Companies Company-Wise Preparation
EdTech Companies
Exams More Tutorials

JEE Mains Software Development
JEE Advanced Software Testing
GATE CS Product Management
NEET SAP
UGC NET SEO - Search Engine Optimization
Linux
Excel
Free Online Tools Write & Earn

Typing Test Write an Article
Image Editor Improve an Article
Code Formatters Pick Topics to Write
Code Converters Share your Experiences
Currency Converter Internships
Random Number Generator
Random Password Generator
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved

GATE CS Topic Wise Preparation Notes - GeeksforGeeks

Uploaded by

Copyright:

Available Formats

GATE CS Topic Wise Preparation Notes - GeeksforGeeks

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

GATE CS Topic Wise Preparation Notes - GeeksforGeeks

Uploaded by

Copyright:

Available Formats

2/12/24, 6:07 PM GATE CS Topic wise preparation Notes | GeeksforGeeks

GATE CS Notes (According to GATE 2024 Syllabus)

Book your date today

Book Now *Terms & conditions apply

GENERAL APTITUDE NOTES FOR GATE CSE

Verbal Aptitude Basic English Grammar

Phrases in context Reading and comprehension

Quantitative Aptitude Data interpretation

2- and 3-dimensional plot

Numerical computation and estimation

Exponents and logarithms permutations and combinations

Mensuration and Geometry

Analytical Aptitude Logic: deduction and induction

Numerical relations and reasoning

Spatial Aptitude Spatial Aptitude

Paper folding, cutting, and patterns in 2 and 3 dimensions

Engineering Mathematics Notes for GATE CSE

Properties of Determinants of Matrices

Determinant of a Matrix – Formula, Properties, Examples

Program for Rank of Matrix

Row Echelon Form

Null Space and Nullity of a Matrix

System of Linear Equations

Eigen Values and Eigen Vectors

Finding Inverse of a Square Matrix using Cayley Hamilton

Mean, Variance, and Standard Deviation

Law of total probability

Bayes’s formula for Conditional Probability

Covariance and Correlation

Limits, Continuity and Differentiability

Logarithmic Differentiation – Continuity and Differentiability

Lagrange’s Mean Value Theorem

Rolle’s Mean Value Theorem

Cauchy’s mean value theorem

Taylor’s Theorem and Taylor series

Chain Rule Derivative – Theorem, Proof & Examples

Finding the Various nth term of any polynomial sequence

Application of Derivative – Maxima and Minima | Mathematics

Absolute Minima and Maxima

Sequence and Series

CATEGORY ARCHIVES: ENGINEERING MATHEMATICS

DISCRETE MATHEMATICS NOTES FOR GATE CSE

Introduction to Propositional Logic

Predicates and Quantifiers Set 1

Predicates and Quantifiers Set 2

Some theorems on Nested Quantifiers

DISCRETE MATHEMATICS NOTES FOR GATE CSE

Introduction to Set Theory

Relations and their types

Relations and their representations

Closure of Relations and Equivalence Relations

Properties and Types of Functions

Inverse functions and composition of functions

Total number of possible functions

Number of possible equivalence relations

Sub-group and Order of Group

Partial Orders and Lattices

Generalized PnC Set 1

Generalized PnC Set 2