UNIT- IV MEMORY MANAGEMENT (9Hrs)

Memory Management: Basic concept - Logical and Physical address maps - Memory allocation: Contiguous Memory allocation – Fixed and
variable partition– Internal and External fragmentation and Compaction. Virtual Memory: Basics of Virtual Memory – Hardware and control
structures – Locality of reference- Page
DEPARTMENT allocation- Partitioning,
OF COMPUTER SCIENCE AND Paging- Page fault-Working
ENGINEERING Set-Segmentation-
AND BUSINESS SYSTEMSDemand paging- Page
Replacement algorithms: Optimal, FIFO – SC –NRU-LRU.
ODD SEMESTER ( JUNE 2025 – SEP 2025)
UNIT- V I/O ANDFILE MANAGEMENT ACADEMIC COURSE PLAN (9Hrs)
Course Details
I/O Hardware: I/O devices- Device controllers-Direct Memory Access- Principles of I/O -File Management: Concept of File- Access methods-
Name of the File
File types- Course
operation- Directory structure-File SystemPRINCIPLES OF OPERATING
structure-Allocation SYSTEMmanagement - directory implementation-
methods -Free-space
Course Codeand performance. Disk Management: Disk U23CBT305
efficiency structure- Disk scheduling – FCFS- SSTF- SCAN-Credits 3
C-SCAN- Disk reliability, Disk
Year II Semester
formatting, Boot-block, Bad blocks.Case study: UNIX OS file system III Section A
Compulsory/Elective Course Compulsory
Course
Text Offered to the department
Books CSEBS
1.Academic
AbrahamYearSilberschatz, Peter Baer Galvin, Greg Gagne, 2025-2026
Operating System Concepts, 10th Edition, Wiley, 2018.
2.Name of the
William Faculty Operating Systems: Internals and Design
Stallings, Mrs.M.VIJI
Principles, 9th Edition, Pearson, 2022.
Designation Assistant
3. Thomas Anderson, Michael Dahlin, Operating Systems: Principles Professor
and Practice, 3rd Edition, Recursive Books, 2021.
Pre- requisites : Basic understanding of computer architecture, programming concepts, and system software integration.
4. Gary Nutt, “Operating Systems- A Modern Perspective”, Pearson Education Pvt. Ltd, Second Edition, 2013.
5. Andrew
COURSE S. Tanenbaum, “Modern Operating Systems”, 3rd edition Prentice Hall of India Pvt. Ltd,2015.
SYLLABUS
Reference Books
UNIT-I INTRODUCTION
1. William Stallings, AND PROCESS
“Operating System”, Prentice MANAGEMENT
Hall of India, 6th Edition, 2009 (9Hrs)
Introduction: Concept
2. Charles Patrick of Operating
Crowley, “OperatingSystems
System:-AGenerations of OS-
Design-oriented Types of OS-OS
Approach”Tata McGrawServices-Interrupt
- Hill Edition 1998handling and System
21st reprint,2009 . Calls- Basic
architectural concepts of an OS - Concept of Virtual Machine- Resource Manager
3. Maurice J. Bach , “Design of the Unix Operating Systems”Prentice-Hall2 nd edition ,1986 view- process view and hierarchical view of an OS.
Processes: Definition-Process Relationship- Different states of Process- Process State transitions- Process Control Block (PCB) - Context switching.
4. Daniel Pierre Bovet, Marco Cesati , “Understanding the Linux Kernel”O'Reilly Media, Incorporated publications,2 nd edition ,2005
Thread: Definition- Various states- Benefits of threads- Types of threads- Concept of multithreads.
Web References
UNIT-II CPU SCHEDULING AND INTER PROCESS COMMUNICATION (9Hrs)
Process Scheduling: Foundation and Scheduling
1. https://nptel.ac.in/courses/106108101/ objectives - Types of Schedulers- Scheduling criteria. Scheduling algorithms: Pre-emptive and non-
pre-emptive- FCFS- SJF- RR-Multiprocessor scheduling- Real Time scheduling.
2. http://www.tcyonline.com/tests/operating-system-concepts
Inter-process Communication: Concurrent processes, precedence graphs, Critical Section, Race Conditions, Mutual Exclusion, Hardware Solution,
3. http://www.galvin.info/history-of-operating-system-concepts-textbook
Semaphores, Strict Alternation, Peterson’s Solution, The Producer / Consumer Problem, Event Counters, Monitors, Message Passing,
4. http://www.ittestpapers.com/operating-system-concepts
Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem, Barber’s shop problem.
UNIT-III DEAD LOCK AND I/O (9Hrs)
Deadlocks: Definition - Necessary and sufficient conditions for Deadlock - Deadlock Prevention, Deadlock Avoidance: Banker’s algorithm -
Deadlock detection and Recovery. Concurrent Programming: Critical region, conditional critical region, monitors, concurrent languages,
communicating sequential process (CSP)
S.No Date Hour Topic Outcome Pedagogy Teaching Chapter/Books Cum.
Methodologies Aids Hr
 UNIT - I
