I - Course Name: 23CS404 INTRODUCTION TO OPERATING SYSTEMS
Program Name B.E/B.Tech. – Common to CSE, IT Sem Category L T P C
Digital Principles and Computer
Prerequisite IV PCC 3 0 0 3
Organization
II - Course Objectives
To understand the basic concepts, objectives, and evolution of operating systems and their
1
components.
To analyze process management techniques, including scheduling, synchronization, and deadlock
2
management.
To explore memory management strategies and their implementation in modern operating
3
systems.
4 To understand storage management, file systems, and input/output systems.
To gain hands-on experience with modern operating systems like Linux, iOS, and Android, and
5
explore emerging challenges in virtualized environments.
III - Course Content
Preamble: This course makes the students to learn the basic concepts and functions of operating systems.
It helps to understand the process and threads. It also helps the students to recognize and various
methods to solve problems relevant to process, process scheduling and deadlocks and illustrates the
various memory management techniques and also describe the I/O management and file storage
structures. This subject enables the students to be familiar with the basis of Linux system and mobile OS
like IOS and Android.
Unit – I INTRODUCTION 10 Hours
Operating System Overview - Objectives and Functions - Types of Operating system-Operating System
Structures - User Operating system Interface- System Calls– Security Measures on Operating system
Unit – II PROCESS MANAGEMENT 11 Hours
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 .
Unit – III MEMORY MANAGEMENT 8 Hours
Memory Management Strategies - Swapping - Contiguous Memory Allocation – Paging - Structure of the
Page Table - Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy on Write
- Page Replacement algorithm–Thrashing
Unit – IV STORAGE MANAGEMENT 9 Hours
Storage system –Disk Scheduling algorithm-Directory Structure - Directory implementation - Directory
organization - File System concept - Access methods - File system mounting-File Sharing and Protection;
File System Implementation - File System Structure - Allocation Methods - Free Space Management; I/O
Systems – I/O Hardware, Application I/O interface, Kernel I/O subsystem.
Unit – V ADVANCED OPERATING SYSTEM 7 Hours
Linux Operating system-Mobile OS - iOS and Android-RTOS-Emerging challenges in New Hardware- VM
Ware and its implementation
TOTAL: 45 Periods
1.Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 10th Edition, John Wiley and Sons Inc., 2018.
Text Books: 2. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition,2022 New
Delhi.
1. Achyut S. Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.
Reference
Books: 2. Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau, "Operating Systems: Three
Easy Pieces," Paperback, Imported Edition, 1 September 2018.
https://archive.nptel.ac.in/courses/106106144/%20 - Introduction to to operating
system
MOOC/Web https://archive.nptel.ac.in/courses/106105172/ - Realtime Operating system(RTOS)
Platforms: https://archive.nptel.ac.in/courses/106102132/ - Operating System
https://archive.nptel.ac.in/courses/106105214/ - Operating System Fundamentals
IV - Course Outcome
Bloom’s Level
On completion of the course, the students will be able to
Mapped
Explain the evolution, objectives, and types of operating systems, including their K2 (Understand)
CO1
structure, system calls, and security measures.
Analyze process management techniques such as process scheduling, inter- K4
CO2
process communication, synchronization, and deadlock handling. (Analyze)
Apply memory management strategies, including paging, segmentation, and K3
CO3
virtual memory, to solve allocation and performance issues. (Apply)
Demonstrate the functioning of storage systems, disk scheduling, and file K4
CO4
systems, and assess their implementation methods. (Analyze)
Evaluate case studies of operating systems like Linux, iOS, Android, and RTOS, K5
CO5
and discuss challenges in modern hardware and virtualization. (Evaluate)
V - Mapping Table Mapping of COs with POs and PSOs
COs/ PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
PSO-1 PSO-2 PSO-3
POs 1 2 3 4 5 6 7 8 9 10 11 12
CO-1 3 1 2 2 - - - - 3 2 3 3 1 1 2
CO-2 2 2 3 1 1 - - - 2 1 2 1 2 2 1
CO-3 1 3 2 2 1 - - - 2 2 1 1 1 1 2
CO-4 1 3 3 3 - - - - 1 2 1 1 2 1 3
CO-5 3 1 2 1 1 - - - 3 2 3 3 2 2 2
Mapping: 1-Low, 2-Medium, 3-High (Mapping value based on usage of Action verbs in each CO)
I - Course Name: 23CS412 OPERATING SYSTEM LABORATORY
Program Name B.E/B.Tech. – Common to CSE, IT Sem Category L T P C
Prerequisite C Programming IV PCC 0 0 3 1.5
II - Course Objectives
1 To install windows operating systems.
2 To understand the basics of Unix command and shell programming.
3 To implement various CPU scheduling algorithms.
4 To implement Deadlock Avoidance and Deadlock Detection Algorithms
5 To implement Page Replacement Algorithms
6 To implement various memory allocation methods.
7 To be familiar with File Organization and File Allocation Strategies.
III - Course Content
LIST OF EXPERIMENTS:
1. Installation of guest Operating system using VM Ware
2. Write a UNIX Commands and Shell Programming
a) UNIX Commands.
b) Shell Programming.
3. Write a Program using System Calls for Process Management (Fork, Exit,Getpid,Wait,Close).
4. Write a Program to implement the various CPU Scheduling Algorithms.
5. Write a Program to implement mutual exclusion by semaphore.
6. Write a program to handle deadlock prevention and avoidance techniques.
7. Write a Program to implement the paging Techniques.
8. Write a Program to implement the following Memory Allocation Methods
a) First Fit
b) Worst Fit
c) Best Fit
8.Write a Program to implement the various Page Replacement Algorithms.
9.Write a Program to implement the following File Allocation Strategies.
a) Sequential
b) Indexed
c) Linked
10.Write a Program for the implementation of various disk scheduling algorithms.
Note: The above programs can be implemented using C/C++/PYTHON
Note: The lab instructor is expected to design Problems based on the topics listed. The Examination
shall not be restricted to the sample experiments designed.
TOTAL: 45 PERIODS
IV - Course Outcome
Bloom’s Level
On completion of the course, the students will be able to
Mapped
Understand
CO1 Illustrate and define the Linux Commands.
(K2)
CO2 Compare the performance of various CPU Scheduling Algorithms. Analyze (K4)
Apply
CO3 Utilize the different algorithms for process communication and synchronization
(K3)
Implement the programs to implement deadlock avoidance algorithms, Apply
CO4
semaphores and IPC (K3)
Implement pthe programs to implement various page replacement algorithms, Apply
CO5
file organization and file allocation strategies (K3)
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 10th Edition, John Wiley and Sons Inc., 2018.
Text Books: 2. Steve Shah and Wale Soyinka “Linux Administration: A Begineer’s Guide”, 4th
Edition, Tata McGraw-Hill Publishing Company Limited, New Delhi, ISBN: 978-
0072262599
1. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition,2022
New Delhi.
Reference 2. Ramaz Elmasri, A. Gil Carrick, David Levine, “Operating Systems – A Spiral
Approach”, Tata McGraw Hill Edition, 2010.
Books:
3. Achyut S. Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education,
2016.
4. Harvey M. Deitel, “Operating Systems”, Third Edition, Pearson Education, 2007.
MOOC/Web
1. https://www.edx.org/learn/operating-systems#eaf4ef6d-6994-5657-8d81-
Platforms: 9fa26f1cd572
V - Mapping Table Mapping of COs with POs and PSOs
COs/ PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PSO- PSO- PSO-
POs 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO-1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
CO-2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
CO-3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
CO-4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
CO-5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
Mapping: 1-Low, 2-Medium, 3-High (Mapping value based on usage of Action verbs in each CO)
