BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

WORK INTEGRATED LEARNING PROGRAMMES

COURSE HANDOUT

Part A: Content Design

Course Title Operating Systems

Course No(s) BSDCH ZC364
Credit Units 3 (1-1-1) / 4 (1-1-2)
(1 unit for class room hours, 1 unit for lab hours, 1 unit for student
preparation (2 units if 4 credit course)).
Typically 1 unit translates to 32 hours
Course Author Prof. JP Mishra / Chandra Shekar RK
Version No 1.0
Date

Course Objectives
No Course Objective

CO1 To understand the services provided by and the design of an operating system

CO2 To understand the structure and organization of the file system and memory management

CO3 To understand what a process is and how processes are synchronized and scheduled

CO4 To understand the data structures and algorithms used for managing processes, memory
and file system to implement an OS

Text Book(s)
T1 Silberschatz Abraham and others, Operating System Concepts, Wiley Student
Edition, 8th Ed., 2008

Reference Book(s) & other resources

R1 William Stallings, “Operating Systems Internals and Design Principles”, 6 th edition,
Pearson Edition, 2009.
R2 Maurice J. Bach, “The Design of the Unix Operating System”, PHI, 1993.
Modular Content Structure
1. Introduction to OS
1.1. Introduction
1.1.1. Computer-System Organization
1.1.2. Computer-System Architecture
1.1.3. Operating-System Structure
1.1.4. Operating-System Operations
1.1.5. components of computing system
1.1.6. Operating System design issues
1.2. System Structures
1.2.1. Operating-System Services
1.2.2. User Operating-System Interface
1.2.3. System Calls
1.2.4. Types of System Calls
1.2.5. System Programs
1.2.6. Operating-System Design and Implementation
1.2.7. Operating-System Structure
2. Concept of processes and thread
2.1. Process Concept
2.1.1. Process Concept
2.1.2. Process Scheduling
2.1.3. Operations on Processes
2.1.4. Inter-process Communication
2.1.5. Examples of IPC Systems
2.2. Threads
2.2.1. Thread overview
2.2.2. Multithreading Models
2.2.3. Thread Libraries
2.2.4. Threading Issues
3. Process Scheduling
3.1. Basic Concepts
3.2. Scheduling Criteria
3.3. Scheduling Algorithms
3.4. Thread Scheduling
3.5. Multiple-Processor Scheduling
3.6. Algorithm Evaluation
4. Process Synchronization
4.1. The Critical-Section Problem
4.2. Peterson's Solution
4.3. Synchronization Hardware
4.4. Semaphores
4.5. Classic Problems of Synchronization
4.6. Monitors
4.7. Atomic Transactions
5. Dead Lock prevention, avoidance and detection & recovery
5.1. System Model
5.2. Deadlock Characterization
5.3. Methods for Handling Deadlocks
5.4. Deadlock Prevention
5.5. Deadlock Avoidance
5.6. Deadlock Detection
5.7. Recovery from Deadlock
6. Memory Management
6.1. Background
6.2. Swapping
 6.3. Contiguous Memory Allocation
6.4. Paging
6.5. Structure of the Page Table
6.6. Segmentation
7. File Systems
7.1. File-System Structure
7.2. File-System Implementation
7.3. Directory Implementation
7.4. Allocation Methods
7.5. Free-Space Management
7.6. Efficiency and Performance
7.7. Recovery
7.8. NFS
8. Secondary Storage structure & Management
8.1. Overview of Mass-Storage
8.2. Structure
8.3. Disk Structure
8.4. Disk Attachment
8.5. Disk Scheduling
8.6. Disk Management
8.7. Swap-Space Management
8.8. RAID Structure
8.9. Stable-Storage Implementation
8.10. Tertiary-Storage Structure

Learning Outcomes:
No Learning Outcomes

LO1 Students will Identify design issues associated with operating systems

LO2 Students will Analyze and Compare process management concepts including
scheduling, synchronization ,deadlocks

LO3 Students will Examine multithreading and system resources sharing among the users

LO4 Students will Outline file system interface and implementation, disk management

Part B: Contact Session Plan

Academic Term First Semester 2022-2023

HCL BSc Cohort-3 Sem-5 (November 2022 to April 2023)
Course Title Operating Systems
Course No BSDCH ZC364
Lead Instructor J Thangakumar
Course contents

Contact List of Topic Title Topic # Text/Ref

Hour (from content structure in Part A) (from content Book/external
structure in Part A) resource

1 ● Introduction 1.1 T:Ch1:1.1 - 1.9

o Computer-System R1: Ch1
Organization
2 o Computer-System
Architecture
o Operating-System Structure
o Operating-System Operations
o components of computing
system
o Operating System design
issues

3 ● System Structures 1.2 T:Ch2:2.1 - 2.7

o Operating-System Services R1:Ch1
o User Operating-System
4 Interface
o System Calls
o Types of System Calls
o System Programs
o Operating-System Design and
Implementation
o Operating-System Structure

5 ● Process Concept 2.1.1 - 2.1.3 T:Ch3:3.1 - 3.3

o Process Concept R1:Ch2
o Process Scheduling
6 o Operations on Processes

7 o Inter-process Communication 2.1.4 - 2.1.5 T:Ch3:3.4 - 3.5

o Examples of IPC System 2.2.1 - 2.2.4 T:Ch4:4.1 - 4.4
● Threads R1:Ch2
o Thread overview R1:Ch3
o Multithreading Models
8 o Thread Libraries
o Threading Issues

9 ● Process Scheduling 3.1 - 3.2 T:Ch5:5.1 - 5.2

o Basic Concepts R1:Ch8
o Scheduling Criteria

