CSC 251 - Operating System Outline

General Information

Course Number CSC-251- Operating System

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.

Grading Criteria
Mid Exam 30 Marks
Final Exam 50 Marks
Sessional 20 Marks (Presentation, Quizzes and
Assignments, class participation)

Course Content
Week Topics Suggested Reading

Introduction to course
What Operating Systems Do, Computer-System Organization,
1 Computer-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 Applications are Operating-System Specific, Operating-System Design Chapter 2
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

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

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

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

Memory Management
15 Contiguous Memory Allocation, Paging, Structure of the Page Table, Swapping. Chapter 9

Virtual Memory
16 Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames, Thrashing Chapter 10

17 Revision -

Final Examination

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. ArpaciDusseau

Course Learning Outcomes

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
3
wellknown 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

Approvals
Prepared by Dr. Ahmed Waqas
Updated by Dr. Raheel Ahmed Memon
Last Update 15 August, 2022
Update 17 February, 2021
History