Lesson Plan

Department AI & DS Year II

Semester IV Faculty Name VANITHA M
Subject code AL3452 Subject Name OPERATING SYSTEMS
Academic 2024-2025
year

Sessi Topics Planned Required Teaching Text / Brief Completio Remark HOD / Princi Dean
on date hour Methodolo Reference Description n Date s Directo pal Sign
No. gy Book r Sign
Sign
Unit 1: INTRODUCTION 7
Computer System - Elements and organization; Operating System Overview - Objectives and Functions - Evolution of Operating System; Operating
System Structures – Operating System Services - User Operating System Interface - System Calls – System Programs - Design and Implementation -
Structuring methods..
Objective: To understand the basics and functions of operating systems.
To understand processes and threads.
1 Computer System - 03.01.202 1 Black T1 Discuss
Elements and 5 Board about the
organization Computer
System?
2 Operating System 03.01.202 1 Black T1 What are
Overview - Objectives 5 Board the
and Functions objectives
 of OS?
3 Evolution of 04.01.202 1 Black T1 Discuss
Operating System 5 Board about the
evolution
of OS?
4 Operating System 06.01.202 1 PPT T1 Discuss
Structures 5 about the
os
structures?
5 Operating System 07.01.202 1 Black T1 About
Services - User 5 Board System
Operating System Calls
Interface - System
Calls
6 Installation of 07.01.25 2 Lab based Installation
Operating system : learning of OS
Windows/ Linux
Illustrate UNIX
commands and Shell
Programming
7 System Programs - 10.01.202 1 Demo T1 Design and
Design and 5 Session implement
Implementation ation of
System
programs
8 Structuring methods. 11.01.202 1 Black T1 Discuss
5 Board about
structuring
methods.
Unit II: PROCESS MANAGEMENT 11
Processes - Process Concept - Process Scheduling - Operations on Processes - Inter-process Communication; CPU Scheduling - Scheduling criteria -
Scheduling algorithms: Threads - Multithread Models – Threading issues; Process Synchronization - The Critical-Section problem - Synchronization
hardware – Semaphores – Mutex - Classical problems of synchronization - Monitors; Deadlock - Methods for handling deadlocks, Deadlock
prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock..
Objective: To analyze Scheduling algorithms and process synchronization
To understand the concept of deadlocks.
10 Processes - Process 17.01.202 1 Black T1,R1,R2 Brief on
Concept - Process 5 Board process
Scheduling concepts
11 Operations on 17.01.202 1 Black T1,R1,R2 How
Processes - Inter- 5 Board process
process communicat
Communication e
12 CPU Scheduling - 18.01.202 1 PPT T1,R1,R2 Discuss on
Scheduling criteria- 5 various
Scheduling algorithms CPU
Scheduling
algorithm
13 CPU Scheduling - 20.01.202 1 PPT T1,R1,R2 Discuss on
Scheduling criteria- 5 various
Scheduling algorithms CPU
Scheduling
algorithm
14 Threads - Multithread 21.01.202 1 Black T1,R1,R2 Explanatio
Models – Threading 5 Board n of
issues multithread
models
15 Process Management 21.01.202 2 Lab based Process
using System Calls : 5 learning Managemen
Fork, Exec, Getpid, t
Exit, Wait, Close.
Write C programs to
implement the various
CPU Scheduling
Algorithms
16 Process 24.01.202 1 Black T1,R1,R2 Need for
Synchronization 5 Board Synchroniz
ation
17 The Critical-Section 25.01.202 1 PPT T1,R1,R2 Synchroniz
 problem - 5 ation
Synchronization example.
hardware
18 Semaphores – Mutex 27.01.202 1 PPT T1,R1,R2 Explanatio
5 n on
semaphore
Classical problems of 1 Black T1,R1,R2 Discussion
synchronization - Board on
Monitors
monitors
19 Deadlock - Methods 28.01.202 1 Smart T1,R1,R2 How
for handling 5 Board deadlocks
deadlocks, Deadlock are
prevention. handled?
20 Illustrate the inter 28.0.2025 2 Lab based Process
process communication learning communic
strategy ation
Implement mutual
exclusion by
Semaphores
21 Deadlock avoidance, 31.01.202 1 Activity T1,R1,R2 Brief on
Deadlock detection, 5 based avoidance ,
Recovery from learning detection
deadlock. and
recovery
CIAT 1
Unit III: MEMORY MANAGEMENT 10
Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page Table - Segmentation, Segmentation with paging; Virtual
Memory - Demand Paging – Copy on Write - Page Replacement - Allocation of Frames –Thrashing.
Objective: To analyse various memory management schemes.
19 Main Memory – 1.2.25 1 PPT T1,R1,R2 Basic
Swapping concepts
on memory
20 Contiguous Memory 3.2.25 1 PPT T1,R1,R2 How
 Allocation memory
allocation
happens.
21 Paging - Structure of 4.2.25 1 PPT T1,R1,R2 Paging
the Page Table scheme
explanatio
n
22 Write a C program to 4.2.25 2 Lab based Bankers
avoid Deadlock using learning Algorithm
Banker's Algorithm
Write a C program to
Implement Deadlock
Detection Algorithm
23 Segmentation, 7.2.25 1 Black T1,R1,R2 Discussion
Board on
segmentati
on
24 Segmentation with 8.2.25 1 PPT T1,R1,R2 How
paging segmentati
on works
with
paging
concept?
25 Virtual Memory 10.2.25 1 PPT T1,R1,R2 Need of
virtual
memory
26 Demand Paging- 11.2.25 1 Activity T1,R1,R2 Demand
Copy on Write based paging
Learning working
27 Write C program to 11.2.25 2 Lab based Implement
implement Threading learning threading
Implement the paging
Technique using C
 program
