GATE CS Topic wise preparation Notes | GeeksforGeeks

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

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
2021 syllabus.

Attend daily free live GATE CS classes on GeeksforGeeks GATE CS Channel.

GATE 2020 Syllabus Learn Practice External Resources

Section 1: General 1. Numerical Ability : 1. Numerical Ability : 1. Numerical

Aptitude (GA) Ability :
Placements Placements
1. Verbal Aptitude : 2. Verbal Ability : 2. Verbal Ability : Book –
Quantitative
Basic English Placements | Placements Aptitude by
grammar: English | Error R.S.
tenses, articles, Detection and Aggarwal
adjectives, Correction
prepositions, 2. Verbal Ability :
Placements |
conjunctions, English | Notes –
verb-noun Passage/Sentence English
agreement, and Re-arrangement
other parts of
speech Placements |
English | Fill in
Basic the Blanks
vocabulary:
words, idioms, Placements |
and phrases in English |
context Reading Comprehension
and Passages
comprehension
Narrative
sequencing
2. Quantitative
Aptitude :
Data
interpretation:
data graphs
(bar graphs, pie
charts, and
other graphs
representing
data), 2- and 3-
dimensional
plots, maps, and
tables
 Numerical
computation
and estimation:
ratios,
percentages,
powers,
exponents and
logarithms,
permutations
and
combinations,
and series
Mensuration
and geometry
Elementary
statistics and
probability
3. Analytical
Aptitude :
Logic:
deduction and
induction
Analogy
Numerical
relations and
reasoning
4. Spatial Aptitude :
Transformation
of shapes:
translation,
rotation,
scaling,
mirroring,
assembling, and
grouping
Paper folding,
cutting, and
patterns in 2
and 3
dimensions

1. Discrete 1. Discrete 1. Discrete

Section 2: Mathematics
Mathematics : Mathematics : Mathematics :
Representation Propositional Video – MIT
1. Discrete
of Boolean and First Order Discrete
Mathematics :
Functions Logic Mathematics
Propositional Lectures
Properties of Set Theory &
and first order
Boolean algebra Algebra Notes – First
logic
Order Logic
PDNF and PCNF Combinatorics
Sets, relations,
in Discrete Book –
functions, Combinatorics |
Mathematics Set 1 Schaum’s
partial orders
PDF
and lattices. Functional
Combinatorics |
Monoids, Completeness MIT –
Set 2
Groups Lecture
Introduction to Graph Theory Notes
Combinatorics: Propositional
counting, Logic Set 1 2. Linear Algebra :
 recurrence
Introduction to Linear Algebra IISC – Video
relations,
Propositional 3. Probability : Lectures
generating
Logic Set 2
functions Papers –
Probability
Propositional GATE’s
Graphs: 4. Calculus :
Equivalence Explanation
connectivity, by NPTEL
matching, Predicates and Calculus
coloring Quantifiers Set 1 2. Linear Algebra :
2. Linear Algebra : Predicates and MIT – Linear
Quantifiers Set 2 Algebra
Matrices,
determinants Some theorems Book –
on Nested Linear
LU Quantifiers Algebra
decomposition
Rules of 3. Probability :
System of linear
Inference
equations Book –
Consensus Probability
Eigenvalues
theorem
and Notes –
eigenvectors Introduction to Probability
Proofs
3. Probability : 4. Calculus :
Combinatorics MIT – Video
Random
Basics
variables Lectures
Pigeonhole
Mean, median, Notes –
Principle
mode and Calculus
standard PnC and
Calculus
deviation Binomial
Coefficients
Uniform,
normal, Generalized PnC
exponential, Set 1
Poisson and Generalized PnC
binomial Set 2
distributions
Inclusion-
Conditional Exclusion and its
probability and various
Bayes theorem Applications
4. Calculus : Corollaries of
Limits, Binomial
Continuity and Theorem
Differentiability Introduction of
Maxima and Generating
Minima. Mean Functions
value theorem Generating
Integration Functions – Set 2
Set Theory |
Introduction
Set Theory | Set
Operations
Power Set and its
Properties
Relations and
their types
Relations and
their
representations
Representing
Relations
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
LU
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
Lagrange’s Mean
Value Theorem
Mean Value
Theorem |
Rolle’s Theorem
Cauchy’s mean
value theorem
Indefinite
Integrals
Finding nth term
of any
polynomial
sequence
Sequence, Series
and Summations
CATEGORY
ARCHIVES:
ENGINEERING
MATHEMATICS
Last Minute
Notes –
Engineering
Mathematics

