1 | Page Course Handout : Operating

System(CS2002)

SCHOOL OF COMPUTER ENGINEERING

KALINGA INSTITUTE OF INDUSTRIAL TECHNOLOGY
DEEMED TO BE UNIVERSITY
BHUBANESWAR

Course: Operating System (Credits 3) (L-T-P) (3-0-0)

Course Code:CS20002
Session: Spring, 2025

Faculty Name: Dr. Tanmoy Maitra

Mail ID: [email protected]
Cabin: Campus 15, Block A, Cabin no. 109 (1st floor)

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.
2 | Page Course Handout : Operating
System(CS2002)

Module name Topic/Coverage No. of Days

lectures
 Introduction to OS
 Operating system structure Day 1
 Types of OS
◦ Batch OS Day 2
◦ Multiprogramming, multitasking OS
Introduction ◦ Multithreading, Multiprocessing System 3
◦ Distributed OS, Network OS Day 3
◦ Real-Time OS
 Process description
 Process States (5-state model, 7 State model) Day 4
 Contents of PCB
 Process scheduling
◦ Scheduling Queue
◦ Process schedulers (LT , ST and MT) 6
◦ Context switching Day 5
◦ Multithreading and their functionality.
 CPU scheduling criteria
 CPU scheduling algorithms Day 6
◦ FIFO
◦ SJF, SRTN
◦ Priority
Process ◦ Round Robin Day 7
◦ HRRN
◦ Multi-level feedback scheduling Day 8
◦ Multi-level feedback queue scheduling
 Comparative Analysis of the CPU scheduling Day 9
algorithms

Activity Activity 1 1 Day 10

 Race Condition
 Process Synchronization Day 11
 Critical section problems
 Requirements for a solution to critical section Day 12
problems
Concurrent  2-process software solutions (Peterson
Process Solution) Day 13
 Semaphore
 Lock.
 Classical problems of synchronization
◦ Producer-Consumer Problem Day 14
◦ Reader Writer Problem
3 | Page Course Handout : Operating
System(CS2002)

◦ Dining Philosopher Problem

◦ Disadvantages of Semaphore Day 15
 High-level synchronization tools
◦ Critical region 6 Day 16
◦ Introduction to Monitor

Activity Activity 2 1 Day 17

 Deadlock
 Handling deadlock (Resource Allocation Day 18
Graph (RAG))
 Deadlock ignorance 4
 Deadlock prevention Day 19
Deadlock  Deadlock avoidance
(Banker’s Algorithm) Day 20
 Deadlock detection and recovery
Day 21

Activity Activity 3 1 Day 22

MID SEMESTER

 Address binding
 Logical and physical address Day 23
 Memory management using partitioning
o Fixed Partitioning, Drawbacks Day 24
o Dynamic Partitioning, Drawbacks
 Virtual Memory:
◦ Translation look-aside buffers (TLBs) Day 25
◦ Hierarchical paging 8
◦ Inverted Page Tables
Memory ◦ Paging
Management ◦ Segmentation Day 26
◦ Segmentation with Paging
◦ Demand Paging
◦ Dealing with Page faults Day 27
 Page replacement algorithms:
◦ First-In-First-Out(FIFO) Day 28
◦ Optimal Page Replacement (OPT)
◦ Least Recently Used (LRU) Day 29
◦ Most Recently Used (MRU)
 Thrashing Day 30

Activity Activity 4 1 Day 31

4 | Page Course Handout : Operating
System(CS2002)

 File concept
 Access Methods Day 32
 Directory structure.
File  File system mounting 3
Management  File System structure Day 33
 File system Implementation
 Allocation methods Day 34
 Free space management
 I/O Devices
I/O  Device controller 2 Day 35
Management  Device Drivers
 Application I/O Interface Day 36

Activity Activity 5 1 Day 37

 Disk Structure
 Disk Scheduling
◦ FCFS
Disk ◦ SCAN 2 Day 38
Management
 Disk Scheduling
◦ C-SCAN Day 39
◦ LOOK
◦ C-LOOK
 Domain of Protection
OS  Access matrix 1 Day 40
protection  Implementation of Access matrix
and security  System security

* The Total number of classes is approx 40, which includes lectures and activities.

Text Book: Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, “Operating System
Concepts”, 10th edition, Wiley Publisher, May-2018.

Reference book:
1. William Stallings, “Operating Systems: Internals and Design Principles”, 9th edition,
Published by Pearson, July 2021.
2. Deitel, Deitel, and Choffnes, “Operating Systems-Part I”, 3rd Edition, Published by Pearson,
2004.
Teaching Pedagogy: Whiteboard/Marker, PowerPoint Presentations, Web Resources
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
5 | Page Course Handout : Operating
System(CS2002)

Evaluation Scheme

Assessment Methodology: Mid Term: 20; End Term: 50

Distribution of Internal Marks:- Total 50 Marks
Mid Semester Examination = 20 Marks
Activity-based assessment=30 Marks
i. Assignments/quizzes/Activities (20 Marks)
ii. Class Participation (10 Marks)
Activity-based assessment includes Problem Solving, Critical Thinking, Creation along with Quiz
which should cover all the COs.

Course Coordinator
Spring, 2025