28 Page Replacement 14.2.25 1 Smart T1,R1,R2 About
Board various
page
replacemen
t
algorithms
29 Allocation of Frames 15.2.25 Black T1,R1,R2 How
board frames are
allocated
in
memory?
30 Thrashing 17.2.25 1 Smart T1,R1,R2 Briefly
Board discuss on
thrashing.
31 Write C programs to 18.2.25 2 Lab based Memory
implement the learning Allocation
following Memory Methods
Allocation Methods
Write C programs to
implement the various
Page Replacement
Algorithms
Unit IV: STORAGE MANAGEMENT 10
Mass Storage system – Disk Structure - Disk Scheduling and Management; File-System Interface - File concept - Access methods - Directory Structure
- Directory organization - File system mounting - File Sharing and Protection; File System Implementation - File System Structure - Directory
implementation - Allocation Methods - Free Space Management; I/O Systems – I/O Hardware, Application I/O interface, Kernel I/O subsystem.
Objective: To be familiar with I/O management and File systems.
31 Mass Storage system 18.2.25 1 PPT T1,R1,R2 Introduction
– Disk Structure Mass on mass
Storage system – Disk storage
Structure
32 Disk Scheduling and 21.2.25 1 PPT T1,R1,R2 Discuss
 Management various disk
scheduling
algorithms.
33 File-System Interface 22.2.25 1 PPT T1,R1,R2 File system
- File concept - concepts
Access methods
34 Directory Structure - 25.2.25 1 Black T1,R1,R2 How
Directory organization Board directories
are
organized
35 Write C programs to 25.2.25 2 Lab based various File
Implement the various learning Organizatio
File Organization n
Techniques
Techniques
36 File system mounting 3.3.25 1 PPT T1,R1,R2 About file
- File Sharing and system
Protection mounting
37 File System 4.3.25 1 PPT T1,R1,R2 Explain on
Implementation - File FSI
System Structure
38 Directory 7.3.25 1 PPT T1,R1,R2 How
implementation directories
are
implemente
d
39 Allocation Methods - 8.3.25 1 Black T1,R1,R2 Discuss on
Free Space Board free space
Management managemen
t
40 I/O Systems – I/O 10.3.25 1 Activity T1,R1,R2 I/O system
Hardware, based managemen
learning t
 41 Application I/O 11.3.25 1 Smart T1,R1,R2 Concepts on
interface, Kernel I/O Board kernel
subsystem subsystem
42 Implement the 11.3.25 2 Lab based File
following File learning Allocation
Allocation Strategies Strategies
using C programs
Unit V: VIRTUAL MACHINES AND MOBILE OS 7
Virtual Machines – History, Benefits and Features, Building Blocks, Types of Virtual Machines and their Implementations, Virtualization and
Operating-System Components; Mobile OS - iOS and Android.
Objective: To be familiar with the basics of virtual machines and Mobile OS like iOS and Android..
43 Virtual Machines – 14.3.25 1 Black T1,R3 About
History Board Virtual
Machines –
History.
44 Benefits and Features, 15.3.25 1 PPT T1,R3 About the
Building Blocks benefits and
features,buil
ding blocks.
45 Types of Virtual 17.3.25 1 PPT T1,R3 Discuss
Machines and their about the
Implementations types of
virtual
machines.
46 Virtualization and 18.3.25 1 PPT T1,R3 Discuss
Operating-System about the
Components virtualizatio
n and
operating
system
components
.
47 Write C programs for 18.3.25 2 Lab based disk
the implementation of learning scheduling
various disk scheduling algorithms
 algorithms
48 Virtualization and 21.3.25 1 Black T1,R3 Virtualizati
Operating-System Board on
Components
49 Mobile OS - iOS 21.3.25 1 PPT T1,R3 About
Mobile OS -
ios
50 Mobile OS - Android 22.3.25 1 Collaborat T1,R3 About
ive team Mobile OS
learning Android
CIAT 2 - -

Text Book:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”‖, 10th Edition, John Wiley and Sons Inc., 2018.
2. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition, 2022 New Delhi.
Reference Book:
1. Ramaz Elmasri, A. Gil Carrick, David Levine, “ Operating Systems – A Spiral Approach”, Tata McGraw Hill Edition, 2010.
2. William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition, Prentice Hall, 2018.
3. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.
Course Outcome:
CO1 : Analyze various scheduling algorithms and process synchronization.
CO2 : Explain deadlock prevention and avoidance algorithms.
CO3 : Compare and contrast various memory management schemes.
CO4 : Explain the functionality of file systems, I/O systems, and Virtualization
CO5 : Compare iOS and Android Operating Systems.

*Innovative Teaching Methodology:

 PPT
 NPTEL Video Lecture
 Smart Class,
 Lab based Learning
 Activity Based Learning
 Quiz
 Virtual lab

Signature of Faculty Signature of HOD Signature of Principal/Dean