Section 3: Algorithms
1. Asymptotic Analysis 1. Asymptotic
Algorithms :
of Algorithms : Analysis of
Searching, sorting, Algorithms :
Analysis of
hashing Video –
Algorithms | Set Analysis of
Asymptotic worst GeeksforGeeks
1 (Asymptotic Algorithms
case time and space Videos
Analysis)
2. Recurrence
complexity Video – Lectures
Analysis of Relations :
Algorithm design by
Algorithms | Set
Analysis of Ravindrababu
techniques : 2 (Worst,
greedy, dynamic Algorithms Ravula
Average and Best
(Recurrences)
programming and Cases) MIT –
divide‐and‐conquer Practice Set for Introduction to
Analysis of
Recurrence Algorithms
Graph traversals, Algorithms | Set
Relations
minimum spanning 3 (Asymptotic Book – CLRS
trees, shortest paths Notations) 3. Divide and Solutions
Conquer : Manual
Analysis of
Algorithms | Set MergeSort Visual – Data
Structures and
 4 (Analysis of Algorithms.
Divide and
Loops)
Conquer Notes – Big – O
Analysis of Notation
4. Greedy Techniques
Algorithm | Set 5
: Notes – Master
(Amortized
Theorem
Analysis Graph
Introduction) Minimum Notes –
Spanning Tree Extended Master
Analysis of
Theorem
algorithms | Graph Shortest
little o and little Paths Notes – Master
omega notations Theorem
Greedy
problems and
What does ‘Space Algorithms
answers
Complexity’ 5. Graph Based
mean? Algorithms :
Articles | Graph
Analysis of
Algorithms Graph
Traversals
2. Recurrence
Relations : 6. Dynamic
Programing :
Analysis of
Algorithm | Set 4 Dynamic
(Solving Programming
Recurrences) 7. Searching, Sorting
Different types of and Hashing :
recurrence Searching
relations and
Sorting
their solutions
Hashing
3. Divide and Conquer
: 8. Misc :
Divide and Misc
Conquer | Set 1 Commonly
(Introduction) Asked
Binary Search Algorithm
Interview
Why is Binary
Questions | Set
Search preferred
1
over Ternary
Search? Data Structures
and Algorithms
Merge Sort
| Set 1
Merge Sort for
Data Structures
Linked Lists
and Algorithms
Merge Sort for | Set 2
Doubly Linked
Data Structures
List
and Algorithms
How to make | Set 3
Mergesort to
Data Structures
perform O(n)
and Algorithms
comparisons in
| Set 4
best case?
Data Structures
QuickSort
and Algorithms
Iterative Quick | Set 5
Sort
Data Structures
QuickSort on and Algorithms
Singly Linked | Set 6
List
Data Structures
QuickSort on and Algorithms
Doubly Linked | Set 7
 List
