23CY202 OPERATING SYSTEMS 3/0/2/4

Nature of Course: F (Theory Programming)

Pre requisites: Nil
Course Objectives:
1 To identify the structure and functions of Operating System.
2 To describe the OS mechanisms to handle processes and threads.
To experiment CPU scheduling policies, synchronization techniques and deadlock handling in real time
3
problems.
4 To articulate Memory management schemes.
5 To discuss Device Management, I/O and File systems concepts.
Course Outcomes
Upon completion of the course, students shall have ability to
C202.1 Review the basic concepts and functions of operating systems. [U]
Interpret the processes and threads in operating systems for real world
C202.2 [U]
problems.
Examine CPU scheduling algorithms, process synchronization mechanisms and
C202.3 [AP]
deadlock handling methods.
Practice memory management techniques including virtual memory and page
C202.4 [AP]
replacement algorithms.
C202.5 Illustrate the concepts related to mass storage, I/O and file system. [AP]
Course Contents:

Module I Introduction 15 Hours

Defining Operating Systems - User view - System view - Computer-System organization - Computer System
Architecture - Operating System Operations - Resource Management - Virtualization - Computing
Environments - OS Services - System Calls - Overview of Operating System Specific applications - OS
Structures - System Boot. Process: Concept - Scheduling – Operations. Thread: Overview - Multicore
Programming - Multithreading Models.

Module II Process & Memory Management 15 Hours

CPU Scheduling - Process Synchronization: Synchronization Tools - Classic Problems of Synchronization –
Deadlocks: System Model- Deadlock in Multithreaded Applications - Deadlock Characterization - Methods for
Handling Deadlocks - Prevention - Avoidance -Detection – Recovery. Main memory: Background - Contiguous
Memory Allocation – Paging - Structure of the Page Table – Swapping. Virtual memory - Background - Demand
Paging - Copy-on-Write - Page Replacement - Allocation of Frames - Thrashing - Memory Compression.

Module III File Management, I/O and storage 15 Hours

File-System Interface: File concept - Access Methods-Directory Structure - Protection. File System
Implementation: File System Structure- Directory implementation- Allocation Methods- Free Space
Management. File system Internals: File Systems - File System mounting - Partitions and Mounting - File
Sharing. I/O Systems: Overview - I/O Hardware. Mass Storage Structure: Overview - HDD Scheduling - NVM
Scheduling - Storage Device Management - Storage Attachment. Case Study: NAND flash storage system,
IPC in windows.

Total Hours: 45
Laboratory Component:
S. No List of Experiments
Study of Basic Linux Commands, proc file system of linux, disk I/O, buffer caches, disk monitoring
1. tool
2. Implementation of Shell Programming
3. Implementation of Unix System Calls
 4. Implementation of Non Pre emptive and Pre emptive CPU Scheduling Algorithms
5. Implementation of Dining Philosopher’s Problem to demonstrate Process Synchronization
6. Implementation of Banker’s Algorithm for Deadlock Avoidance
7. Implementation of Memory Allocation and Management Techniques
8. Implementation of Page Replacement Techniques
Implementation of File organization Techniques and study on modern file systems like ZFS, btrfs,
9.
ext4 etc.
Implementation of Disk Scheduling Algorithms. Compare CPU and Disk Scheduling algorithms in
10.
terms of the number of voluntary and involuntary context switches.
Total Hours: 30
Text Books:
Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Concepts” 10th Edition,
1.
John Wiley, 2018
2. D.M Dhamdhere, “Operating Systems”- A Concept based Approach, 3rdEdition, McGraw Hill,2017
Reference Books:
1. Andrew S. Tanenbaum, Modern Operating Systems 5thEdition, Pearson Education, 2016.
William Stallings, “Operating Systems – Internals and Design Principles”, 8thEdition, Pearson
2.
Publications, 2014.
Web References:
https://www.studocu.com/sg/course/nanyang-technological-university/operating-
1.
systems/1390534
2. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/
3. https://www.gatevidyalay.com/operating-system/
Online Resources:
1. https://www.coursera.org/learn/os-power-user
2. https://nptel.ac.in/courses/106108101

Continuous Assessment
Theory Practical End
Total Semester Total
Forma Summ Format Summati Total
tive ative Total ive ve Total Continuous Examination
Total (A+B)
Asses Asses (A) Assess Assess (B) Assessment
sment sment ment ment
80 120 200 100 75 25 100 200 50 50 100

Formative Assessment based on Capstone Model - Theory

Assessment Component (Choose
Bloom’s and map components from the list - FA (10%)
Course Outcome
Level Quiz, Assignment, Case Study, [80 Marks]
Seminar, Group Assignment)
C202.1 Understand Quiz 20
C202.2 Understand Assignment 20
C202.3 & C202.4 Apply Tutorial 20
C202.5 Apply Case Study 20
Assessment based on Summative and End Semester Examination - Theory
Summative Assessment (15%) End Semester
Bloom’s Level [120 Marks] Examination (35%)
CIA1: (60 Marks) CIA2: (60 Marks) [100 Marks]
Remember 20 20 20
Understand 40 30 40
Apply 40 50 40
Analyse - - -
Evaluate - - -
Create - - -
Assessment based on Continuous and End Semester Examination - Practical
Continuous Assessment (25%) End Semester
Bloom’s Level [100 Marks] Examination (15%)
FA: (75 Marks) SA: (25 Marks) [100 Marks]
Remember 20 20 20
Understand 40 20 30
Apply 40 60 50
Analyse - - -
Evaluate - - -
Create - - -
Assessment based on Continuous and End Semester Examination
End
Semes
ter
Continuous Assessment (50%)
Exami
nation
(50%)
Practical Theory
CA 1 CA 2 Exam Exami
(100 Marks) (100 Marks) (100 nation
Marks) (35%)
FA 1 FA 2 Practic
FA SA al
SA 1 Component SA 2
Component-II Component-I Component-II (75 (25 Exami
(60M) -I (60M)
(20 Marks) (20 Marks) (20 Marks) M) M) nation
(20 Marks) (15%)

Programme Specific Outcomes

Course Outcome Programme Outcomes (PO)
(PSO)
(CO)
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
C202.1 2 2 2 - - - - - 2 1 - 2 2 2 2
C202.2 3 3 3 2 2 - - - 2 1 - 3 3 2 2
C202.3 3 3 3 3 3 - - - 2 1 - 3 3 2 2
C202.4 3 3 3 3 3 - - - 2 1 - 3 3 2 2
C202.5 3 3 3 - - - - - 2 1 - 3 2 2 2