Lecture Delivery Blueprint (LDB) – Operating Systems, BSCS 0004

Subject name: Operating Systems, BSCS 0004

Delivery Breakdown: Modules and No of Lectures

Topic / Module No of lectures

Understanding the class and Context setting 2
Module 1 (Introduction): Operating System, Operating System Functions and Services, 2
Operating System Classification - Batch, Interactive, Multiprogramming, Multitasking, Time-
sharing, Real-Time System, Multiprocessor Systems.
Module 1 (OS Structure and System Call): Multithreaded Systems, System Protection, 2
System Calls, Reentrant Kernels, Operating System Structure- Layered structure, Monolithic
and Microkernel Systems, Operating System Components.
Module 1 (Processes): Process Concept, Process States, Process State Transition Diagram, 3
Process Control Block (PCB), Threads and their management.
Module 1 (CPU Scheduling): Process Scheduling Concepts, Scheduling Algorithms: FCFS, 5
SJF and SRTF, Round Robin, Scheduling Algorithms: Priority and Multilevel Queue
Scheduling, Multiprocessor Scheduling.
Module 1 (Process Synchronization): Principle of Concurrency, Implementation of 5
concurrency through fork/join and parbegin/parend, Inter Process Communication models and
Schemes, Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores,
Synchronization Hardware.
Module 1 (Classical Problem in Concurrency): Producer / Consumer Problem, Dining 2
Philosopher Problem, Readers Writers Problem.
Module 2 (Deadlock): System model, Deadlock characterization, Prevention, Avoidance and 4
detection, Recovery from deadlock, Combined Approach.
Module 2 (Memory Management): Multiprogramming with fixed partitions, 6
Multiprogramming with variable partitions, Paging, Segmentation, Paged segmentation
Module 2 (Virtual memory concepts): Demand paging, Performance of demand paging, 4
Page replacement algorithms, Thrashing, Locality of reference.
Module 2 (I/O Management and Disk Scheduling): I/O devices, I/O subsystems, I/O 3
buffering, Disk storage and disk scheduling.
Module 2 (File System): File concept, File organization and access mechanism, File 3
directories, File allocation methods, Free space management.

Course Outcome CO1- Understand the classification of operating system environment.

CO2- Understand the basic of process management.
CO3- Apply the concept of CPU process scheduling for the given scenarios.
CO4- Illustrate the process synchronization and concurrency process in operating system.
CO5- Analyze the occurrence of deadlock in operating system.
 CO6- Describe and analyze the memory management and its allocation policies.
CO7- Understand the concepts of disk scheduling.

Learning / study Text book:

Materials Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Concepts-10th
Edition, Wiley, 2018.

YouTube Channels:
Knowledge GATE (Sanchit Jain) & GATE Smasher (Varun Singla)

I will use below information during subject context setting periods

Placement • Foundation of All Computing

Relevance o Every computer program, app, or device runs on top of an OS.
o Without understanding the OS, students only understand the surface — not what makes a program
actually work.
o It Prepares You for Advanced Topic like Cloud computing, Parallel computing, AI/ML, Virtual
machines, Containers (like Docker/Kubernetes) all require a solid grasp of OS concepts such as
Process and memory isolation, multithreading, Process synchronization (mutexes, semaphores),
System calls and interrupts, Memory optimization, etc.
• Core technical subject for Technical Interviews
o OS is often part of tech interviews, especially for roles in development, DevOps, systems
engineering, and research in companies like (TCS, Cognizant, IBM, Accenture, Microsoft, Amazon
etc.)
 • Completive Exams
o The Graduate Aptitude Test in Engineering (GATE) examination is one of the most competitive
examinations in India. From OS, 10-15 marks questions are asked from topics such as process
synchronization, CPU scheduling, memory management, etc.

• Makes You a Better Programmer

o Understanding OS helps write efficient, bug-free, scalable code.
o You’ll write better programs if you understand how the OS handles threads, memory, and I/O.

• Skills That Stand Out in Placements

o Command-line expertise (e.g., Linux shell, Windows PowerShell)
o Process and memory management
o Networking and security configuration
o Problem-solving and troubleshooting abilities
o Continuous upskilling through certifications (Red Hat, Microsoft, Linux Foundation)