Data Structures
When does the and Algorithms
worst case of | Set 8
Quicksort occur?
Data Structures
Why Quick Sort and Algorithms
preferred for | Set 9
Arrays and
Data Structures
Merge Sort for
and Algorithms
Linked Lists?
| Set 10
Write a program
Data Structures
to calculate
and Algorithms
pow(x,n)
| Set 11
Median of two Data Structures
sorted arrays
and Algorithms
Count Inversions | Set 12
in an array | Set
Data Structures
1 (Using Merge
and Algorithms
Sort)
| Set 13
Divide and
Data Structures
Conquer | Set 2
and Algorithms
(Closest Pair of
| Set 14
Points)
Data Structures
Divide and
and Algorithms
Conquer | Set 5
| Set 15
(Strassen’s
Matrix Data Structures
Multiplication) and Algorithms
| Set 16
Sort a nearly
sorted (or K Data Structures
sorted) array and Algorithms
| Set 17
Search in an
almost sorted Data Structures
array and Algorithms
| Set 18
K-th Element of
Two Sorted Data Structures
Arrays and Algorithms
| Set 19
K’th
Smallest/Largest Data Structures
Element in and Algorithms
Unsorted Array | | Set 20
Set 2 (Expected Data Structures
Linear Time) and Algorithms
Searching and | Set 21
Sorting Data Structures
4. Greedy Techniques : and Algorithms
| Set 22
Greedy
Algorithms | Set Data Structures
1 (Activity and Algorithms
Selection | Set 23
Problem) Data Structures
Job Sequencing and Algorithms
Problem | Set 1 | Set 24
(Greedy Data Structures
Algorithm) and Algorithms
Greedy | Set 25
Algorithms | Set Data Structures
and Algorithms
 3 (Huffman | Set 26
Coding)
Data Structures
Greedy and Algorithms
Algorithms | Set | Set 27
4 (Efficient
Data Structures
Huffman Coding
and Algorithms
for Sorted Input)
| Set 28
Greedy
Data Structures
Algorithms | Set and Algorithms
2 (Kruskal’s
| Set 29
Minimum
Spanning Tree Data Structures
Algorithm) and Algorithms
| Set 30
Greedy
Algorithms | Set Data Structures
5 (Prim’s and Algorithms
Minimum | Set 31
Spanning Tree Data Structures
(MST)) and Algorithms
Greedy | Set 32
Algorithms | Set Data Structures
6 (Prim’s MST for and Algorithms
Adjacency List | Set 33
Representation)
Data Structures
Applications of and Algorithms
Minimum | Set 34
Spanning Tree
Problem Data Structures
and Algorithms
Greedy | Set 35
Algorithms | Set
7 (Dijkstra’s
shortest path
algorithm)
Greedy
Algorithms | Set
8 (Dijkstra’s
Algorithm for
Adjacency List
Representation)
Greedy
Algorithm to find
Minimum
number of Coins
Strongly
Connected
Components
Greedy
Algorithms
5. Graph Based
Algorithms :
Graph and its
representations
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
Disjoint Set (Or
Union-Find) | Set
1 (Detect Cycle in
an Undirected
Graph)
Detect cycle in
an undirected
graph
Topological
Sorting
Longest Path in a
Directed Acyclic
Graph
Biconnected
Components
Bellman–Ford
Algorithm
Floyd Warshall
Algorithm
Shortest Path in
Directed Acyclic
Graph
Some interesting
shortest path
questions | Set 1
Shortest path
with exactly k
edges in a
directed and
weighted graph
Biconnected
Components
Biconnected
graph
Articulation
Points (or Cut
Vertices) in a
Graph
Check if a graph
is strongly
connected | Set 1
(Kosaraju using
DFS)
Bridges in a
graph
Transitive
closure of a
graph
Graph
Algorithms | DFS
and BFS |
 Minimum
Spanning Tree |
Shortest Paths |
Connectivity
6. Dynamic
Programing :
Dynamic
Programming |
Set 1
(Overlapping
Subproblems
Property)
Dynamic
Programming |
Set 2 (Optimal
Substructure
Property)
Dynamic
Programming |
Set 4 (Longest
Common
Subsequence)
Dynamic
Programming |
Set 8 (Matrix
Chain
Multiplication)
Dynamic
Programming |
Set 10 ( 0-1
Knapsack
Problem)
Dynamic
Programming |
Set 6 (Min Cost
Path)
Dynamic
Programming |
Set 25 (Subset
Sum Problem)
Dynamic
Programming |
Set 23 (Bellman–
Ford Algorithm)
Dynamic
Programming |
Set 16 (Floyd
Warshall
Algorithm)
Total number of
non-decreasing
numbers with n
digits
Vertex Cover
Problem | Set 2
(Dynamic
Programming
Solution for
Tree)
 Smallest power
of 2 greater than
or equal to n
Travelling
Salesman
Problem | Set 1
(Naive and
Dynamic
Programming)
Travelling
Salesman
Problem | Set 2
(Approximate
using MST)
Dynamic
Programming
7. Searching, Sorting
and Hashing :
Linear Search
Linear Search vs
Binary Search
Selection Sort
Bubble Sort
Insertion Sort
Heap Sort
Radix Sort
Counting Sort
Hashing | Set 1
(Introduction)
Hashing | Set 2
(Separate
Chaining)
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
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

