COURSE CODE COURSE TITLE L T P C
10211AM106 OPERATING SYSTEMS 3 0 0 3
Course Category: Program Core
A. Preamble
This course provides discussion about Operating systems kernel architecture, address spaces,
system call interface, processes & threads, inter process communication, CPU scheduling
deadlock, scheduling, main memory, virtual memory and file systems. This course aims to
understand how Operating system makes computer system convenient to use in an efficient
manner.
B. Prerequisite Courses
10211AM101 - Data Structures
C. Courses Objective
Learners are exposed to
Recognize operating Systems basic concepts, structures and System Calls
Apply process management concepts and Synchronization techniques
Learn different CPU scheduling algorithms and Deadlock Handling methods
Understand Various Memory and File management techniques
D. Course Outcomes:
Upon the successful completion of the course, students will be able to:
Level of learning
CO domain (Based on
Course Outcomes
Nos. revised Bloom’s)
Describe the operating system structures, operations and
CO1 K2
system calls
Demonstrate process management concepts and process
CO2 K3
synchronization methods for real time problems.
Illustrate CPU scheduling algorithms and deadlock handling
CO3 K2
methods for the given situation.
Explain the concepts of various memory management
CO4 K2
techniques
Discuss the concepts of disk Management and File System
CO5 K2
Interface
Knowledge Level (Based on revised Bloom’s Taxonomy)
K1-Remember K2-Understand K3-Apply K4-Analyze K5-Evaluate K6-Create
E. Correlation of COs with Pos and PSOs:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO 2
1
CO 2 3
2 2
2
CO 3 2
2 2
3
CO
2 2 2 2
4
CO
2 2 2 2
5
F. Course Content:
UNIT 1 Structure and Overview of Operating Systems L-8 Hours
Operating system overview: Objectives – functions - Computer System Organization - operating
System Operations- System Calls, System Programs-Operating- System Structure:
Traditional UNIX system structure-The Mac OS X structure - Architecture of Google’s Android.
UNIT 2 Process Management L-10 Hours
Processes: Process Concept – Threads - Process Scheduling - Operations on Processes – Inter
process Communication - Communication in Client–Server Systems-Pipes (RPC, Pipes) -
Process Synchronization: The Critical-Section Problem - Semaphores – Mutex Locks- Classic
Problems of Synchronization – Monitors. Case Study: Windows Threads and Linux Threads
UNIT 3 CPU Scheduling and Deadlock Management L-9 Hours
CPU Scheduling: Scheduling Criteria - Scheduling Algorithms. Deadlocks: Deadlock
Characterization - Methods for Handling Deadlocks - Deadlock Prevention - Deadlock
Avoidance - Deadlock Detection - Recovery from Deadlock. Case Study: Real Time CPU
scheduling
UNIT 4 Memory Management L-9 Hours
Main Memory: Swapping - Contiguous Memory Allocation, Segmentation, Paging - Structure of
the Page Table - Virtual Memory: Demand Paging - Page Replacement - Allocation of Frames –
Thrashing. Case study: Virtual machine
UNIT 5 Storage Structure & File Systems L-9 Hours
Mass Storage Structure: Disk Structure - Disk Scheduling - Disk Management-Structure - File-
System Interface: File Concepts -Directory Structure - File Sharing – Protection- File Allocation
Methods-NFS. Case study: Recovery in Windows.
TOTAL : 45 Hours
G. Learning Resources (in IEEE Format)
i. Text Books:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th
Edition, John Wiley and Sons Inc., 2016.
ii. Reference Books:
1. Andrew S. Tanenbaum, “Modern Operating Systems”, 4th Edition, Prentice Hall, Wesley,
2014.
2. Operating Systems: Principles and Practice (2nd Edition), by Thomas Anderson and Michael
Dahlin.
iii. Online Resources:
1. “Learn Operating System” Accessed on: April 21, 2021 [Online].
Available:https://www.tutorialspoint.com/operating_system/index.htm
2. Prof.Santanu Chattopadhyay, “Operating System Fundamentals” July 25,2019. Accessed on:
April 21, 2021 [Online]. Available:https://nptel.ac.in/courses/106/105/106105214/
