1|Page Course Handout : Operating System(CS-2002)

SCHOOL OF COMPUTER ENGINEERING

KALINGA INSTITUTE OF INDUSTRIAL TECHNOLOGY
DEEMED TO BE UNIVERSITY
BHUBANESWAR

Course: Operating System

Course Code:CS-2002
Session: Spring-2022

Objective:

1. To learn the basic concepts of Operating System, its functions and services.
2. To familiarize with various views and management policies adopted by Operating
System pertaining to processes, Deadlock, memory, File and I/O operations.
3. To brief about the functionality of various OS like Unix, Linux and Windows XP as
pertaining to resource management.
4. To provide the knowledge of basic concepts towards process synchronization and
related issues.

Course Outcomes:

1. Able to understand the difference between different types of modern operating systems,
virtual machines and their structure of implementation and applications.

2. Able to understand the difference between process & thread, issues in the scheduling of user-
level processes/threads.

3. Able to understand and analyze the use of locks, semaphores, monitors for synchronizing
multiprogramming / multithreaded systems and design solutions for multithreaded programs.

4. Able to understand the concepts of deadlock in operating systems and how they can be
managed/avoided.

5. Able to understand the design and management concepts along with issues and challenges of
main memory, virtual memory, and file system.

6. Able to understand the types of I/O management, disk scheduling, protection and security
problems faced by operating systems and how to minimize these problems.

Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO13 PO14 PO15
Code

CS2002 H H H H M M L M M M H L H H H

'H','M' and 'L' represents High, Medium or Low relationship to the graduate attributes defined
by as per Washington Accord
2|Page Course Handout : Operating System(CS-2002)

Day 1 What is an OS?

What do Operating Systems do?
Operating system structure
Day 2 History of OS
Types of OS
◦ Batch OS
◦ Multiprogramming, multitasking OS
Day 3 Types of OS
◦ Multithreading, Multiprocessing System
◦ Distributed OS, Network OS
◦ Real-Time OS
Day 4 Activity
Day 5 What is Process?
How to create a process?
Process States (5-state model)
Contents of PCB
Day 6 Scheduling Queue
Process schedulers (LT , ST and MT)
Day 7 Context switching
Multithreading and their functionality.
CPU scheduling criteria
Day 8 CPU scheduling algorithms
◦ FIFO
◦ SJF/SRTN
Day 9 CPU scheduling algorithms
◦ Priority
◦ Round Robin
Day 10 CPU scheduling algorithms
◦ HRRN
Performance Analysis of the CPU scheduling algorithms
Multi-level feedback scheduling
Day 11 Activity
Day 12 Race Condition
Process Synchronization
Day 13 Critical section problem
Requirements for a solution to critical section problem
Day 14 2-process software solutions (Peterson Solution)
Day 15 Semaphore
Spinlock.
Solution for Spinlock
Day 16 Classic problems of synchronization
◦ Producer-Consumer Problem
3|Page Course Handout : Operating System(CS-2002)

Day 17 Classic problems of synchronization

◦ 1st Reader Writer Problem
Day 18 Classic problems of synchronization
◦ Dining Philosopher Problem
▪ Free from Deadlock Solution
Day 19 Disadvantages of Semaphore
High-level synchronization tools
◦ Critical region
◦ Monitor
Day 20 Activity
Day 21 Activity
Day 22 Deadlock and its conditions.
Resource Allocation Graph
Day 23 Handling deadlock
Deadlock prevention
Day 24 Deadlock avoidance
Resource allocation state(Safe/Unsafe State)
Resource Allocation Graph algorithm
Day 25 Deadlock avoidance (Banker’s Algorithm)
◦ Safety algorithm
Day 26 Deadlock avoidance (Banker’s Algorithm)
◦ Resource Request algorithm
Day 27 Deadlock Detection
Recovery mechanism from deadlock
Day 28 Activity
Day 29 Address binding
Logical and physical address
Day 30 Multiprogramming memory management using
partitioning
Day 31 Paging
Paging implementation with Translation look-aside
buffers (TLBs)
Day 32 Hierarchical paging and Inverted Page Tables
Segmentation
Segmentation with Paging
Day 33 Virtual Memory and Demand Paging
Dealing with Page faults
Day 34 Page replacement algorithm
◦ First-In-First-Out(FIFO)
◦ Optimal Page Replacement (OPT)
Day 35 Page replacement algorithm
◦ Least Recently Used (LRU)
Thrashing
Day 36 Activity
Day 37 Tutorial/Activity
4|Page Course Handout : Operating System(CS-2002)

Day 38 File concept

Access Methods
Day 39 Directory structure.
File system mounting
Day 40 File System structure
File system Implementation.
Day 41 Allocation methods
Free space management
Day 42 Activity
Day 43 I/O Devices
Device controller
Device Drivers.
Day 44 Application I/O Interface
Day 45 Disk Structure
Disk Scheduling
Day 46 Domain of Protection
Access matrix
Day 47 Implementation of Access matrix
System security
Day 48 Activity

Web References:
1. http://faculty.cs.tamu.edu/bettati/
2. http://u.cs.biu.ac.il/ ariel/download/os288/ppts/
3. http://www.cs.rutgers.edu/pxk/416/index.html
4. http://www.tutorialspoint.com/operating_system/os_multi_threading.htm
5. http://cs.nyu.edu/courses/spring02/V22.0202-002/class-notes.html

Course Coordinator
Spring, 2022