1. Programming in C, 1. Programming in C,
Programming and Data Structures :
Recursion : Recursion :
Data Structures
C Programming Principle of
Video – NPTEL
programming
Programming in C, Recursion lectures
languages | Set
Recursion
Tail Recursion 1 Visual – Data
Arrays, stacks, Structure
Recursive C Language
queues, linked lists, Visualizations
functions
trees, binary search Recursion
trees, binary heaps, 2. Array, Stack, Queue
C Language |
graphs :
Set 1
Arrays
C Language |
Stack Set 2
Queue C Language |
3. Linked Lists : Set 3

Linked List C Language |

Set 4
4. Trees, Binary
search trees, Binary C Language |
heaps : Set 5

Binary Tree C Language |

Set 6
Binary Search
Tree C Language |
Set 7
Binary Heap
C Language |
5. Graphs : Set 8
Graph C Language |
Set 9
 CATEGORY C Language |
ARCHIVES: DATA Set 10
STRUCTURES
2. Array, Stack,
CATEGORY Queue :
ARCHIVES: C
Array
Last Minute
Stack
Notes – DATA
STRUCTURE Queue
Last Minute 3. Linked Lists :
Notes – C/C++ 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
Commonly
Asked Data
Structure
Interview
Questions | Set
1

Section 5: Operating Operating Systems :

1. Processes, threads, 1. Processes, threads,
Systems
CPU scheduling : CPU scheduling :
Video – NPTEL
What happens Process
Processes, System Lectures
when we turn on Management
calls, threads, CPU
computer? Video – Lectures
scheduling CPU Scheduling
by
Introduction of
Inter‐process 2. Inter‐process Ravindrababu
Operating
communication, communication, Ravula
System
concurrency and concurrency and Notes –
synchronization, Functions of synchronization : VirginiaTech
deadlock Operating
Concurrency Univ. Web
System
Memory and resource
management and Types of synchronization Notes – Galvin
virtual memory Operating
3. Deadlock : Lecture Slides
Systems
I/O scheduling, File Book – William
Deadlock
systems Dual Mode
Stallings Practice
operations in OS 4. Main memory
Problems and
management :
Privileged and Solutions
Non-Privileged Memory
Notes – User and
Instructions Management
Kernel Level
32-bit and 64-bit 5. Virtual memory : Threads
operating
systems
Virtual Memory Notes – Virtual
Real time | Questions Memory and
systems Cache
6. File system and
Operating disk scheduling : Notes –
Systems | Need Segmentation
Input Output
and Functions and Paging
Systems
Process Notes – Some
UNIX – I Node
Management | Interesting
Introduction Commonly problems on
Asked Virtual memory
States of a
Operating
process
Systems
Process Table Interview
and Process Questions | Set
Control Block 1
(PCB)
Operating
Process Systems | Set 1
Scheduler
Operating
Difference Systems | Set 2
between Operating
dispatcher and
Systems | Set 3
scheduler
Operating
Process
Systems | Set 4
Management |
CPU Scheduling Operating
Systems | Set 5
Preemptive and
Non-Preemptive Operating
Scheduling Systems | Set 6
Program for Operating
FCFS Scheduling Systems | Set 7
| Set 1 Operating
Program for Systems | Set 8
FCFS Scheduling Operating
| Set 2 (Processes Systems | Set 9
with different
arrival times) Operating
Systems | Set 10
Convoy Effect in
Operating Operating
Systems Systems | Set 11

Program for Operating

preemptive Systems | Set 12
priority CPU Operating
scheduling Systems | Set 13
Program for Operating
Round Robin Systems | Set 14
scheduling | Set
Operating
1
Systems | Set 15
Round Robin
Operating
Scheduling with
Systems | Set 16
different arrival
times Operating
Systems | Set 17
Program for
Shortest Job First
(or SJF)
scheduling | Set
1 (Non-
preemptive)
Program for
Shortest Job First
(SJF) scheduling
| Set 2
(Preemptive)
Shortest Job First
scheduling with
predicted burst
time
Longest
Remaining Time
First (LRTF)
algorithm
Longest
Remaining Time
First (LRTF)
Program
Highest
Response Ratio
Next (HRRN)
Scheduling
Program for
Priority
Scheduling | Set
1
Priority
Scheduling with
different arrival
time | Set 2
Multilevel Queue
Scheduling
Multilevel
Feedback Queue
Scheduling
Multiple-
Processor
Scheduling
Measure the
time spent in
context switch
Starvation and
Aging in
Operating
Systems
Introduction of
System Call
Operating
System | Thread
Threads and its
types
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
fork() in C
Boot Block
2. Inter‐process
communication,
concurrency and
synchronization:
Process
Synchronization
| Introduction
Operating
System | Process
Synchronization
| Set 2
Critical Section
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
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
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 Databases :

1. ER‐model : 1. ER‐model:

ER‐model, Database ER and Video – NPTEL

Management Relational Lectures
Relational model :
System – Models
relational algebra, Introduction |
2. Relational model Notes – Lecture
tuple calculus, SQL Set 1
(relational Slides
Integrity Database algebra, tuple Silberschatz,
constraints, normal Management calculus): Korth and
forms System Sudarshan
ER and
Introduction |
Transactions and Relational Notes – Lecture
Set 2 (3-Tier
concurrency control Models Slides Raghu
Architecture)
Ramakrishnan
File organization, 3. Database design
DBMS and Johannes
indexing (e.g., B and (integrity
Architecture 2- Gehrke
B+ trees) constraints,
Level, 3-Level
normal forms): Notes – Stanford
Need for DBMS DBMS course
Database
Lecture Slides
Advantages of Design(Normal
DBMS over File Forms) Notes – Jeff
system Ullman’s Lecture
4. Query languages
Slides
Choice of DBMS (SQL) :
| Economic Notes –
SQL
factors Canonical Cover
5. Transactions and
Data Abstraction Notes – Indexing
concurrency
and Data
control: Visual – B Tree
Independence
Transactions Notes – B+ Tree
ER Model
and
Visual – B+ Tree
Recursive concurrency
Relationships control
Minimization of 6. File structures
ER Diagram (sequential files,
indexing, B and B+
Enhanced ER
trees):
Model
Mapping from File structures
(sequential files,
ER Model to
indexing, B and
Relational Model
B+ trees)
2. Relational model
Practice
(relational algebra,
questions on B
tuple calculus) :
and B+ Trees
Relational Model
Commonly
Relational asked DBMS
Algebra – interview
Overview questions | Set
DBMS | 1
Anomalies in Commonly
Relational Model asked DBMS
Relational Model interview
Introduction and questions | Set
Codd Rules 2

Keys in Database
Relational Model Management
(Candidate, Systems | Set 1
Super, Primary, Database
Alternate and Management
Foreign) Systems | Set 2
Relational Database
Algebra-Basic Management
Operators Systems | Set 3
Relational Database
Algebra – Management
Systems | Set 4
 Extended
Database
Operators
Management
Tupple Systems | Set 5
Relational
Database
Calculus
Management
DBMS | How to Systems | Set 6
solve Relational
Database
Algebra
Management
problems for
Systems | Set 7
GATE
Database
DBMS | Row
Management
oriented vs.
Systems | Set 8
column oriented
data stores Database
Management
3. Database design
Systems | Set 9
(integrity
constraints, normal Database
forms) : Management
Systems | Set 10
Database
Normalization | Database
Introduction Management
Systems | Set 11
Database
Normalization |
Normal Forms
Functional
Dependency and
Attribute Closure
Finding Attribute
Closure and
Candidate Keys
using Functional
Dependencies
Number of
possible
Superkeys
Lossless
Decomposition
Dependency
Preserving
Decomposition
Lossless Join and
Dependency
Preserving
Decomposition
DBMS | How to
find the highest
normal form of a
relation
DBMS |
Minimum
relations
satisfying 1NF
Equivalence of
Functional
Dependencies
Armstrong’s
Axioms in
 Functional
Dependency
Canonical Cover
Denormalization
in Databases
Introduction of
4th and 5th
Normal form
4. Query languages
(SQL) :
Structured Query
Language (SQL)
Inner VS Outer
Join
Having Vs Where
Clause
Database Objects
Nested Queries
in SQL
Join operation Vs
nested query
Indexing in
Databases | Set 1
SQL queries on
clustered and
non-clustered
Indexes
SQL Tutorial
5. Transactions and
concurrency
control :
Concurrency
Control -
Introduction
Database
Recovery
Techniques
ACID Properties
in DBMS
Log based
recovery
DBMS | Why
recovery is
needed?
Transaction
Isolation Levels
in DBMS
Concurrency
Control | Types
of Schedules
DBMS | Types of
Recoverability of
Schedules and
easiest way to
test schedule
Conflict
Serializability
Precedence
Graph For
Testing Conflict
Serializability
How to test if
two schedules
are View Equal
or not ?
Recoverability of
Schedules
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 files,
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 Computer

