The Islamia University of Bahawalpur

Faculty of Engineering
Department of Computer Systems Engineering
SESSION 2019-2023
6TH SEMESTER

Course: Operating Systems Instructor Engr. Majdah Alvi

Course Code COMP-01628 Office Room No. 12
Credit Hours 02+01 Email [email protected]
Contact Hours 2+3 Contact No. 03332783884

Pre-Requisite(s) Data Structure and Algorithms Office Hours Mon-Fri 8:30 am to 4:30 pm

Course Outline:
Operating System role, purpose and functionality, API (application program interface) Concepts,
Operating-Systems Structure; Virtual Machines; Operating-Systems Generation; Process and
Process Scheduling, CPU Scheduling Concept; Scheduling Criteria and Algorithms.
Multiprocessor and Thread scheduling, Process synchronization, Critical Section Problem,
Deadlocks: Prevention; Avoidance; Detection; Recovery, Memory management, Swapping;
Paging; Segmentation; Virtual-Memory Management, Storage Management, File-System
Structure; File-System Implementation; I/O System, Application I/O Interface; Kernel I/O
Subsystem, Protection and Security, Program Threats; System and Network Threats; Distributed
Operating Systems; Distributed File Systems, Introduction to mobile operating systems, intro to
distributed os and introduction to RTOS

Course Learning Outcomes CLOs Theory:

At the end of the course, students should be able to:
Domain
CLOs Description PLOs

Understand fundamental operating system abstractions such as

CLO1 operating system structure, services, processes, threads, files, C-2 1
semaphores, IPC abstractions, shared memory regions, etc.
CLO2 Analyse various OS sub-systems C-2 2

Evaluate essential algorithms used in core operating system

functions/algorithms: Process scheduling, memory management
CLO3 C-3 4
algorithms, Deadlocks in OS

Course Learning Outcomes CLOs Lab Work:

At the end of the course, students should be able to:
CLOs Description Cognitive PLOs
Domain
CLO1 Implement various OS algorithms and sub-systems P-4 PLO3
Relation of CLOs to the Program Learning Outcomes (PLOs):

1 2 3 4 5 6 7 8 9 10 11 12

Individual and Team Work

The Engineer and Society
Design & Development of
Engineering Knowledge

Project Management
Modern Tool Usage

Life Long Learning

Problem Analysis

Environment and

Communication
Sustainability
Investigation
Solutions

Ethics
CLO1 √

CLO2 √

CLO3 √

CLO4 √

CLOs Lab Work

CLO5 √

Total 1 2 2 1

Impact Low High High Low

Assessment of CLOs:
CLO1 CLO2 CLO3 CLO4
Assignments 1 1 1
Quizzes 1 1 1
Mid Term Exam 1 1 1
Final Term Exam 1 1 1 1
Others
(Projects/presentations)

Recommended Books:
1. Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter Galvin and Greg Gagne, John
Wiley, 2012.
2. Modern Operating Systems, 4th Edition Andrew S. Tanenbaum, HerbetBos, Prentice Hall, 2014.
3. Operating Systems: Internals and Design Principles, 8 th Edition, William Stallings, Prentice-Hall,
2014.
 Topics Hours/Week
Introduction

1. Overview of Operating Systems

o What is an OS
o Brief history.
2. Background and Basics Week 1
o Computer System review
 Architecture
 Instruction cycle
 Process Control Block

o Basic OSs
 Batch
 Multi-programmed batch
 Timesharing
o Computer System Structures
o Operating System Structures

3. Processes

o Definition Week 2-Week 3

o Process States
 5 state model
 7 state model
o Process structure
 PCB and components
o Operations on Processes
o Threads

4. CPU Scheduling
o I/O burst cycle
o Context Switching
o Scheduling
 Short Term
 Long Term
o Scheduling Criteria Week 4-week-5
o Algorithms
 First Come First Serve
 Shortest Job First
 Priority Scheduling
 Round Robin

. Deadlocks Week 5-Week 7

 o System Model
o Necessary Conditions for a deadlock
 Mutual Exclusion
 Hold and Wait
 No Preemption
 Circular wait
o Resource Allocation Graphs
o Handling Deadlocks
 Prevention
 Avoidance
 Detection
 Recovery
 Bankers Algorithm

5. Process Synchronization

o Critical Section Problem

 Mutual Exclusion
 Races
o Two Process Solutions
 Algorithm 1
Week7-Week9
 Algorithm 2
 Algorithm 3
 Bakery Algorithm
o Synchronization Hardware
 Test and Set
 Swap

 Semaphores
 Deadlocks and Starvation
 Classic Synchronization Problems
Week-10
o Readers/Writers
o Dining Philosophers

7. Memory Management Week-11-Week-13

o Address Binding
 Compile time
 Load time
 Execution time
o Logical versus Physical Address Space
o Swapping
 Contiguous Allocation
  Single Partition
 Multiple Partition
 First Fit
 Best Fit
 Worst Fit
 Internal and External Fragmentation
o Paging and Virtual Memory
 Basics
 Demand Paging
 Page Replacement
 Page Replacement Algorithms
 FIFO
 Belady’s anomaly
 Optimal
 LRU
 MFU
o Thrashing

8. Storage

o Files
 Attributes
 Operations
 File types
 Structure
 Access methods
Week-13-Week-14
o Directory Structure
o Protection

9. File System Implementation

o Allocation methods
o Free Space Management

10. Secondary Storage Structure Week-15week-16

o Disks
Structure

Scheduling

 FCFS
 SSTF
 SCAN
11. Protection & Security
 Principles & Domain of Protection
 Access Matrix
 Access Control & Rights
  Threats

Grading Policy vis-à-vis CLO Mapping (Theory)

Assignments/Quizzes/Presentations 20% CLO1 to CLO4

Mid Term Examination 30% CLO1,CLO2,CLO3

Final Term Examination 50% CLO1,CLO2,CLO3,CLO4

Grading Policy vis-à-vis CLO Mapping (Lab Work)

Lab work / Viva Voce / Documentation 60% CLO1

Open Ended Lab (OEL) 20% CLO1

Final Examination 20% CLO1

---------------END--------------------