National Computing Education Accreditation

Council
NCEAC
NCEAC.FORM.001

Course
Outline
School / Department School of Systems and Technology – SST / Department of Computer Science

Course Code CC-3011

Course Title Operating Systems

Theory / Lab / FYP Theory

Degree Program BS-CS

Credit Hours 3+1 Contact Hours 3

Pre-requisite Data Structures & Algorithms

Classroom Lectures, Assignments, Class Activities, Presentations, Quizzes, Mid
Teaching
Term Exam, Final Term Exam.
Methodology
Assignment(s) 10%

Quizzes 15%

Mid-Term Examination 30%

Methods of
Class Activities 05%
Assessment (Can be
changed as per Final Examination 40%
course requirement)
Total 100%
Course
Moderator / Ms. Ayesha Asmat
Coordinator
Contact [email protected]
Counseling Hours Monday - Friday (10:00 am – 11:00 am)

Semester Offered 5 th
This course provides an opportunity to learn about operating systems
Course Synopsis through examination of theoretical concepts underlying various operating
systems components and assignments involving these concepts

Understand fundamental operating system abstractions such as

processes, threads, files, semaphores, IPC mechanisms, and shared
Course Objectives memory, along with their implementation.
Grasp the principles of concurrency and synchronization and apply them
to develop correct concurrent programs.
Familiarize yourself with resource management techniques and strategies
to ensure performance, fairness, deadlock avoidance, security, and
protection.
 National Computing Education Accreditation
Council
NCEAC
NCEAC.FORM.001

Course Learning Outcomes (CLOs) Domain & BT*

Level
After the successful completion of the course, the students will be able to:
CLO1: Understand the characteristics of different structures of the Operating Systems
and identify the core functions of the Operating Systems. C2 (Understand)

CLO2: Analyze and evaluate the algorithms of the core functions of the Operating
Systems and explain the major performance issues with regard to the core C5 (Evaluate)
functions.
CLO3: Demonstrate the knowledge in applying system software and tools available
in modern operating systems. C3 (Demonstrate)

* BT= Bloom’s Taxonomy, C=Cognitive domain, P=Psychomotor domain, A= Affective domain

Mapping of CLOs to Program Learning Outcomes

(PLOs)
CLOs / CLO 1 CLO 2 CLO 3
PLOs
PLO1: Academic Education ✔

PLO2: Knowledge for Solving Computing Problems ✔ ✔

PLO3: Problem Analysis
PLO4: Design/ Development of Solutions
PLO5: Modern Tool Usage
PLO6: Individual and Teamwork
PLO7: Communication
PLO8: Computing Professionalism and Society
PLO9: Ethics
PLO10: Life-long Learning
 National Computing Education Accreditation
Council
NCEAC
NCEAC.FORM.001

Tentative Week-wise list of topics

Sessional
We Topi Referenc CLOs
Assessmen
ek cs e t
Introduction to Operating Systems
● What is an OS
● Computer-System Organization
Week 1 Chapter CLO 1
● Computer-System Architecture
1
● Operating System Operations

Operating-System Structures
● Operating-System Services
● User and Operating-System Interface
● System Calls Chapter Class
● Types of System Calls 2 Activity CLO 1
Week 2 ● Why Applications Are Operating-System
Specific
● Operating System Design and
Implementation
● Operating System Structure

Process
● Process Concept
● Process Scheduling
● Operations on Processes Chapter Quiz 1
Week 3 3 CLO 2
● Interprocess Communication
● Examples of IPC Systems
● Communication in Client-Server Systems

Threads & Concurrency

● Multicore Programming Chapter Class CLO 2
Week 4 ● Multithreading Models 4 Activity
● Thread Libraries

CPU Scheduling
● Introduction to Scheduling Chapter Quiz 2 CLO 2
Week 5 ● Preemptive scheduling Non preemptive 5
scheduling CLO 3

CPU Scheduling
● Scheduling Algorithms Assignment CLO 2
Chapter
Week 6 ● Threads scheduling 1
5
CLO 3

Process Synchronization
● The Critical Section Problem CLO 1
Chapter Class
Week 7 ● Peterson’s Solution 6 Activity CLO 2

Tentative Week-wise list of topics

 National Computing Education Accreditation
Council
NCEAC
Sessional
We Topi Referen CLOs
Assessmen
ek cs ce t
Process Synchronization
● Hardware Support for Synchronization Quiz 3 CLO 1
Week 8 Chapter 6 CLO 2

CL
O
Week 9 MID TERM EXAM 1,
2,
3
Process Synchronization
● Mutex Locks Chapter Class CLO 1
Week 10 ● Semaphores 6&7 Activity CLO 2
● Classical Problem of Synchronization

Deadlocks
● System Model Assignmen
Chapter CLO 2
● Deadlock in Multithreaded Applications t2
Week 11 8 CLO 3
● Deadlock Characterization

Deadlocks
● Method for handling deadlock CLO 2
Chapter Quiz 4
● Deadlock Prevention CLO 3
Week 12 8
● Deadlock Avoidance
● Deadlock Detection
Memory Management
● Contiguous Memory Allocation CLO 1
Week 13 ● Paging Chapter Assignmen CLO 2
● Structure of the Page Table 9 t3
● Swapping
Virtual Memory
● Demand Paging CLO 1
Week 14 ● Page Replacement Chapter Assignment CLO 2
● Allocation of Frames 10 3
File System
● File-System Interface
● Access Methods CLO 1
Week 15 ● Directory Structure Chapter Quiz 5 CLO 3
● Memory-Mapped Files 13

CLO
Week 16 FINAL TERM EXAM 1,2,
3
● Operating System Concepts 10th edition by Abraham Silberschatz, Peter Baer Galvin,
Textbook
and Greg Gagne; John Wiley, 2019.
● Operating Systems: Internals and Design Principles, 9th edition, William Stallings;
Other
Pearson, 2018.
References
● Mastering Modern Linux by Paul S. Wang 2nd edition; CRC Press, 2018.
● Modern Operating Systems, 4th edition, Andrew S. Tanenbaum; Pearson, 2016.
 National Computing Education Accreditation
Council
NCEAC
NCEAC.FORM.00
1

Mapping of CLOs to Direct

Assessments

Quiz Quiz Quiz Quiz Quiz Assignment Assignment Assignment Mid Final
CLOs
1 2 3 4 5 1 2 3 Term Term
1 ✔ ✔ ✔ ✔ ✔ ✔
2 ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔
3 ✔ ✔ ✔ ✔ ✔ ✔ ✔
`

Course Instructor Name: _

Course Instructor Sign.: