National Computer Education Accreditation Council
NCEAC
NCEAC.FORM.001-C
COURSE DESCRITPTION FORM
INSTITUTION PAF-KIET
PROGRAM (S) TO BE BACHELORS OF SCIENCE IN COMPUTER SCIENCE
BS (CS) FOUR YEAR DEGREE
EVALUATED
A. Course Description
Course Code
Course Title Operating Systems
Credit Hours 3+1
Prerequisites by Course(s) and Data Structures
Topics
Assessment Instruments with Quizzes = 10%
Weights (homework, quizzes, Assignments = 10 %
midterms, final, programming Project = 20 %
assignments, lab work, etc.) Mid Term = 20 %
Final = 40 %
Course Coordinator Dr. Affan Aleem
URL (if any) -
Current Catalog Description This course will give the theoretical concepts in operating systems as
well as some practical knowledge of Linux operating system. We will
cover the following areas:
● Operating Systems Structures
● Processes and Threads
● CPU Scheduling
● Deadlocks
● Memory Management
● Virtual Memory
● File-System
Textbook (or Laboratory Manual Operating Systems Concepts By Silberschatz, Galvin, Gagne
for Laboratory Courses)
Reference Material Operating Systems By William Stallings
Lecture Notes and Handouts
Course Goals To cement core concepts of operating systems in students’ minds.
Topics Covered in the Course, Sheet is Attached
with Number of Lectures on Each
Topic (assume 15-week instruction
and one-hour lectures)
Laboratory Projects/Experiments Linux tutorials, shell programming, programming OS services
Done in the Course
Programming Assignments Done Threading, Process Scheduling, Classic Problems of Synchronization
in the Course
Class Time Spent on (in credit Theory Problem Solution Social and Ethical
hours) Analysis Design Issues
2 1 1 0
Oral and Written Communications -
1 NCEAC.FORM.001.C
National Computer Education Accreditation Council
NCEAC
NCEAC.FORM.001-C
Instructor Name Instructor Signature
Date
Book Ch.
Signatur
Session
at
D
e
Topics to be Covered
No.
e
Operating System Objectives and Functions, The
Chapter 1 Evolution of Operating Systems, Developments
1
[Silberschatz] Leading to Modern Operating Systems,
]
Virtual Machines, Batch, multiprogramming.
2 Chapter 1 Multitasking, time sharing, parallel, distributed & real
[Silberschatz] -time O.S.
3
Chapter 2 Operating System Services. System Calls,
[Silberschatz]
]
Chapter 2
[Silberschatz] Types of system call, Operating System structures
4
Process: Process Concept, Process Description
Chapter 2 and control, Process states, PCB ,Two state
5 [William model, Five state model
Stallings]
Chapter 2 Seven state model of process,Queuing models of
[William Of process models. Process creation and deletion,
6 Stallings] Fork() and Exec()
Chapter 6
7 CPU Scheduling, Criteria for CPU scheduling,
[Silberschatz]
types of schedulers, FCFS, SJF, SRTF
Algorithms.
RR and Priority preemptive and Non Preemptive
Chapter 6 algorithm
8
[Silberschatz]
Practice problems on Scheduling Algorithms
Threads: Processes and Threads, Concept of
Chapter 4 Multithreading, Types of Threads, Thread
9
[Silberschatz] programming Using pthreads
National Computer Education Accreditation Council
NCEAC
NCEAC.FORM.001-C
Multicore processors and threads , Linux Process
Chapter 4 and Thread Management, Android Process and
10
[Silberschatz] Thread Management
Chapter 3 Interprocess Communication: Reasons. Message
[Silberschatz] Passing, Shared Memory Systems. Sharing in
11
network systems ,Pipes
Chapter7
[Silberschatz] Principles of Deadlock, Deadlock Prevention,
12 Deadlock Avoidance, Bankers Algorithm,
Chapter 7 Deadlock detection and recovery
[Silberschatz] An Integrated Deadlock Strategy Resourse
13 Allocation graph
Chapter 5 Race Condition,Critical section, Lock variable,Test
[Silberschatz] and Set lock,Turn variable
14
Chapter 5 Concurrency: Process/thread Synchronization and
15
[Silberschatz] Mutual Exclusion Principles of Concurrency,
Requirements for Mutual Exclusion, Mutual
Exclusion:
16
Chapter 5 Hardware Support, Operating System Support
[Silberschatz] (Semaphores and Mutex), Programming Language
Support (Monitors),
17,18 MID TERM Examination
Counting and Binary semaphores, Practice Problems
Chapter 5 on counting and binary semaphores,.
19
[Silberschatz]
Chapter 5 Practice Problems on synchronization mechanisms
20
[Silberschatz
Chapter 5
21
[Silberschatz] Classical synchronization problems: Readers/Writers
Problem
National Computer Education Accreditation Council
NCEAC
NCEAC.FORM.001-C
Producer Consumer problem Dining philosophers
Chapter 5 problem
22
[Silberschatz]
Memory Management: Memory Management
Chapter 6 Requirements, Memory Partitioning: Fixed
23
[William
Partitioning.
Stallings]
Chapter 6 Dynamic Partitioning, Relocation, Paging,
[William Segmentation.Some related problems.
24
Stallings]
Chapter 7 Virtual Memory: Page Replacement Algorithms,
[William
25 Practice Problems of Replacement Algorithms
Stallings]
Chapter 7 TLBs, Page Tables Problems on paging and
[William segmentation
26
Stallings]
Chapter 12 File Management: Overview, File Organization and
[Silberschatz Access, File Directories
27
Chapter 12 File Sharing, Record
[Silberschatz]
28 Blocking, Secondary Storage Management
29 .Projects
30 .Projects