1. Network 1. Network
Networks Networks :
Fundamental and Fundamental and
Physical layer : Physical layer :
Concept of layering: Video – NPTEL
Basics of Computer
OSI and TCP/IP Lectures
Computer Networks
Protocol Stacks;
Networking Video – Lectures
Basics of packet,
2. Data Link layer :
by
circuit and virtual Network goals
Data Link Layer Ravindrababu
circuit-switching;
Network Ravula
3. Network layer :
Data link layer: Topologies
Notes – Lecture
framing, error Network Layer
Types of area Notes IIT Kanpur
detection, Medium IP Addressing
networks – LAN,
Access Control, Notes – Web
MAN and WAN 4. Transport layer :
Ethernet bridging; Resources on
MANET: Mobile Transport Layer Computer
Routing protocols:
Ad hoc Network
shortest path, 5. Application layer :
flooding, distance Networks by
Types of MANET HTTP Non-
vector and link state Tanenbaum
Persistent &
routing; Types of
Persistent Visual – Sliding
Fragmentation and Transmission
Connection | Window
IP addressing, IPv4, Media
Set 2 (Practice Animation
CIDR notation, Transmission Question)
Basics of IP support Notes – Sliding
Modes in
protocols (ARP, Application Window MIT
Computer
DHCP, ICMP), Layer
Networks Notes – IPv4 vs
Network Address (Simplex, Half- 6. Network security : IPv6
Translation (NAT); Duplex and Full-
Network
Transport layer: Duplex)
Security
flow control and Redundant link
congestion control, Commonly
problems
UDP, TCP, sockets; asked Computer
Digital Networks
Application layer Subscriber Line Interview
protocols: DNS, (DSL) Questions | Set
SMTP, HTTP, FTP, 1
Email. What is
Scrambling? Computer
Networks | Set
Difference
1
between
Unipolar, Polar Computer
and Bipolar Line Networks | Set
Coding Schemes 2
Manchester Computer
Encoding Networks | Set
3
Analog to digital
conversion Computer
Networks | Set
Digital to Analog
4
Conversion
Computer
Analog to Analog
Networks | Set
Conversion
5
(Modulation)
Computer
Difference
Networks | Set
between
6
Broadband and
Baseband Computer
Transmission Networks | Set
7
Let’s experiment
with Networking Computer
Networks | Set
Layers of OSI
Model 8
Computer
TCP/IP Model
Networks | Set
2. Data Link layer : 9
Multiple Access Computer
Protocols Networks | Set
P2P(Peer To 10
Peer) File Computer
Sharing Networks | Set
Framing In Data 11
Link Layer Computer
LAN Networks | Set
Technologies | 12
ETHERNET
Ethernet Frame
Format
Token Ring
frame format
Bit Stuffing
Difference
between Byte
stuffing and Bit
stuffing
Hamming Code
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)
Introduction of
MAC Address
 Collision
Avoidance in
wireless
networks
Maximum data
rate (channel
capacity) for
noiseless and
noisy channels
Types of
switches
3. Network layer :
Internetworking
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
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
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
configuration
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
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 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?
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 flags
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 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
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)
6. Network security :
Basic Network
Attacks
Types of Viruses
Introduction to
Firewall
Zone-based
firewall
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
Certificates
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 Diffie-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
1. Machine
Organization and Computer Computer
instructions and
Architecture Organization and Organization and
addressing modes :
Architecture : Architecture :
Von Neumann
Machine
architecture
instructions and Quiz on Video – NPTEL
addressing modes Basic Computer Microprocessors Lectures
Instructions
ALU, data‐path and Computer Book – Carl
control unit Instruction Organization and Hamacher
Formats (Zero, Architecture
Instruction Notes –
One, Two and
pipelining, pipeline Pipelining
Three Address
hazards Notes – Cache
Instruction)
Memory Memory
Stack based CPU
hierarchy: cache,
Organization
main memory and
General Register Notes – Cache
secondary storage
based CPU Associativity
I/O interface Organization
(Interrupt and DMA
Single
mode)
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
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 Theory of