1 Introduction to OS: Understand foundational Lecture & Real-life Blackboard C1 / T1 1
Concepts, concepts and evolution of Analogies
Generations, Types, OS
Services
2 Interrupt handling, Describe interrupt Chalk-Talk + Q&A Blackboard C1 / T1 2
System Calls, VM handling, virtualization
Concept basics
3 Resource Manager, Explain OS as manager of Group Discussion Blackboard C1 / T1 3
Process View, resources and process
Hierarchical View structures
4 Process: Definition, Define and relate various Animation & Flow Slides + C1 / T1 4
States, Relationships process states Diagrams Board
5 Process State Illustrate how OS manages Simulation-based Blackboard C1 / T1 5
Transitions, PCB process state changes Explanation
6 Context Switching Analyze role of context Activity-based Animation C1 / T1 6
switching in multitasking Learning
7 Threads: Definition, Understand thread states Think-Pair-Share Board C2 / T1 7
States and life cycle
8 Types of Threads Compare user-level and Case-based Teaching Board C2 / T1 8
kernel-level threads
9 Multithreading Analyze multithreading in Peer Teaching Board C1 / T1 9
Concept OS
UNIT - II
10 Scheduling: Identify various CPU Lecture + Problem Board C1 / T2 10
Objectives, Types of scheduling methods Solving
Schedulers
11 Scheduling Differentiate between Chalk-Talk + Board C1 / T2 11
Algorithms: preemptive and non- Numerical
Preemptive vs Non- preemptive strategies
preemptive
12 FCFS, SJF, RR, Apply scheduling Problem Solving & Slides C2 / T2 12
Multiprocessor & algorithms with case Quiz
Real-Time Scheduling examples
13 IPC: Concurrent Analyze process interaction Diagram-based Board C2 / T2 13
Processes, Precedence through IPC Teaching
Graphs
14 Race Conditions, Solve synchronization Flowcharts + Coding Board C2 / T2 14
Semaphores, Mutual problems using semaphores Examples
Exclusion
15 Peterson’s Algorithm, Implement process Simulation + Coding Board + IDE C5 / T2 15
Producer-Consumer synchronization techniques
Problem
16 Event Counters, Identify synchronization Interactive Lecture Board C5 / T2 16
Monitors, Message and message passing
Passing concepts
17 Classical IPC Solve classic IPC problems Role Play + Diagram Board C5 / T2 17
Problems: Reader-
Writer
18 Dining Philosophers, Analyze and apply Group Problem Solving Board C5 / T2 18
Barber’s Problem concurrency control
UNIT - III
19 Deadlocks: Definition Identify the conditions that Lecture + Real-Time Board C1 / T3 19
lead to deadlocks Example
20 Necessary & Explain formal conditions Think-Pair-Share Board C1 / T3 20
Sufficient Conditions of deadlocks
for Deadlock
21 Deadlock Prevention Apply prevention and Problem Solving Board C1 / T3 21
& Avoidance – avoidance techniques
Banker’s Algorithm
22 Deadlock Detection Analyze how OS detects Case Study Board C1 / T3 22
and Recovery and recovers from
deadlocks
23 Critical Region in Understand protected Coding Demonstration Board C4 / T3 23
Concurrent regions of concurrent code
Programming
24 Conditional Critical Analyze mutual exclusion Scenario-based Board C4 / T3 24
Region based on conditions Learning
25 Monitors Use monitors for Diagram Explanation Board C4 / T3 25
 synchronization
26 Concurrent Languages Identify features of Comparative Study Board C4 / T3 26
concurrent programming
languages
27 Communicating Describe message-based Model-based Teaching Board C4 / T3 27
Sequential Process concurrency
(CSP)
UNIT -IV
28 Memory Management Understand basics of Lecture with Visual Board C1 / T4 28
Basics memory management Aids
29 Logical vs Physical Differentiate logical and Animation + Examples Board C1 / T4 29
Address Mapping physical address
30 Memory Allocation: Apply memory allocation Hands-on Activity Board C1 / T4 30
Fixed & Variable strategies
Partitions
31 Fragmentation & Understand Illustration-based Board C1 / T4 31
Compaction internal/external Teaching
fragmentation
32 Virtual Memory Understand the use of Board Explanation Board C2 / T4 32
Basics, Hardware & virtual memory
Control Structures
33 Paging, Page Fault, Analyze memory page Diagram-based Board C2 / T4 33
Partitioning management Teaching
34 Working Set & Define and relate working Q&A + Illustration Board C2 / T4 34
Segmentation set and segmentation
concepts
35 Demand Paging Explain the concept and Simulation Board C2 / T4 35
benefits of demand paging
36 Page Replacement Evaluate various page Algorithm Comparison Board C2 / T4 36
Algorithms: Optimal, replacement algorithms
FIFO, SC, NRU, LRU

UNIT - V
 37 I/O Devices & Understand types of I/O Practical Examples Board C1 / T5 37
Controllers hardware and their control
38 DMA – Principles of Describe how DMA works Explanation + Diagram Board C1 / T5 38
I/O in OS
39 File Concepts & Explain types and access Chalk-Talk + Examples Board C2 / T5 39
Access Methods modes of files
40 File Types, Understand how file Diagram + Practice Board C3 / T5 40
Operations, Directory system organizes data Questions
& Allocation
41 Free-Space Analyze file system Activity-Based Board C3 / T4 41
Management, efficiency and structure Learning
Directory
Implementation
42 File System Evaluate performance of Case Study Board C3 / T4 42
Performance & file systems
Efficiency
43 Disk Structure & Illustrate disk structure and Problem Solving Board C3 / T4 43
Scheduling operations
44 Disk Scheduling: Compare different disk Algorithm Simulation Board C3 / T4 44
FCFS, SSTF, SCAN, scheduling algorithms
C-SCAN
45 Disk Reliability, Explain advanced disk Video + Explanation Board C3 / T4 45
Formatting, Boot organization & reliability
Block, Bad Blocks

INNOVATIVE TEACHING METHODOLOGIES

 S.No Date Content Teaching Methodology Relevance to Relevance to POs and PSOs
Course Outcomes
1 Recorded Videos Flipped Classroom CO1, CO2 PO1, PO2, PO7, PO8, PO9, PSO1, PSO2
2 Assigning real-world OS tasks Project-Based Learning CO3, CO5 PO2, PO7, PO8, PO9, PSO2
3 OS Simulation Games/Quizzes Gamification CO2, CO4 PO2, PO7, PO8, PO9, PSO2
4 Debugging Collaborative Learning CO1, CO3, CO4 PO1, PO2, PO7, PO8, PO9, PSO1, PSO2
Scheduling/Deadlock
5 Real-time Memory & Disk Demonstration and Lab Work CO1, CO5 PO2, PO7, PO8, PO9, PSO2
Mgmt Demos

ASSIGNMENT QUESTIONS

S.No Date Assignment Title Questions COs POs/PSOs

1 Scheduling Algorithms in - Implement FCFS, SJF, and RR scheduling algorithms CO2, CO3 PO1, PO2, PO7, PO8,
Real-Time Systems and compare their performance using Gantt charts. PO9, PSO2
- Analyze the impact of scheduling on system
throughput and CPU utilization.
- Justify which scheduling algorithm is ideal for a real-
time operating system.
2 Memory and Paging - Design and implement LRU, FIFO, and Optimal page CO4, CO5 PO1, PO2, PO7, PO8,
Algorithms with replacement algorithms and measure hit/miss ratios with PO9, PSO1, PSO2
Visualization input data.
- Visualize and compare memory fragmentation using
graphs or charts.
- Propose a hybrid paging strategy suitable for modern
embedded systems.

