UCS303 OPERATING SYSTEMS

(For the year 2020)

L T P Cr
3 0 2 4.0

Course Objectives: To understand the role, responsibilities, and the algorithms involved for
achieving various functionalities of an Operating System.

Introduction and System Structures: Computer-System Organization, Computer-System

Architecture, Operating-System Structure, Operating-System Operations, Process Management,
Memory Management, Storage Management, Protection and Security, Computing Environments,
Operating-System Services, User and Operating-System Interface, System Calls, Types of
System Calls, System Programs, Operating-System Design and Implementation,
Operating-System Structure.

Process Management: Process Concept, Process Scheduling, Operations on Processes,

Inter-process Communication, Multi-threaded programming: Multi-core Programming,
Multithreading Models, Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling
Algorithms, Multiple-Processor Scheduling, Algorithm Evaluation.

Deadlock: System Model, Deadlock Characterization, Methods for Handling Deadlocks,

Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock.

Memory Management: Basic Hardware, Address Binding, Logical and Physical Address,
Dynamic linking and loading, Shared Libraries, Swapping, Contiguous Memory Allocation,
Segmentation, Paging, Structure of the Page Table, Virtual Memory Management: Demand
Paging, Copy-on-Write, Page Replacement, Allocation of Frames, Thrashing, Allocating Kernel
Memory.

File Systems: File Concept, Access Methods, Directory and Disk Structure, File-System
Mounting, File Sharing, Protection, File-System Structure, File-System Implementation,
Directory Implementation, Allocation Methods, Free-Space Management.

Disk Management: Mass Storage Structure, Disk Structure, Disk Attachment, Disk Scheduling,
Disk Management, Swap-Space Management, RAID Structure.

Protection and Security: Goals of Protection, Principles of Protection, Domain of Protection,

Access Matrix, Implementation of the Access Matrix, Access Control, Revocation of Access
Rights, Capability-Based Systems, The Security Problem, Program Threats, System and Network
Threats, User Authentication, Implementing Security Defenses, Firewalling to Protect Systems
and Networks.

Concurrency: The Critical-Section Problem, Peterson’s Solution, Synchronization Hardware,

Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors.
Laboratory work: To explore detailed architecture and shell commands in Linux / Unix
environment, and to simulate CPU scheduling, Paging, Disk-scheduling and process
synchronization algorithms.

Course learning outcomes (CLOs):

After the completion of the course, the student will be able to:
1. Explain the basic of an operating system viz. system programs, system calls, user mode and
kernel mode.
2. Select a particular CPU scheduling algorithms for specific situation, and analyze the
environment leading to deadlock and its rectification.
3. Explicate memory management techniques viz. caching, paging, segmentation, virtual
memory, and thrashing.
4. Understand the concepts related to file systems, disk-scheduling, and security, protection.
5. Comprehend the concepts related to concurrency.

Text Books:

1. Silberschatz A., Galvin B. P. and Gagne G., Operating System Concepts, John Wiley & Sons Inc
(2013) 9th ed.
2. Stallings W., Operating Systems Internals and Design Principles, Prentice Hall (2018) 9th ed.

Reference Books:

1. Bovet P. D., Cesati M., Understanding the Linux Kernel, O'Reilly Media (2006), 3rd ed.
2. Kifer M., Smolka A. S., Introduction to Operating System Design and Implementation: The OSP 2
Approach, Springer (2007).

th
PLEASE NOTE: All the Chapters & respective Sections refer below are taken from 9 Edition of the
book “Operating System Concepts” By Galvin. We (Course Coordinators) don’t take the responsibility for
any discrepancy in Chapters & Sections, if someone is referring from any other Edition.

Introduction and System Structures: CHAPTER -1 Introduction