1. Regular expression, 1. Regular
Computation Computation :
langauges, expression,
grammar and finite langauges,
Regular expressions automata : grammar and Video – NPTEL
and finite automata finite automata : Lectures
Introduction of
Context-free Theory of Regular Video – Lectures
grammars and Computation languages and by
push-down finite automata Ravindrababu
Finite Automata
automata Ravula
| Introduction Practice
Regular and problems on Notes – NFA and
Chomsky
context-free finite automata DFA
Hierarchy
languages, pumping
Practice Notes – Non
lemma Regular
problems on Regular
Expressions,
Turing machines finite automata language
Regular
and undecidability | Set 2
Grammar and Notes – PDA
Regular 2. Context free Notes – Turing
Languages langauges, Machine
grammar and push
Pumping Lemma Notes – Rice
down automata :
Arden’s Theorem Theorem
Context free
How to identify languages and
if a language is Push-down
regular or not automata
Designing Finite 3. Context Sensitive
Automata from langauges :
Regular .
Expression
4. Turing machines
NFA with epsilon and undecidability
move to DFA :
Conversion
Recursively
Conversion from enumerable
NFA to DFA sets and Turing
Minimization of machines
DFA Undecidability
Generating Automata
regular Theory
expression from
finite automata Automata
Theory | Set 1
Union &
Intersection of Automata
Regular Theory | Set 2
languages with Automata
CFL Theory | Set 3
Designing Automata
Deterministic Theory | Set 4
Finite Automata
Automata
(Set 1)
Theory | Set 5
Designing
Automata
Deterministic
Theory | Set 6
Finite Automata
(Set 2)
DFA of a string
with at least two
0’s and at least
two 1’s
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
Star Height of
Regular
Expression and
Regular
Language
Mealy and
Moore Machines
 Difference
between Mealy
machine and
Moore machine
2. Context free
langauges,
grammar and push
down automata :
Pushdown
Automata
Pushdown
Automata
Acceptance by
Final State
Check if the
language is
Context Free or
Not
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}
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 Compiler Design :

1. Introduction of 1. Introduction of
Design
Compiler : Compiler :
Video – NPTEL
Introduction of MCQ on
Lexical analysis, Lectures
Compiler design Memory
parsing, syntax-
allocation and Video – Lectures
directed translation Phases of a
compilation by
Compiler
Runtime process Ravindrababu
environments Symbol Table in Ravula
2. Lexical analysis :
Compiler
Intermediate code Book – Basics of
Lexical analysis
generation Static and Compiler Design
Dynamic Scoping 3. Parsing :
Local optimisation, Notes – Bivas
Generation of Compiler Mitra IITgp
Data flow analyses:
Programming Theory | Set 1
constant Notes – LR
Languages
propagation, Compiler Parsing
liveness analysis, Error Handling Theory | Set 2
Notes – Syntax
common in Compiler
4. Syntax directed Directed
subexpression Design
transalation : Translation
elimination.
Error detection
Parsing and Notes –
and Recovery in
Syntax directed Intermediate
Compiler
translation Code Generation
Linker
5. Runtime
2. Lexical analysis : environments :
Lexical Analysis .
C program to 6. Intermediate code
detect tokens in a generation :
C program
Code
Fast Lexical Generation and
Analyzer Optimization
Generator
3. Parsing :
Classification of
Context Free
Grammars
Ambiguous
Grammar
 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
Parsing Set 2
Parsing Set 3
Shift Reduce
Parser in
Compiler
Classification of
top down
parsers
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 flow
analysis in
Compiler
CATEGORY
ARCHIVES:
COMPILER
DESIGN
Last Minute
Notes – Compiler
Design

Section 11: Digital

1. Introduction of
Logic Digital Logic : Digital Logic :
Boolean Algebra
and Logic Gates :
Boolean algebra Digital Logic (101) Video – NPTEL
Logic Gates
Combinational and Lectures
Number
sequential circuits. Properties of
representation Video – Lectures
Boolean algebra
Minimization by
Minimization of Ravindrababu
Number
Boolean Ravula
representations and
Functions
computer Notes – Number
arithmetic (fixed Representation System-
and floating point) of Boolean Swarthmore
Functions
Notes – IEEE
Canonical and Standard 754
Standard Form Floating Point
Functional Numbers
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
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-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
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

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 2020 Important Official Dates

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 find anything incorrect, or you want to share more
information about the topic discussed above!

My Personal Notes arrow_drop_up

Add your personal
notes here! (max 5000
h )