COURSE OUTLINE

Operating System
Course Code CS-3534
Fall-2019

Instructors:
Ms. Rabia Younas [email protected]

Course Description:

Operating systems are central to computing activities. An operating system is a program

that acts as an intermediary between a user of a computer and the computer hardware.
Two primary aims of an operating systems are to manage resources (e.g. CPU time,
memory) and to control users and software. Operating system design goals are often
contradictory and vary depending of user, software, and hardware criteria. This course
describes the fundamental concepts behind operating systems, and examines the ways
that design goals can be achieved. This course provides an opportunity to learn about
operating systems both theoretically and practically.
Course Relevance:
This course is widely applicable in many areas, such as:
System Programming.
Software Integrator.
Compiler Constructor.
Course Objectives:

Upon successful completion of the course, a student should be:

Course Outline (OS)

1
 Demonstrate understanding of the concepts, structure and design of operating
Systems
 Demonstrate understanding of operating system design and its impact on
application system design and performance.
 Demonstrate competence in recognizing and using operating system features.
Course Duration:
The course lecture will be held two times a week and class duration for each lecture will
be 90 minutes and a lab of 2 hours duration.
Course Style:
The course will be delivered in a classroom environment and in computer lab.
Text Book:
1- Tanenbaum A.S., “Modern Operating System”, Third Edition, 2007, Prentice
Hall.
2- Anderson, P., “Just Enough UNIX”, Fourth Edition, 2003, McGraw Hill
Reference:
3- Stalling, William, “Operating Systems: Internals and Design Principles”, Fifth
Edition, 2005, Prentice-Hall.
4- Silberschatz, G, “Operating System Concepts”, Sixth Edition, 2003, John Wiley
& Sons, Inc.
Course Material Link:
https://sites.google.com/a/se.uol.edu.pk/rabia-younas-os/operating-system
Additional Course Requirement:
In addition to the objectives of this course, students are expected to gain skills which
would be needed in the professional work environment. These skills include but not
limited to: understanding of various operating system, active class participation,
Presentation, and Teamwork.

Course Contents:

Week # 1 Chapter 1: Computer System & Operating System Overview

Course Outline (OS)
2
Introduction
What is an operating system?
The operating system is an extended machine, The operating system
as a Resource Manager
Functions performed by an OS
Von-Neumann Architecture
Mainframe operating system
Server operating system
Multiprocessor operating system
Personal computer operating system
Real-Time operating system
Embedded operating system
Distributed operating system
Virtual machine
Week # 2
The Booting Process
Batch processing system
Multi- programming
Time sharing system
Instruction-fetch execute cycle
Structure of disk drive
Busses
Processes
Deadlocks
Week # 3 Kernel & Shell structure of an OS
Monolithic, Layered Systems
Memory management
I/O
Files
Security Assignment: 01
Chapter 2 : Processes and Threads
Processes
The Process Model
Process Creation
Week # 4
Process Termination
Quiz: 01, 20 Minutes
fork() & exec() system calls
implementation Assignment: 01 Submission
Process Hierarchies
Process States
Week # 5
Modeling
Multiprogramming
Week # 6 Threads
Thread Usage
The Classical Thread Model
Threads in user & kernel space

Course Outline (OS)

3
Introduction to Scheduling
Short-Term, Medium-Term, Long-
Term
Scheduling Goals and Criteria Assignment: 02
Scheduling in Batch Systems
FCFS scheduling
Shortest job first scheduling
Shortest remaining time next
scheduling Assignment: 02 Submission
Week # 7 Scheduling in Interactive Systems
Priority scheduling, Lottery
scheduling
Round robin scheduling
Inter-comparison of above policies
for efficiency Quiz: 02, 20 Minutes
Chapter 3: Memory Management Issues
Basic memory management
Jobs of memory manager
Mono programming with swapping or paging
Multi programming with fixed partition
Week # 8
Disadvantages of separate input queue for each partition
Difference between fixed and variable partitions
Data Compaction
Memory Management with Bit Maps
Memory Management with Linked Lists
Week # 9 Mid Term Examination
Buddy Systems
Swapping
Introduction of placement concept
Page Placement Algorithms
Week # 10
First Fit
Next Fit
Best Fit
Worst Fit Assignment: 03
Virtual memory
Internal Fragmentation
External Fragmentation
PAGE REPLACEMENT
Week # 11 ALGORITHMS
FIFO Page Replacement Algorithm
Optimal Page Replacement
Algorithm\
Not Recently Used Assignment: 03 Submission
Week # 12 PAGE REPLACEMENT ALGORITHMS
The Least Recently Used
Course Outline (OS)
4
Belady's Anomaly
Segmentation
Chapter 4: Introduction to
deadlock
Resources
Preemptable and Non-Preemptable
Resources
Resource Acquisition
Introduction to Deadlocks
Condition for Deadlock
Deadlock Modeling Quiz: 03, 20 Minutes
Deadlock Detection and Recovery
Deadlock Detection with single Resource of Each Type
Deadlock Detection with Multiple Resources of Each Type
Deadlock Prevention Attacking the
Mutual Exclusion Condition
Week # 13
Attacking the Hold and Wait
Condition, Attacking the Non-
Preemption Condition
Attacking the Circular Wait
Condition, Starvation Assignment: 04
Chapter 5 :File System Management
File system
File naming
File structure
File types
File access
File attributes
File operations
Week # 14 Directories
Single-Level Directory Systems
Two-level Directory Systems
Hierarchical Directory Systems
Tree level directory system
Path names Assignment: 04 Submission
Directory operations
File system layout
Secondary storage management Quiz: 04, 20 Minutes
Week # 15 I-Node/Indexed Allocation
Free Space Management
Bitmaps, Linked Lists, Indexing, Free Block List
File sharing
Access rights
Management of simultaneous access

Course Outline (OS)

5
Record blocking
Fixed Blocking (fixed length records)
Variable-Length Spanned Blocking
(variable length records)
Variable-Length un-spanned
Blocking (variable length records)
Directory implementation
Different Schemes of a Directory
Objectives for a File Management
File system architecture Project Submission
Chapter 6 :Input Output and Disk Scheduling
I/O Communication Techniques
Programmed I/O
Interrupt-driven I/O
Direct Memory Access DMA
Direct Memory Access
Week # 16
Disk Scheduling Algorithms
First-In-First-Out (FIFO) OR FCFS
Priority (PRI)
SSTF (Shortest Seek Time First)
SCAN
C-SCAN

Marks Distributions:

Criteria
Mid Term Examination 20 %
Quizzes 10 %

Assignments 10 %

LAB 20 %
40 %
Final Examination
Total 100 %

Attendance Requirements:
 You are expected to attend all lectures, seminars, tutorials, and lab sessions or any
other classroom activity announced. Where you fail to attend classes, you cannot
expect the lecturer to brief you on what you have missed. You are responsible for

Course Outline (OS)

6
your attendance, not the academic staff. Attendance at tutorials and lab sessions
will be strictly monitored, and failure to attend will be taken into account.
 Note: Minimum of 75% Attendance in lectures/lab sessions/seminars (if any)
are required for a student to sit in the Final-Term examination.
 Etiquette: Please keep all cell phones turned OFF during class. If your activities
during class are deemed disruptive, you will be asked to leave.
Instructor: Checked by TAI:
Ms. Rabia Younas Mr. Sikandar Shujah Toor
Lecturer Assistant Professor
Department of Software Engineering Department of Software Engineering

Course Outline (OS)

7