3 Deadlock Detection and - Simulate deadlock conditions using resource CO3 PO2, PO8, PO9, PSO1
Avoidance allocation graph.
- Implement Banker’s algorithm and validate it with
example inputs.
- Discuss real-world systems where deadlock must be
prevented and how.
CONTENT BEYOND SYLLABUS

S.No Date Topic / Activity Description Benefit to Students

1 Case Study on Microkernel vs Monolithic Comparative analysis of real-world OS like Windows Enhances understanding of OS
Kernel Architectures (Monolithic) and QNX/Linux (Microkernel). design in real-time systems.

2 Hands-on with Virtual Machines using Demonstration of process scheduling and memory Improves practical OS exposure
VirtualBox/VMM allocation using virtualized environments. and system configuration skills.

3 Workshop on Shell Scripting in Advanced scripting session covering automation of Builds automation and
UNIX/Linux memory, process, and file management tasks. command-line efficiency.
5 Guest Lecture: OS Security and Industry expert session on securing operating systems Exposes students to
Vulnerability Management from malware and vulnerabilities. cybersecurity aspects in OS.
6 Real-Time Operating Systems (RTOS) Discussion on RTOS like FreeRTOS, VxWorks, and Prepares students for embedded
Overview how they manage processes differently. and IoT systems careers.

UTILIZATION OF AI TOOLS

Unit Topic Focus AI Tools can be Used Purpose / Benefit

To simulate process/thread concepts, create
I Basics of OS, Processes, Threads ChatGPT, Google Bard
summaries, and conduct interactive Q&A
Visualize scheduling algorithms, build rule-
II CPU Scheduling, IPC Excel with AI Plugin, ChatGPT
based scheduling simulations
Design interactive deadlock scenarios;
III Deadlocks, Concurrency Canva (AI diagrams), ChatGPT
visualize concurrent process flows
Generate illustrations for paging,
IV Memory Management Notion AI, Google Sheets AI
segmentation, and memory allocation
Simulate disk scheduling algorithms and file
V I/O, File Systems, Disk Scheduling Code Interpreter AI, QuillBot
system layouts using code-based tools

COURSE OUTCOME
 CO1 Define the concepts of operating systems operations, processes and threads
CO2 Apply the concepts of CPU scheduling and Inter Process
CO3 Describe the concepts of Dead lock and Concurrent Programming.
CO4 Simulate the principles of memory management
CO5 Identify appropriate I/O, file system and disk organizations for a variety of computing scenario

COs/POs/PSOs Mapping
Program Specific
Program Outcomes (POs)
COs Outcomes (PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 2 1 – – 3 – – – – – – – 3 – –
2 3 2 1 1 3 – – – – – – – 2 2 –
3 2 1 – – 3 – – – – – – – 2 2 1
4 3 2 1 1 3 – – – – – – – 2 2 1
5 2 1 – – 3 – – – – – – – 2 2 1
Correlation Level: 1 - Low, 2 - Medium, 3 – High

Evaluation Methods

Continuous Assessment Marks (CAM) End

Semester
Total
Assessment CAT CAT Model Examination
Assignment* Attendance Marks
1 2 Exam (ESE)
Marks
Marks 5 5 5 5 5 75 100
* Application oriented / Problem solving / Design / Analytical in content beyond the syllabus

COURSE ASSESSMENT METHOD

 DIRECT METHODS INDIRECT METHODS
1. Continous Assesment Test – I 1. Course Exit Survey
2. Continous Assesment Test – II
3. Model Exam
4. Assignment
5. Seminar
6. End Semester Exam (University Exam)

Faculty In charge HOD/CSEBS Dean Academics Director cum Principal

Mrs.M.Viji Dr.N.Danapaquiame Dr.S.Anbumalar Dr.V.S.K.Venkatachalapathy