Course Plan/Outline for

CSC 252 - Operating System

General Information
Course Number CSC-252: Operating System
Credit Hours 4 (Theory Credit Hour = 3, Lab Credit Hour = 1)
Prerequisite None
Course Instructor Dr. Qamar Uddin Khand

Course Objectives
The main objectives of the course are to give students the basic concepts of an operating system, types of
an operating system, computer system structures, process management, CPU Scheduling, Process
synchronization, Deadlock, Memory management and Virtual memory management. Furthermore, the
students will learn the operating system design algorithms often based on those used in existing
commercial operating systems. Our aim is to present these concepts and algorithms in general setting that
are not tied to one particular operating system.

Catalog Description
CSC-252

Mode of Delivery
Synchronous and Asynchronous mode of Lectures
• PDF slides of every lecture will be uploaded on SIBAU LMS immediately after the commencement of
lecture
• Interactive session will be conducted as per timetable (Maximum 75 minutes session per day) with no
interval
• SIBAU LMS features and WhatsApp group will be used for handling the Q&A session

Grading Criteria
Mid Exam 30 Marks
Final Exam 50 Marks
Sessional 20 Marks (Class Activities 5%, Class Tests/Assignments 7%, Project 8%)

Course Learning Outcomes

Course Learning Outcomes (CLO)

1 Student will be able to explain the fundamental concepts of Operating Systems

2 Student will be able to design and develop the solution for some known problems

Based on performance evaluation criteria, student will be able to analyze the efficiency of well-
3
known algorithms of operating systems for a particular situation and environment

CLO-SO Map
SO IDs
CLO ID GA 1 GA 2 GA 3 GA 4 GA 5 GA 6 GA7 GA 8 GA 9 GA 10 GA 11 GA 12
CLO 1 1 0 0 0 0 0 0 0 0 0 0 0
CLO 2 0 0 1 0 0 0 0 0 0 0 0 0
CLO 3 0 1 0 0 0 0 0 0 0 0 0 0
Assessment of Course Learning Outcomes
Course Learning Outcomes (CLO) Teaching Strategy Assessment Methodology
Interactive Lectures Class Tests
Student will be able to explain the fundamental
1
concepts of Operating Systems

• Interactive Lectures • Class Tests/Assignments

2• Student will be able to design and develop the •
solution for some known problems

Based on performance evaluation criteria, student Interactive Lectures Class Tests/Assignments/

will be able to analyze the efficiency of well-known Project
3
algorithms of operating systems for a particular
situation and environment

Text Book
Operating System Concepts 10th Edition by Abraham Silbetchatz, Peter Bare Galvin, and Greg Gagne. Published
by Willey

Reference Material
1. Operating Systems: Principles and Practice 2nd Edition by Thomas Anderson, Michael Dahlin

2. Operating Systems: Three Easy Pieces By Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau

Course Content
Week Topics Suggested Reading

Introduction to course
What Operating Systems Do, Computer-System Organization, Computer-
1 System Architecture, Operating-System Operations, Chapter 1
Resource Management, Security and Protection, Virtualization,
Distributed Systems, Kernel Data Structures, Computing Environments
Operating-System Structures
Operating-System Services, User and Operating-System
Interface, System Calls, System Services, Linkers and Loaders, Why
2-3 Chapter 2
Applications are Operating-System Specific, Operating-System Design
and Implementation, Operating-System Structure, Building and Booting an
Operating System
Processes
Process Concept, Process Scheduling, Operations on Processes,
4-5 Interprocess Communication, IPC in Shared-Memory Systems, IPC in Chapter 3
Message-Passing Systems, Examples of IPC Systems, Communication in
Client– Server Systems
Threads & Concurrency
6-7 Multicore Programming, Multithreading Models, Thread Libraries, Chapter 4
Implicit Threading, Threading Issues, Operating-System Examples
CPU Scheduling
8 Scheduling Criteria, Scheduling Algorithms, Thread Scheduling, Multi-Processor Chapter 5
Scheduling,

9 Midterm Examination
 10 CPU Scheduling
Real-Time CPU Scheduling, Operating-System Examples, Algorithm Evaluation

Synchronization Tools
11 The Critical-Section Problem, Peterson’s Solution, Hardware Support for Chapter 6
Synchronization, Mutex Locks, Semaphores, Monitors.

Deadlocks
13-14 System Model, Deadlock in Multithreaded Applications, Deadlock Characterization, Chapter 8
Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection, Recovery from Deadlock.

15 Memory Management Chapter 9

Contiguous Memory Allocation, Paging, Structure of the Page Table, Swapping.

16 Virtual Memory Chapter 10

Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames, Thrashing

17 Revision -

Final Examination

Class Tests/Assignments
All tests will be time-bound tests. Class test(s) will consist of short subjective questions. Assignment(s) can be
assigned as per requirement. This should be noted that class test/Assignments overall weightage is 7% of sessional
marks.

Project
As per requirement of the course, project(s) will be assigned. Project will be time-bound Project(s). One can submit
assigned projects before the deadlines. Late submission will not be allowed. The projects can directly be submitted
on SIBAU LMS. Overall weightage is 8% of sessional marks.

Instructor Contact Details

For any course related queries registered students can contact via email [email protected] or on WhatsApp
group or on SIBAU LMS forum.

Approvals
Prepared by Dr. Raheel Ahmed Memon
Updated by Dr. Qamar Uddin Khand
Last Update January 15, 2024