Computer-System Organization, Complete (Excluding –
Computer-System Architecture, Sec 1.10 – Kernel Data Structure,
Operating-System Structure, Sec 1.11.6 - Virtualization,
Operating-System Operations, Process Sec 1.11.7 – Cloud Computing,
Management, Memory Management, Sec 1.11.8 – Real time embedded systems,
Storage Management, Protection and Sec 1.12 – Open Source Operating Systems)
Security, Computing Environments,
Operating-System Services, User and CHAPTER -2 System Structure
Operating-System Interface, System Complete (Excluding –
Calls, Types of System Calls, System Sec 2.7.5 – Hybrid Systems,
Programs, Operating-System Design and Sec 2.8 – Operating system debugging,
Implementation, Operating-System Sec 2.9 – Operating system generation)
Structure.
Process Management: Process Concept, CHAPTER -3 Process Concepts
Process Scheduling, Operations on Complete (Excluding – Sec 3.5, Sec 3.6)
Processes, Inter-process Communication,
Multi-threaded programming: Multi-core CHAPTER -4 Multithreaded Programming
Programming, Multithreading Models, Complete (Excluding – Sec 4.4, Sec 4.5, Sec
Process Scheduling: Basic Concepts, 4.6, Sec 4.7)
Scheduling Criteria, Scheduling
Algorithms, Multiple-Processor CHAPTER -5/6 Process Scheduling
Scheduling, Algorithm Evaluation. Complete (Excluding Sec 5.4, Sec 5.6, Sec
5.7, Sec 5.8) [Including Sec 5.5]

Please note that if you are following e-book

of 9th Edition; then for this specific chapter
please follow CHPATER 6 (from e-book)
named CPU Scheduling and topic
numbering will go like: Complete (Excluding
Sec 6.4, Sec 6.6, Sec 6.7, Sec 6.8) [Including
Sec 6.5]

Deadlock: System Model, Deadlock CHAPTER -7 Deadlock

Characterization, Methods for Handling (Full Chapter)
Deadlocks, Deadlock Prevention,
Deadlock Avoidance, Deadlock
Detection, Recovery from Deadlock.

Memory Management: Basic CHAPTER -8 Memory Management

Hardware, Address Binding, Logical and Strategies
Physical Address, Dynamic linking and Complete (Excluding Sec 8.6.4, 8.7, 8.8)
loading, Shared Libraries, Swapping,
Contiguous Memory Allocation,
Segmentation, Paging, Structure of the
Page Table.

Virtual Memory Management: CHAPTER-9 Virtual Memory

Demand Paging, Copy-on-Write, Page Management
Replacement, Allocation of Frames, Complete (Excluding Sec 9.6.2, Sec 9.6.3,
Thrashing, Allocating Kernel Memory. Sec 9.6.4, Sec 9.7, Sec 9.8, Sec 9.9, Sec 9.10)
Disk Management: Mass Storage CHAPTER-10 Mass Storage Structure
Structure, Disk Structure, Disk Complete (Excluding Sec 10.7.4 to 10.7.6,
Attachment, Disk Scheduling, Disk 10.8, 10.9)
Management, Swap-Space Management,
RAID Structure.
Protection and Security: Goals of CHAPTER-14 Protection
Protection, Principles of Protection, (Include Only Sec 14.1, 14.2, 14.3.1, 14.4,
Domain of Protection, Access Matrix, 14.5)
Implementation of the Access Matrix, CHAPTER-15 Security
Access Control, Revocation of Access (Include Only Sec 15.1, 15.2)
Rights, Capability-Based Systems, The
Security Problem, Program Threats,
System and Network Threats, User
Authentication, Implementing Security
Defenses, Firewalling to Protect Systems
and Networks.

File Systems: File Concept, Access CHAPTER-11 File System Interface

Methods, Directory and Disk Structure, (Include Only 11.1, 11.2, 11.3, 11.5, 11.6)
File-System Mounting, File Sharing, CHAPTER-12 File System Implementation
Protection, File-System Structure, (Include Only 12.1, 12.2, 12.3, 12.4, 12.7)
File-System Implementation, Directory
Implementation, Allocation Methods,
Free-Space Management.

Concurrency: The Critical-Section CHAPTER-06/05 Process Synchronization

Problem, Peterson’s Solution, (Include Only 6.1, 6.2, 6.3, 6.4, 6.5, 6.6, 6.7)
Synchronization Hardware, Mutex
Locks, Semaphores, Classic Problems of Please note that if you are following e-book
Synchronization, Monitors. of 9th Edition; then for this specific chapter
please follow CHPATER 5 (from e-book)
named Process Synchronization.