Course Handout (2024-25 EVEN SEMESTER)

Subject Name/Code : Operating Systems(BTCS-T-PC-016) Branch/Sem/Batch :

CEN 4 SEM (A),CSE 4 SEM
(A),CSE 4 SEM (B),CSE 4 SEM
(C),CSE 4 SEM (D),CST 4 SEM
(A)
: Mukti Routray , DEEPIKA RANI SAHU , Sanjay Kumar Giri , Sharmistha Puhan , RAJESH
Name of Faculty KUMAR OJHA , SUBHAM KUMAR PADHY , RASHMITA MOHANTY
Scope & Objective -:

The objective of this course is to understand the fundamental concepts, techniques & algorithms, and internal working
principles of a computer operating system to become a system designer or an efficient application developer.

Pre-Requisite -:

Detailed Syllabus:
Module# CO Topics Hours
Introduction: Overview, Evolution of operating system, Types of
systems - Batch Processing, Multiprogramming, Time Sharing
Module-1 CO1 systems; Personal Computers, Parallel, Distributed, and Real- 6
time Systems; Operating System Services, System components,
System calls.
Process Management: Process concepts, states, PCB, Process
scheduling queues, queuing diagram, Types of schedulers,
Operations on process; Interprocess communication - shared
memory, message passing, Concept of buffering, Thread
overview, Benefits of multi-threaded program, User and kernel
Module-2 CO2 10
threads, Multi-threading models, Issues with multi-threading -
thread cancellation, thread pools, thread specific data; CPU
Scheduling: Dispatcher, Scheduling - Criteria, Algorithms -
FCFS, SJF, SRTF, RR, Priority, Multi-level Queue (MLQ), MLQ
with Feedback.
Process Synchronization: Background, Bounded-buffer –
Shared-memory solution to Producer-consumer problem, Race
condition, Critical section problem - Peterson’s solution,
Synchronization hardware: TestAndSet(), swap() instructions,
Semaphores - Counting and binary semaphore, spinlocks,
Module-3 CO3 Classical problems of synchronization - Bounded-buffer 10
problem, Readers-writers problem, Dining-philosophers
problem, Monitors; Deadlock: System model, characterization,
Resource-allocation graph, Methods for handling deadlocks,
Deadlock prevention & avoidance, Banker’s algorithm,
Deadlock detection & recovery.
Memory Management: Background, Logical & physical address
space, Dynamic loading & dynamic linking, Swapping,
Contiguous memory allocation, Dynamic storage allocation
problem, Overlays, Paging, Segmentation; Virtual Memory:
Module-4 CO4 9
Background, Demand paging, Page fault, Basic page
replacement policy, Page replacement algorithms - FIFO, OPT,
LRU, LRUApproximation, LFU, MFU, Thrashing,Working-set
model.
Module# CO Topics Hours
Secondary Storage Structure: Overview of mass storage
structure, Disk structure, Disk scheduling - FCFS, SSTF, SCAN,
C-SCAN, LOOK, CLOOK, Swap-space management, RAID
Module-5 CO5 structure; File System: Concept, Access methods, Directory 7
structure, Directory implementation, Allocation methods, Free
space management, Access control list; I/O System: Polling,
Interrupts, DMA; Case Studies: The LINUX System.
Total 42 Hours

# Topic Module Chapter Course Coverage No of Classes

Introduction: Overview, Evolution of

1 Module-1 ch 1 TRUE 1
Operating System
Types of Operating System: Batch
2 Processing, Multiprogramming, Time Module-1 ch 1 TRUE 1
sharing Systems
Personal Computers, Parallel, Distributed,
3 Module-1 ch 1 TRUE 1
and Real-time Systems
4 Operating System Services Module-1 ch3 TRUE 1
5 System Components Module-1 ch3 TRUE 1
6 System Calls Module-1 ch3 TRUE 1
Process Management: Process concepts,
7 Module-2 ch4 TRUE 1
states, PCB
Process scheduling queues, queuing
8 Module-2 ch4 TRUE 1
diagram, Types of schedulers
Operations on process, Inter Process
9 Communication: shared memory, message Module-2 ch4 TRUE 1
passing, concept of buffering
Thread overview, Benefits of multi-threaded
10 Module-2 ch5 TRUE 1
program
User and Kernel threads, Multi threading
11 Module-2 ch5 TRUE 1
models
Issues with multi-threading-thread
12 cancellation, thread pools, thread specific Module-2 ch5 FALSE 1
data
CPU Scheduling: Dispatcher,
13 Module-2 ch6 TRUE 1
Schedulingcriteria, Algorithms: FCFS
14 SJF, SRTF Module-2 ch6 TRUE 1
15 RR, Priority Module-2 ch6 TRUE 1
Multi-level Queue(MLQ), MLQ with
16 Module-2 ch6 TRUE 1
feedback
Process Synchronization: Background,
17 Bounded -buffer- shared-memory solution to Module-3 ch7 TRUE 1
producer-consumer problem
Race condition, critical section problem,-
18 Module-3 ch7 TRUE 1
Peterson’s solution
19 Synchronization hardware: TestAndSet() Module-3 ch7 TRUE 1
Semaphores: Counting and Binary
20 Module-3 ch7 TRUE 1
semaphore, spinlock
Classical problems of synchronization:
21 Bounded-buffer problem, Readers-writers Module-3 ch7 TRUE 1
problem, Dining-philosophers problem
22 Monitors Module-3 ch7 TRUE 1
23 Deadlock: System model, Characterization Module-3 ch8 TRUE 1
Resource allocation graph, methods for
24 handling deadlocks, Deadlock prevention Module-3 ch8 TRUE 1
and avoidance
25 Banker’s algorithm Module-3 ch8 TRUE 1
26 Deadlock detection and recovery Module-3 ch8 TRUE 1
Memory Management: Background, logical
27 Module-4 ch9 TRUE 1
and physical address space
Dynamic loading and dynamic linking,
28 Module-4 ch9 TRUE 1
Swapping
29 Contiguous memory allocation Module-4 ch9 TRUE 1
Dynamic storage allocation problem,
30 Module-4 ch9 TRUE 1
Overlays
 31 Paging Module-4 ch9 TRUE 1