• Career Roles where OS Skills are Crucial

o System Administrator : Managing user accounts, processes, backups, security patches
o Network Engineer: Configuring protocols, setting up routing/firewall on systems.
o Cyber Security Specialist: Security hardening, threat detection, vulnerability mitigation.
o Cloud Engineer: Virtualization, containerization, OS-level automation.
o Embedded/IoT Engineer: Direct device-hardware integration with OS support.
Project / • Foundation for Operating Systems, Compilers, and Virtual Machines
Research o C is the implementation language for Linux, UNIX, Windows kernels, and most compilers (GCC,
Relevance Clang).
o Research in OS design, language processing, compiler optimization requires strong C knowledge.
 • Real-Time Systems and Embedded Research
o C is crucial in developing and researching real-time embedded applications (e.g., drone technology,
flight control, robotics, autonomous vehicles, sensor networks).
o Enables memory-efficient algorithm design in constrained environments.

• Open Source Contributions in Core Systems

o Most open-source firmware and OS codebases (e.g., Arduino Core, RTOS, kernel modules) are
written in C—ideal for students targeting GSoC, GitHub research repos.

• Algorithm Optimization & High-Performance Computing

o C enables low-level access to CPU/GPU optimizations, used in research projects involving
simulations, numerical methods, cryptography, and AI performance benchmarking.

Project Ideas:
1. Mini Shell (Command Line Interpreter)
Develop a lightweight shell that supports basic commands, redirection, pipes, and background jobs. Students will
Learn:
o Process creation (fork, exec)
o Parsing and I/O redirection
o Signals and job control
o Tools/Languages: C, Unix/Linux
2. Inter-Process Communication System
Build a simple system where multiple processes communicate using pipes, shared memory, message queues,
or sockets.
o IPC mechanisms
o Process synchronization
o Producer-consumer or client-server models
o Tools/Languages: C/C++, Unix/Linux APIs

3. Thread Library Implementation

Build your own user-level thread library (like pthreads) supporting basic thread creation, joining, and
scheduling (e.g., round-robin or priority-based). In this project you will learn:
o Thread lifecycle
o Context switching
o Cooperative vs preemptive scheduling

4. Virtual Memory Simulator

Simulate how paging, segmentation, and page replacement algorithms work (e.g., FIFO, LRU, Optimal).
o Address translation
o Page fault handling
o Memory hierarchy

5. Mini OS Kernel
Write a tiny monolithic or microkernel from scratch that supports booting, basic I/O, task switching, and
memory handling.
o Kernel architecture
o Bootloaders (like GRUB)
 o Low-level memory and I/O
o Tools/Languages: C, Assembly, QEMU emulator

6. Real-Time Task Scheduler

Simulate a real-time OS scheduler (Rate Monotonic or Earliest Deadline First) handling periodic tasks with
deadlines.
Learning - Follow any book – from the beginning
Approach - Attempt lot of MCQs and Questions on coding platforms; and start building profiles

Module 1: Lecture Plan

Module Learning 1. Understand the Fundamentals of Operating Systems.
Objectives 2. Explain key operating system structure and component.
3. Understand and manage processes.
4. Analyze CPU Scheduling Techniques.
5. Understand and apply process synchronization.
6. Apply concepts to Classical Concurrency Problems.
7. Develop a Problem-Solving Approach using OS Concepts

Lec. Content Pre-Reading Context Setting / Detailed Delivery Thought- Post-Class Actual
No. Topics / Ques Teaching Strategy Approach (What & How Provoking Activities / Delivery
(Before Class) to Teach) Questions Readings / dates and
Assignments detailed
remarks
1-2 Understand the Read Book -Which OS you -Introduce computer If we remove the Write a short note
class and Galvin: page no have in your system components: operating system on "The Role of an
Context setting 4-46, laptop? Name any hardware, software, from a computer, Operating System"
five OS. users. can it still work?
YouTube videos: -Discuss the need for an
 Introduction of Knowledge -Begin with operating system as an Why or why not? Research OS used
OS GATE (Sanchit relatable intermediary. in 3 different
Jain) & GATE scenarios: using a How a C program devices (PC,
Smasher (Varun mobile phone, Analogy: OS as a company is going to mobile, embedded
Singla withdrawing cash manager coordinating execute? system)
from an ATM, and resources.
What is a playing a game.
computer Show live demo: opening How does a
system? -What lies behind files, viewing processes, computer do
the scenes enabling etc. Multitask?
What happens these tasks?
when you turn Brief history of operating Why Does a
on your systems: punch cards to Program Crash?
computer? smartphones.
You have two
Discuss users and system Program Files
viewpoint of OS. folders: One
labeled
Discuss GUI/ CLI simply Program
concept of OS. Files and the
other labeled
Highlight Windows/ Program Files
Linux development in (x86). Why?
context of programing.

3-6 Operating Read Book Begin by Define OS and explain Why can't we use Create a
System Galvin: page no discussing various classification: Batch, a mobile OS on a comparison table
Classification, 55-95, scenarios: Time-Sharing, real-time medical of any 5 OS types
Structures and Unlocking a Distributed, Real-Time, device? with use-case and
system call. YouTube videos: Phone, ATM Cash Network, Mobile, example.
Knowledge Withdrawal, Using Embedded, etc. What limitations
GATE (Sanchit a Personal would arise if a Quiz: 10 MCQs on
Jain) & GATE Computer, Present table comparing classification and
 Smasher (Varun University Lab, AI features, advantages, smartphone used real-world usage
Singla Workload / limitations, and examples a batch OS? of OS types.
Supercomputer.
Chapter on Comparison among Which type of Compare
“Types of OS” You are hungry different structures of OS Kernel is used in Monolithic and
from your and want food. and advantages/ windows? Microkernal.
course textbook The kitchen has disadvantages of each
(e.g., Galvin’s OS all the ingredients one. Why do
book) and chefs, but you Different structures of OS operating
such as Monolithic, systems provide
can't go in
Layered and Microkernal system calls
directly. So, what Discuss system call, how
do you do? instead of
it works in terms of user
allowing direct
mode and kernel mode.
access to
hardware
resources by user
programs?

7-9 Process Read Book Begin the Understand difference What is the use of Simulate a Process
Concept and Galvin: page no discussion with b/w program and scheduler in state Scheduler in
Process States 106-109, how a patient process? transition? Python or C.
enters a hospital,
YouTube videos: where they have Process concepts and PCB Why does a Write a short
Knowledge to go through and transition diagram process move report: What
GATE (Sanchit stages, starting like 5 and 7 state. from the happens during a
Jain) & GATE from registration 'Running' state to context switch and
Smasher (Varun to follow-up with Types of processes and the 'Ready' state count the number
Singla the doctor. schedulers. without of context switch
completing its that happened.
- execution?
 How the scheduler works What would How can
in different states. happen if there corruption of a
were no ‘Waiting’ PCB affect system
Explain context switching state in the stability?
between processes with process life cycle
diagram. What role does
If a process is the PCB play in
How process stored in stuck in the enforcing process
memory. In different 'Waiting' state security and
states? indefinitely, what access control?
kind of problem
Difference between does it indicate?
thread and process.

Advance topics: Orphan

process, Zombie process
etc.
10- CPU Read Galvin Imagine a busy Start by introducing the Why might the Solve scheduling
14 Scheduling Book page no hospital need for CPU scheduling shortest job not problems,
200-205: emergency room in multitasking systems. always be the simulate
with one doctor best choice to run algorithms,
YouTube videos: and many patients. Define key terms like first? compare results,
Knowledge Each patient process, CPU burst time, discuss real-world
GATE (Sanchit represents a waiting time, turnaround Can Round Robin applications, and
Jain) & GATE process needing time, and response time. scheduling reflect on
Smasher (Varun the CPU (doctor's guarantee both algorithm
Singla) attention). Explain scheduling fairness and strengths and
criteria such as CPU efficiency? weaknesses.
Queue Process Imagine a single utilization, throughput,
Scheduling cashier at a busy and fairness. Is a non- Explain the
Concepts supermarket with preemptive advantages and
many customers Scheduling algorithms: scheduling disadvantages of
waiting to check FCFS, SJF, Priority, Round algorithm FCFS, SJF, Priority
Scheduling out. Each Robin, Multilevel Queue & suitable for real- Scheduling, and
Algorithms: customer Feedback Queue. time systems? Round Robin.
FCFS, SJF, represents a Provide scenarios
SRTF, Round process, and the Compare these What happens if where each is
Robin, Priority cashier is the CPU. algorithms based on all processes most effective.
and Multilevel performance metrics and have the same
Use real-life their pros/cons, including priority in Write a program
Scheduling,
analogies, visual issues like starvation and Priority in your preferred
Multiprocessor Gantt charts, and context switching. Scheduling? language to
Scheduling simulations to simulate Round
explain Why might a high Robin scheduling
algorithms. CPU utilization for a given list of
Engage students not always mean processes and
with problem- better system time quantum.
solving exercises, performance? Output the order
compare of execution and
scheduling average waiting
methods, and time.
encourage
discussions to Given processes
connect concepts with priority
with real-world values, design a
applications. schedule using
Priority
Scheduling.
Explain how
starvation can
occur and suggest
a method to
prevent it.

Research and
describe how a
 popular operating
system (Linux,
Windows, or
macOS)
implements CPU
scheduling.
Highlight the
algorithms used
and any special
features or
optimizations.
15- Process Read Galvin -Imagine a Start with introduction of What could go Implement the
21 Synchronization Book page no hospital with a process concurrency and wrong if two Producer-
257-272: single operation its conditions & processes access Consumer
theatre (shared challenges. a shared resource problem using
YouTube videos: resource):Multiple without semaphores. Test
Knowledge surgical teams Interprocess synchronization? different scenarios
GATE (Sanchit communication using Can you think of a and observe
(processes) may
Jain) & GATE Shared memory and real-world synchronization
Smasher (Varun
be scheduled, but message passing with example? effects.
Singla) only one team can examples
use the operation If mutual Discuss the
Principle of theatre at a time - Explain critical section exclusion ensures solution to
Concurrency, this represents the problem and its solutions. only one process prevent deadlock
Inter Process critical section. (Lock variable, petersons accesses the in Dining
Communication To ensure safety solution etc.) critical section, Philosopher
models and and efficiency, the why do we still problem?
Schemes, operation theatre Use of Semaphore for face issues like
multi process deadlock and Discuss some real-
Critical Section is locked during
surgery-no other synchronization and starvation? world systems
Problem, discussed solution of that resemble the
Semaphores, team can enter
until the ongoing some classical problems How does producer-
(Producer Consumer, process
Synchronization procedure is Reaser Write and Dining synchronization consumer
Hardware. completed. This Philosopher, etc) differ between relationship.
lock symbolizes single-core and
the multi-core Explain numerical
synchronization systems? example of the
mechanism. Reader-writer
problem using
semaphores with
-In modern
a bounded buffer
computing
systems, multiple
processes often
run concurrently
and may need to
access shared
resources such as
memory, files, or
devices. Without
proper
coordination, this
can lead to
inconsistent data,
race conditions,
and system
crashes.
Example of Race
Condition with
pseudo code
 Module 2: Lecture Plan
Module Learning 1. Understand Deadlock and its Handling in Operating Systems.
Objectives 2. Understand Memory Management Techniques.
3. Apply Virtual Memory Concepts.
4. Analyze I/O Management and Disk Scheduling
5. Understand File System allocation and Management.

Lec. Content Pre-Reading Context Setting / Detailed Delivery Thought- Post-Class Activities / Actual
No. Topics / Ques Teaching Strategy Approach (What & Provoking Readings / Assignments Delivery
(Before Class) How to Teach) Questions dates and
detailed
remarks
1-4 Deadlock Read Book -Ask students: Introduce deadlock In what -A system has 3 processes
Galvin: page no “Have you ever and its necessary scenarios might and 4 instances of a
318-341, seen a program conditions. deadlock resource type. Each
hang or freeze?” prevention process can request up to
YouTube videos: “Can you think of Visualize and degrade overall 2 instances. Can deadlock
Knowledge reasons why a Analyze of Resource system occur? Justify your answer
GATE (Sanchit program might Allocation Graph throughput using the concept of safe
Jain) & GATE wait forever?” (RAG). more than state.
Smasher (Varun deadlock itself?
Singla This sparks Deadlock handling -Write a program that
curiosity and ties techniques Can a system be simulates resource
System model, new content to (Prevention, in a safe state allocation and implements
Deadlock existing Avoidance, and still the Banker’s Algorithm to
characterization knowledge. Detection, and experience check for safe states.
, Prevention, Recovery). deadlock?
Avoidance and -Use Analogies Explain. -Explain the trade-offs in
detection, 1) Traffic Gridlock: Explain about safe deadlock prevention vs.
Cars block each and unsafe states Why is it called detection
Recovery from
other in a circular using the Banker's the Banker's
deadlock, Algorithm. Algorithm? Is
 Combined way, and no one the Banker's -Why can't deadlocks be
Approach. can move. Algorithm solved by just killing a
2) Bank ATM practical in real- process?
Scenario: Multiple time systems?
users holding
cards and waiting
for PIN machines.

-Imagine Process A
holds a printer and
waits for a
scanner, while
Process B holds
the scanner and
waits for the
printer. Neither
can proceed until
the other releases
its resource. This
creates a deadlock,
just like a standoff-
both are stuck
waiting forever,
blocking progress
in the system.

5- Memory Read Book -Use the hotel Introduction of How does Draw and explain the
10 Management Galvin: page no room analogy: logical and physical external structure of page tables
349-3483, Hotel = Main address space fragmentation and segment tables with
Memory (offset, page, frame). occur in examples.
YouTube videos: Guests = Processes variable
Knowledge Receptionist = partitions, and A system has a 32-bit
GATE (Sanchit Memory Manager logical address space and
Jain) & GATE Room allocation = Address mapping can it ever be uses paging with a page
Smasher (Varun Memory allocation (conversion of logical completely size of 4 KB. How many
Singla This helps to physical address). eliminated? bits are used for the page
students visualize number and how many for
Memory and its partitioning, In what the offset?
types, partitions, dynamic Memory Partition scenarios would
and allocation, with fixed and A system uses a two-level
segmentation
fragmentation. swapping, and variable size (First, paging scheme. The logical
fragmentation. best, and worst fit).
be more address is 32 bits, and the
Concepts of -Start with the advantageous page size is 4 KB. If the
paging and memory hierarchy Visualization and than paging outer page table has 1024
segmentation. and gradually analysis of despite its entries, how many bits are
progress to fragmentation, fragmentation used for each level of the
complex Paging, TLB, risks? page table and the offset?
techniques: segmentation and
1) Memory paged segmentation How does
hierarchy: with examples. paged
Registers, cache, segmentation
RAM, disk balance
2) Address flexibility and
binding: Compile- complexity, and
time, load-time,
why is it
run-time
3) Logical vs
preferred in
Physical modern
addresses systems?
4) Contiguous
allocation Working of
5) Paging and Translation
segmentation Lookaside
6) Virtual Buffer (TLB),
memory and and why is it
demand paging important in
 Use step-by-step memory
