SWE3001 Operating Systems L T P J C

3 0 2 0 4
Pre-requisite SWE2001 Syllabus version
v. 1.0
Course Objectives:
1. To understand the services provided by and the design of an operating system.
2. To understand the structure and organization of the file system
3. To understand principles of process management anddifferent approaches to memory
management.

Expected Course Outcome:

1. Understand principles and modules of operating system.
2. Understand key mechanisms in design of operating system modules
3. Compare various processor scheduling algorithms.
4. Develop algorithmic solutions to process synchronization problems.
5. Understand CPU scheduling for distributed operating systems
6. Understand the mechanisms adopted for file sharing in distributed Applications Identify
components involved in designing a contemporary OS
7. Identify the components involved in designing a contemporary OS

Student Learning Outcomes (SLO) 1, 2, 5

Module:1 Introduction 6 hours
Computer-System Organization, Computer-System Architecture, Operating-System Structure, Operating-
System Operations, Operating-System Services, User and Operating-System Interface, System Calls,
Operating-System Generation, System Boot.

Module:2 Processes 6 hours

Process Concept, Process Scheduling, Operations on Processes, Inter-process Communication, Threads-
Overview, Multithreading Models, Thread Libraries, Implicit Threading, Threading Issues

Module:3 Process Synchronization 6 hours

Background, The Critical-Section Problem, Peterson’s Solution, Synchronization Hardware, Mutex Locks,
Semaphores, Classic Problems of Synchronization, Monitors, Synchronization Example

Module:4 CPU Scheduling 6 hours

Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Threads, Multiple-Processor Scheduling,
Deadlocks- System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock.

Module:5 Memory Management 6 hours

Background, Swapping, Contiguous Memory Allocation, Segmentation, Paging, structure of the Page
Table.

Module:6 Virtual Memory 6 hours

Background, Demand Paging, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped
Files, Allocating Kernel Memory
Module:7 Mass-Storage Structure 7 hours
Overview, Disk Structure, Disk Scheduling, Disk Management, Swap-Space Management, RAID Structure,
File-System Interface- File Concept, Access Methods, Directory and Disk Structure, File-System Mounting,
File Sharing, Directory Implementation, Allocation Methods.

Module:8 Contemporary issues: Applications of operating 2 hours

systems in industry.

Total Lecture hours: 45 hours

Text Book(s)
1. A.Silberschatz, P.B. Galvin & G. Gagne, Operating system concepts, Ninth Edition, John Wiley, 2013

Reference Books
1. W. Stallings, Operating systems-Internals and Design Principles, Seventh Edition , Prentice- Hall,2012

2. Tanenbaum, Modern Operating Systems, Third Edition, PrenticeHall,2015

List of Challenging Experiments (Indicative) SLO: 1,2,5

1. Process scheduling mechanism
2. Readers – Writers Problem
3. Dining Philospher’s Problem
4. Deadlock – Banker’s Algorithm

5. Page Replacement Algorithm Implementation

Total Laboratory Hours 30 hours
Recommended by Board of Studies 12.06.2015
Approved by Academic Council No. 37 Date 16.06.2015