32 Segmentation, Segmentation with paging Module-4 ch9 TRUE 1
Virtual Memory: Background, Demand
33 Module-4 ch10 TRUE 1
paging, Page fault
Basic page replacement policy, Page
34 Module-4 ch10 TRUE 1
replacement algorithms - FIFO
35 OPT, LRU, LRU-Approximation, LFU Module-4 ch10 TRUE 1
36 MFU, Thrashing, Working-set model Module-4 ch10 TRUE 1
Secondary Storage Structure: Overview of
37 Module-5 ch14 TRUE 1
mass storage structure, Disk structure
38 Disk scheduling - FCFS, SSTF Module-5 ch14 TRUE 1
SCAN, C-SCAN, LOOK, C-LOOK, Swapspace
39 Module-5 ch14 TRUE 1
management
File System: Concept, Access methods,
40 Directory structure, Directory Module-5 ch11 FALSE 1
implementation
Allocation methods, Free space
41 Module-5 ch12 FALSE 1
management, Access control list
42 I/O System: Polling, Interrupts, DMA Module-5 ch12 FALSE 1

Total no. of classes : 42

Text Book
A. Silberschatz, P. B. Galvin, and G. Gagne, Operating System Concepts, 8th Edition,Wiley, 2009, ., .
M. Milenkovi´c, Operating Systems: Concepts and Design, 2nd Edition, Tata McGraw-Hill, 2001, ., .

Reference Book
A. S. Tanenbaum, Modern Operating Systems, 3rd Edition, PHI, 2009, ., .
P. B. Prasad, Operating Systems and System Programming, 2nd Edition, Scitech Publications, 2015, ., .
Online Reference Material(s):

1. https://nptel.ac.in/courses/106/102/106102132/: by Prof. S. Bansal, IIT Delhi

2. https://nptel.ac.in/courses/106/108/106108101/: by Prof. P. C. P. Bhatt, IISc Bangalore
3. https://nptel.ac.in/courses/106/106/106106144/: by Prof. C. Rebeiro, IIT Madras
4. https://nptel.ac.in/courses/106/105/106105214/: by Prof. S. Chattopadhyay, IIT Kharagpur
5. https://www.cse.iitb.ac.in/mythili/os/: Notes & slides by Prof. M. Vutukuru, IIT Bombay
6. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-828-operatingsystem-
engineering-fall-2012/lecture-notes-and-readings/

Course Outcome:
Explore principles behind various types of operating systems, system components, system calls,
CO1
protection mechanisms and services
Explain different schedulers, scheduling policies, and design new scheduling algorithms for real life
CO2
problems
Describe the significance of process synchronization through classical synchronization problems and
CO3
deadlock handling mechanisms.
Describe the working principle of main memory, cache memory and virtual memory organization
CO4
and solve memory related problems.
Articulate secondary storage management, and analyze the performance of various disk scheduling
CO5
algorithms.

Program Outcomes Relevent to the Course:

Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems
Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.
 Design/development of solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for
the public health and safety, and the cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods
PO4 including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual knowledge to assess
PO6 societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
Environment and sustainability: Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
PO8
the engineering practice.
Individual and team work: Function effectively as an individual, and as a member or leader in
PO9
diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the engineering
PO11 and management principles and apply these to one’s own work, as a member and leader in a team,
to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and life-long learning in the broadest context of technological change.

Mapping of CO's to PO's: (1: Low, 2: Medium, 3: High)

PO1 PO2 PO3 PO4 PO5 PO6 PO12
CO1 3 2 2 2
CO2 3 3 3 2 2
CO3 3 3 3 2 1 1 2
CO4 3 3 3 2 1 1 1
CO5 2 2 3 2 1 1 1