illustrations aid systems?
comprehension.

11- Virtual Read Book Imagine your Concept of Virtual Why is virtual Among FIFO, LRU, and
13 Memory Galvin: page no computer’s RAM is Memory and its memory Optimal page replacement
389-436, limited, but you importance essential in algorithms, which one
want to run modern balances performance and
YouTube videos: multiple large Need of Demand computing complexity best in real-
Knowledge programs paging with page systems, world systems? Why?
GATE (Sanchit simultaneously. fault and page hit especially when
Jain) & GATE How does the concept. physical RAM is
Smasher (Varun system manage large? Page Reference String:
Singla memory efficiently Detailed discussion 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
by loading only the on Page replacement Why does Calculate page faults using
Demand paging, necessary parts of algorithms (FIFO, Belady’s FIFO, MRU, and LIFO for 3-
Page programs on LRU, Optimal) Anomaly occur and 4-page frames
replacement demand? in FIFO but not
algorithms, Discussion on in LRU or
Locality of When you open important terms Optimal page
reference. multiple apps on such as Thrashing, replacement
your laptop - web Locality of reference algorithms?
browser, music
player, and video Can Adding
editor—your More RAM
system uses virtual Completely
memory to load Eliminate
only necessary Thrashing?
parts of each app
into RAM. Demand
paging and smart
page replacement
 keep everything
running smoothly,
preventing
slowdowns caused
by constantly
swapping data in
and out.
14- I/O Read Book When you watch a Types of I/O devices Which disk A disk has 200 tracks (0–
16 Management Galvin: page no video, type, and and characteristics. scheduling 199). The disk head is at
and Disk 489-521, download a file at algorithm 100, moving towards 0.
Scheduling the same time, Architecture of Disk minimizes seek Request queue: 55, 58, 39,
YouTube videos: your computer and its terminology. time most 18, 90, 160, 150, 38, 184.
Knowledge manages many I/O effectively in a Calculate total seek
GATE (Sanchit tasks. It uses Concept and highly loaded distance using FCFS, SSTF,
Jain) & GATE buffers to hold numerical on disk system? SCAN, C-SCAN, LOOK and
Smasher (Varun data temporarily scheduling algorithm C-LOOK.
Singla and schedules disk (FCFS, SSTF, SCAN, C- How does SSTF
access smartly to SCAN, LOOK, C- potentially lead A hard disk has 5 platters,
I/O avoid delays. This LOOK). to starvation in each with 2 surfaces. Each
Management I/O management disk scheduling? surface has 1,000 tracks,
and Disk helps everything each track has 100 sectors,
Scheduling, I/O run smoothly In what and each sector holds 512
buffering, Disk without slowing scenario would bytes. Calculate the total
storage. down your system. C-SCAN disk capacity in gigabytes
outperform (GB).
I/O management is SCAN in terms
like a restaurant of response A disk with 4 platters has 2
kitchen handling uniformity? read/write heads per
multiple orders. platter and spins at 7,200
Buffers keep How does LOOK RPM. If each track contains
dishes warm improve upon 500 sectors and each
temporarily, while SCAN in terms sector is 512 bytes,
disk scheduling of head estimate the total storage
 ensures meals movement capacity, assuming 1,024
(data) are served efficiency? tracks per surface.
efficiently without
delays, keeping Why might an
everything OS choose C-
running smoothly. LOOK over
SCAN even
though both
provide similar
seek
optimizations?
17- File System Read Book -Begin with Real- Concept of files and -Can a file exist-Create a table comparing
20 Galvin: page no Life Analogy directories. without a name Contiguous, Linked, and
529-582, Use the example of in a file system?Indexed allocation based
a library: File allocation on:
YouTube videos: Books = Files methods -Why is file • Speed of access
Knowledge Shelves = (Contiguous, Linked, metadata as • Disk space
GATE (Sanchit Directories Index allocation). important as the utilization
Jain) & GATE Index/Library file's actual • Support for
Smasher (Varun Catalog = File Free space data? random/sequential
Singla Allocation Table management access
(FAT) (Bitmap, Link list, -Why is indexed • Fragmentation
File concept, File This makes Grouping, Counting) file access type
organization abstract ideas better than (internal/external)
and access concrete and sequential • Implementation
mechanism, File relatable. access for large complexity
directories, File - Define the databases?
allocation Basics -Why does using a bitmap
methods, Free Introduce key -What happens for free space tracking
space concepts: when a file is scale better than a linked
management. 1) Files, deleted? list?
directories, path
names
 2) File attributes -Why are -How can inefficient free
and metadata different file space management
3) Operations on systems (like degrade file system
files (create, FAT, NTFS, ext4, performance?
delete, read, write, etc.) needed?
etc.)

Suggested Remarks [ to be filled after each module ]

- How many students were actively responding/participation in QnA session?
- Any topic/concept where misconceptions were high, pls state?
- Time management issues in any topic (too fast/slow etc)?
- Students’ confusion points or what they find difficult to understand?
- What specific things related to placements / projects / research discussed- pls state?
- Points that you would like to consider for better delivery next time ?
- Any other point .