10 ● Scheduling Algorithms 3.3 T:Ch5:5.3

R1:Ch8
11

12 ● Thread Scheduling 3.4 - 3.6 T:Ch5:5.4 - 5.7

● Multiple-Processor Scheduling (5.6 not included)
● Algorithm Evaluation R1:Ch8

13 ● The Critical-Section Problem 4.1 - 4.3 T:Ch6:6.1 - 6.4

● Peterson's Solution R1:Ch4
● Synchronization Hardware

14 ● Semaphores 4.4 - 4.5 T:Ch6:6.5 - 6.6

● Classic Problems of R1:Ch4
Synchronization
15

16 ● Monitors 4.6 - 4.7 T:Ch6:6.7 - 6.9

● Atomic Transactions (6.8 not included)
R1:Ch4

17 ● System Model 5.1 - 5.3 T:Ch7:7.1 - 7.3

● Deadlock Characterization R1:Ch5
● Methods for Handling Deadlocks

18 ● Deadlock Prevention 5.4 - 5.5 T:Ch7:7.4 - 7.5

● Deadlock Avoidance R1:Ch5

19

20 ● Deadlock Detection 5.6 - 5.7 T:Ch7:7.6 - 7.7

● Recovery from Deadlock R1:Ch5

21 ● Background 6.1 - 6.3 T:Ch8:8.1 - 8.3

● Swapping R1:Ch6
● Contiguous Memory Allocation
22

23 ● Paging 6.4 - 6.6 T:Ch8:8.4 - 8.6

● Structure of the Page Table R1:Ch6
● Segmentation
24

25 ● File-System Structure 7.1 - 7.2 T:Ch11:11.1 - 11.2

● File-System Implementation R1:Ch11

26 ● Directory Implementation 7.3 - 7.4 T:Ch11:11.3 - 11.4

● Allocation Methods R1:Ch11
 27 ● Free-Space Management 7.5 - 7.6 T:Ch11:11.5 - 11.6
● Efficiency and Performance R1:Ch11

28 ● Recovery 7.7 - 7.8 T:Ch11:11.7 - 11.8

● NFS R1:Ch11

29 ● Overview of Mass-Storage 8.1 - 8.4 T:Ch12:12.1 - 12.3

● Structure R1:Ch10
● Disk Structure
● Disk Attachment

30 ● Disk Scheduling 8.5 T:Ch12:12.4

R1:Ch10

31 ● Disk Management 8.6 - 8.7 T:Ch12:12.5 - 12.6

● Swap-Space Management R1:Ch10

32 ● RAID Structure 8.8 - 8.10 T:Ch12:12.7 - 12.9

● Stable-Storage Implementation R1:Ch10
● Tertiary-Storage Structure

Detailed Plan for Lab work/Design work:

Any Linux based System with GCC compiler, CPU-OS simulator (http://www.teach-
sim.com)
Lab Lab Objective Lab Sheet Access URL Content
No Reference

1 Operating System Calls - Implementing programs using

the Open, Write, Fork system calls

2 Inter-process communication - Shared memory and

Message passing program implementation

3 Using CPU-OS simulator - understand Threads

4 Using CPU-OS simulator - understand Process

Scheduling

5 Using CPU-OS simulator - understand Synchronisation

6 Using CPU-OS simulator - understand Deadlocks

Work integration: Detailed plan

No Activity description

1 Presentation of the systems used in the work environment highlighting the

implementation and use of OS
Evaluation Scheme
Evaluation Name Type Weight Duration Day, Date,
Component (Quiz, Lab, Project, Mid (Open book, Session, Time
term exam, End semester Closed book,
exam, etc) Online, etc.)

EC – 1 Quiz 1 Online 5% 10 days To be announced

Quiz 2 Online 5% 10 days To be announced

Assignment/Lab 1 Open book 10% 15 days To be announced

Assignment/Lab 2 Open book 10% 15 days To be announced

EC – 2 Mid Semester Test Open book 30% 2 hours Saturday,

07/01/2023
(Forenoon)

EC – 3 Comprehensive Open book 40% 3 hours Saturday,

Examination 01/04/2023
(Forenoon)
Important Information
Syllabus for Mid-Semester Test (Open Book): Topics covered in contact sessions 1-8
Syllabus for Comprehensive Exam (Open Book): All topics given in plan of study

Examination Guidelines:
1. For Closed Book tests: No books or reference material of any kind will be permitted.
Laptops/Mobiles/ Electronic communication devices of any kind are not allowed. Exchange
of any material is not allowed.
2. For Open Book exams: Use of prescribed text books and reference books is permitted.
Handwritten class notes, printed lecture slides, and other reference material in filed or bound
form is permitted. However, loose sheets of paper will not be allowed. Use of scientific
calculators is permitted in all exams. Laptops/Mobiles/Electronic communication devices of
any kind are not allowed. Exchange of any material is not allowed.
3. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the
student should follow the procedure to apply for the Make-Up Test/Exam. The genuineness of
the reason for absence in the Regular Exam shall be assessed prior to giving permission to
appear for the Make-up Exam. Make-Up Test/Exam will be conducted only at selected exam
centres on the dates to be announced later.
4. It shall be the responsibility of the individual student to be regular in maintaining the self-
study schedule as given in the course handout, attend the lectures, and take all the prescribed
evaluation components such as Assignments/Quizzes/Labs, Mid-Semester Test and
Comprehensive Examination according to the evaluation scheme provided in the handout.
5. For the written/lab assignments, copying from websites and other sources, including
other students, is considered plagiarism. Students must be advised against plagiarism
and asked to document and cite references of all sources.