SN 21CSH-242 Course Name: OPERATING SYSTEM L T P S C CH Course Type

1 Course Coordinator: Mr. Dipra Mitra 3 0 2 0 4 5 Program Core

PRE-REQUISITE Basic knowledge of computer.

CO-REQUISITE Nil

ANTI-REQUISITE Nil

a. COURSE OBJECTIVES

1. To understand a fundamental understanding of operating systems and its functionalities.

2. To understand the working of an OS as a resource manager, file system manager, process manager,
memory manager and I/O manager and methods used to implement the different parts of OS.
3. To understand the concepts and implementation Memory management policies and Virtual memory in
advance operating system.

b. COURSE OUTCOMES
      On completion of this course, the students shall be able to:
CO Describe the role of the Operating System and different types of Operating systems
1
CO Explain CPU Scheduling, Synchronization, Deadlock Handling and Comparing CPU Scheduling
2 Algorithms and Solve Deadlock Detection Problems
CO Apply the role of paging, segmentation and virtual memory in operating systems
3
CO Analyse I/O systems, Device Management Policies and Secondary Storage Structure and
4 Evaluation of various Disk Scheduling Algorithms
CO Test the protection and security and also the Comparison of UNIX and Windows-based OS
5

c. SYLLABUS:
Unit-1(Basics of Contact Hours: 15 HOURS
operating system)
Introduction to the Introduction to Operating Systems, Operating System Structure, Main Functions and
Operating System: characteristics of Operating Systems, Types of Operating Systems, System Calls,
Types Of System calls, System Programs, Re-entrant Kernels, Monolithic and
Microkernel Systems
Process Process Concept, Process Control Block, Process Scheduling, Threads, CPU
Management: Scheduling: Pre-emptive/Non-Pre-emptive Scheduling, Scheduling Criteria,
Scheduling Algorithms, inter-process communication, remote procedure calls,
Process Synchronization
 Deadlocks: Dead lock characterization and conditions for dead lock, dead lock prevention, Dead
lock a voidance-safest ate, resource allocation graph algorithm, Banker’s Algorithms-
Safety algorithm, Dead lock detection, Recovery from dead lock
Process Management and Synchronization - The Critical Section Problem,
Synchronization Hardware, Semaphores, and Classical Problems of Synchronization,
Critical Regions, Monitors.
Unit-2 (Memory Contact Hours:15 HOURS
management and its
application)
Memory Address binding, logical versus physical address space, dynamic loading, Swapping,
Management contiguous memory allocation, Fragmentation, Paging, Segmentation, Segmentation
with Paging, Virtual Memory Concept, Demand Paging, Page Replacement, Page
Replacement Algorithms, Thrashing, Cache memory organization ,Locality of
reference.
Device Management Disk Structure, Disk formatting, Disk Scheduling Algorithms, RAID structure-
RAID levels, problems with RAID.
File Management: File Concepts, Access Methods, Directory Structure, Allocation Methods, Free
Space Management.
Unit-3 (Security of Contact Hours:15 HOURS
Operating system)
System Protection Goals, principles and domain of protection, Access matrix, implementation faces
and Security: matrix, the security problem, program threats, and system and network threats.
Distributed and Overview: Topology, connection strategy, network operating system types: Peer to
Network Operating Peer & Client server, Distributed message passing. Loosely coupled and tightly
Systems coupled operating system ,hypercube network 

d. TEXT BOOKS
T1: Galvin, Peter B.,Silberchatz,A.,“OperatingSystemConcepts”,AddisonWesley,9th Edition.
T2: William Stallings, Operating Systems: Internals and DesignPrinciples,7 edition Pearson   
th

Education Limited, 2014ISBN:1292061944, 9781292061948.

REFERENCE BOOKS
R1: Andrew Tananbaum, “Operating System”, PHIL earning.
R2: Godbole , Kahate, "Operating System: A Concept Based Approach", Tata Mc-Graw-Hill.

SUGGESTIVE READING:

1. Operating Systems: Design and Implementation, Textbook by Andrew S. Tanenbaum.

2. Modern Operating Systems, Andrew S. Tanenbaum
3. Operating Systems: Internals and Design Principles, by William Stallings.

Research Papers:

1. https://ieeexplore.ieee.org/document/810390
2. http://www.jestr.org/downloads/Volume11Issue1/fulltext121112018.pdf
3.https://www.academia.edu/49902795/
Pragmatics_of_Virtual_Machines_for_High_Performance_Computing_A_Quantitative_Study_of_Basic_Over
heads

Unit-1 CONTACT HOURS: 4 Hours

1 Installation of Linux operating system
2 Study basic Linux commands like ls, head, tail, grep, Man, Pwd,chmod, cat.
3 Programs using the following system calls of Linux operating system
a. fork, getpid, getppid, exit, wait, close.
b. I/O system calls of Linux operating systems (open, read, write, etc.).
4 Study the basics of shell programming using vi editor
Unit-2 CONTACT HOURS: 4 Hours
5 Write a program
a. to show the use of echo.
b. to read the keywords in shell programming
6 Write  programs using 
a. Arithmetic operators in shell programming.
b. Boolean operators in shell programming.

Write  programs using 

a. Control structures in shell programming.
b. Difference between while and until statement.
7 c. looping statement
Unit-3 CONTACT  HOURS: 4 Hours
8 Simulation of First come, first serve CPU scheduling algorithm.
9 Simulation of Shortest job first CPU scheduling algorithm
10 Simulation of Round Robin CPU scheduling algorithm
11 Simulation of Priority-based CPU scheduling algorithm.
12 Simulate the Bankers algorithm for deadlock avoidance and deadlock prevention.

CO-PO MAPPING:

Course
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO PSO
Outcom 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3 4
e
Na Na Na Na Na Na Na Na 3 3 Na
CO1 Na
3 3 Na
CO2 3 Na 3 Na Na Na Na Na Na Na 3 3 Na 3
3 na
CO3 3 Na Na 3 Na Na Na Na Na Na Na 3 Na 3 3
3
CO4 3 Na Na Na 3 Na Na Na Na Na Na Na 3 Na Na 3
 CO5 3 Na Na 3 Na Na Na Na Na Na Na 3 3 Na 3
3

Assessment Pattern

For the Theory Courses, the performance of students is evaluated as follows:

Component
Continuous Internal Assessment (CAE) Semester End Examination (SEE)
s
Marks 40 60
Total Marks 100

Frequency for assessment tools for theory classes

Sr. Type of Assessment Weightage of Final Weightage of internal
Frequency of Task
No. Task Actual conduct assessment(Prorated Marks)
10 Marks for each
1 Assignment* One per unit 10 Marks
assignment
Time bound Surprise 12 Marks for each
2 One per unit 4 Marks
Test test
4 marks for each
3 Quiz Two per unit 4 Marks
quiz
20 Marks for one
4 Mid-Semester Test** Two per semester 20 Marks
MST
5 Presentation*** NA As Applicable Non-Graded Engagement Task
One per lecture
6 Homework NA topic (of 2 Non-Graded Engagement Task
questions)
7 Discussion Forum NA One per chapter Non-Graded Engagement Task
Attendance and
8 NA NA 2 Marks
Engagement Score

**Mid-Semester Test to be conducted physical in examination halls. But in case the COVID
scenario extends, then it has to be conducted in Online Model via proctored examination
software.
**This category may be graded in case of Seminar/Project type courses.

For the Practical Courses, the performance of students is evaluated as follows:

Component
Continuous Internal Assessment (CAE) Semester End Examination (SEE)
s
Marks 60 40
Total Marks 100
Internal Evaluation Component
Sr.No. Type of Weightage of actual Frequency of Final Weightage in Remarks 
Assessment conduct  Task  Internal 
Assessment
1 Conduct  240 10 24

2 Report  200 10 20

3 Viva- Voce 160 10 16