Operating Systems

Course Title: Operating Systems

Course No: CSIT.215

Nature of the Course: Theory + Lab

Semester: 3

Full Marks: 60 + 20 + 20

Pass Marks: 27 + 9 + 9

Credit Hours: 3

Course Description

This course demonstrates basic features of operating system components. It describes process management, deadlocks and process synchronization, memory management techniques, File system implementation, and I/O device management principles. It also includes case study on Linux operating system so that students can compare principles studied in the course with their real implementation.

Course Objectives

Describe need and role of operating system; Understood OS components such a scheduler, memory manager, file system handlers and I/O device managers; Analyze and criticize techniques used in OS components; Demonstrate and simulate algorithms used in OS components; Identify algorithms and techniques used in different components of Linux

Course Contents

1. Unit I: Overview

4 hrs

1.1. Definition, Two views of operating system, Evolution of operating system, Types of OS

1.2. System Call, Handling System Calls, System Programs, Types of System Call

1.3. Operating System Structure, The Shell, Open Source Operating Systems

2. Unit II: Process Management

10 hrs

2.1. Process vs Program, Multiprogramming, Process Model, Process States, Process Control Block

2.2. Threads, Thread vs Process, User Space Threads, Kernel Space Threads

2.3. Inter Process Communication, Race Condition, Critical Section

2.4. Implementing Mutual Exclusion

Mutual Exclusion with Busy Waiting (Disabling Interrupts, Lock Variables, Strict Alteration, Peterson’s Solution, Test and Set Lock)

Sleep and Wakeup, Semaphore, Monitors, Message Passing, Classical IPC problems (Producer Consumer, Sleeping Barber, Dining Philosopher Problem)

2.5. Process Scheduling

Goals, Batch System Scheduling (First-Come First-Served, Shortest Job First, Shortest Remaining Time Next)

Interactive System Scheduling (Round-Robin Scheduling, Priority Scheduling, Multiple Queues), Evaluating Scheduling Algorithms, Overview of Real Time System Scheduling

3. Unit III: Process Deadlocks

6 hrs

3.1. Introduction, Deadlock Characterization, Preemptable and Nonpreemptable Resources, Resource – Allocation Graph, Conditions for Deadlock

3.2. Handling Deadlocks

Ostrich Algorithm, Deadlock prevention, Deadlock Avoidance (Safe and Unsafe States, Bankers Algorithm)

Deadlock Detection, Recovery From Deadlock (Through Preemption and Rollback)

4. Unit IV: Memory Management

8 hrs

4.1. Introduction, Monoprogramming vs Multiprogramming, Modelling Multiprogramming, Multiprogramming with fixed and variable partitions, Relocation and Protection

4.2. Memory management (Bitmaps & Linked-list), Memory Allocation Strategies

4.3. Virtual memory: Paging, Page Table, Page Table Structure, Handling Page Faults, TLB’s

4.4. Page Replacement Algorithms: FIFO, Second Chance, LRU, Optimal, LFU, Clock, WS-Clock, Concept of Locality of Reference, Belady’s Anomaly

4.5. Segmentation: Why Segmentation?, Drawbacks, Segmentation with Paging(MULTICS)

5. Unit V: File Management

6 hrs

5.1. File Overview: File Naming, File Structure, File Types, File Access, File Attributes, File Operations, Single Level, two Level and Hierarchical Directory Systems, File System Layout

5.2. Implementing Files: Contiguous allocation, Linked List Allocation, Linked List Allocation using Table in Memory, Inodes

5.3. Directory Operations, Path Names, Directory Implementation, Shared Files

5.4. Free Space Management: Bitmaps, Linked List

6. Unit VI: Device Management

6 hrs

6.1. Classification of IO devices, Controllers, Memory Mapped IO, DMA Operation, Interrupts

6.2. Goals of IO Software, Handling IO(Programmed IO, Interrupt Driven IO, IO using DMA), IO Software Layers (Interrupt Handlers, Device Drivers)

6.3. Disk Structure, Disk Scheduling (FCFS, SSTF, SCAN, CSCAN, LOOK, CLOOK), Disk Formatting (Cylinder Skew, Interleaving, Error handling), RAID

7. Unit VII: Linux Case Study

5 hrs

7.1. History, Kernel Modules, Process Management, Scheduling, Inter-process Communication, Memory Management, File Systems

Laboratory Works

Student should simulate at least 15 algorithms discussed in class, prepare lab sheet for each of the algorithm simulated in lab. Minimum 3 lab hour per week in required. Algorithms to be simulated can be decided by instructor, but it must cover IPC, process scheduling, Page Replacement, Free Space management, File System, and deadlock.

1.IPC Algorithms Simulation
2.Process Scheduling Simulation
3.Page Replacement Simulation
4.Free Space Management Simulation
5.File System Simulation
6.Deadlock Simulation

Text Books

1.Modern Operating Systems: Andrew S. Tanenbaum, PH1 Publication, Third edition, 2008

Reference Books

1.Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, John Wiley & Sons (ASIA) Pvt. Ltd, Seventh edition, 2005
2.Harvey M. Deitel, Paul J. Deitel, and David R. Choffnes, “Operating Systems”, Prentice Hall, Third edition, 2003

Notes:

This syllabus follows the official CSIT curriculum of Far Western University. In case of any doubt or revision, the university’s published syllabus shall be considered authoritative.

Operating System

Operating System

Select University

Select Program

TabFlux . Operating Systems . FWU . BSc. CSIT