MANIPAL UNIVERSITY JAIPUR

School of Computer Science and Engineering

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Course Hand-out
Operating Systems | CS 2201 | 4 Credits | 3 0 1 3
Session: Jan 23-May 23 | Faculty: Dr. Prakash Ramani, Dr. Mahesh Jangid, Mr. Priyank Singh Hada, Mr. Satpal Singh, Mr. Vivek
Sikarwar, Mr. Lav Upadyay, Dr. Rochak Swami, Dr. Ajit Noonia | Class: B. Tech. IV SEM

A. Introduction: This course is offered by Dept. of Computer Science and engineering as a department core subject.
The course provides a comprehensive understanding of Operating System principles, techniques and approaches
used for designing the software. The focus of the course is to make the students understand how various components
of operating system interact and provides services for execution of application software. Student will be apprised of
process management, deadlock, concurrency control, memory management, file management and I/O management
in detail, which will be beneficial for software development.
B. Course Outcomes: At the end of the course, students will be able to:
[2201.1]. Discuss the objectives, structure, functionality, and types of operating systems.
[2201.2]. Apply skills to develop system programs using file and process system calls and PThread API.
[2201.3]. Judge various process scheduling algorithms as per scheduling criteria.
[2201.4]. Examine concepts related to process synchronization and various deadlock handling strategies to solve
resource allocation problems.
[2201.5]. Distinguish different memory management techniques and page replacement algorithms.
[2201.6]. Describe file concepts and compare various disk scheduling and storage strategies.

C. PROGRAM OUTCOMES AND PROGRAM SPECIFIC OUTCOMES

[PO.1] Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems
[PO.2] Problem analysis: Identify, formulate, research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering
sciences
[PO.3] Design/development of solutions: Design solutions for complex engineering problems and design system
components or processes that meet the specified needs with appropriate consideration for the public health
and safety, and the cultural, societal, and environmental considerations
[PO.4] Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions
[PO.5] Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering
and IT tools including prediction and modeling to complex engineering activities with an understanding of
the limitations
[PO.6] The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal, and cultural issues and the consequent responsibilities relevant to the professional
engineering practice
[PO.7] Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
[PO.8] Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practices.
[PO.9] Individual and teamwork: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings
[PO.10] Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions
 [PO.11] Project management and finance: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
[PO.12] Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent
and life-long learning in the broadest context of technological change

[PSO.1] Will be able to design, develop and implement efficient software for a given real life problem.
[PSO.2] Will be able to apply knowledge of AI, Machine Learning and Data Mining in analyzing big data for
extracting useful information from it and for performing predictive analysis.
[PSO.3] Will be able to design, manage and secure wired/ wireless computer networks for transfer and sharing of
information.
D. ASSESSMENT PLAN:

Criteria Description Maximum Marks

Sessional Exam I (Closed Book) 20
Internal Assessment Sessional Exam II (Closed Book) 20
(Summative) Quizzes and Assignments 20
(Accumulated and Averaged) 10- (Best Two quizzes out of Three)
10- (Average of two Assignments)
End Term Exam End Term Exam (Closed Book) 40
(Summative)
Total 100
Attendance A minimum of 75% Attendance is required to be maintained by a student to be
(Formative) qualified for taking up the End Semester examination. The allowance of 25%
includes all types of leaves including medical leaves.
Make up Assignments Students who miss a class will have to report to the teacher about the absence. A
(Formative) makeup assignment on the topic taught on the day of absence will be given which
has to be submitted within a week from the date of absence. No extensions will be
given on this. The attendance for that day of absence will be marked blank, so that
the student is not accounted for absence. These assignments are limited to a
maximum of 5 throughout the entire semester.
Homework/ Home Assignment/ There are situations where a student may have to work in home, especially before
Activity Assignment a flipped classroom. Although these works are not graded with marks. However, a
(Formative) student is expected to participate and perform these assignments with full zeal
since the activity/ flipped classroom participation by a student will be assessed and
marks will be awarded.

E. SYLLABUS
Introduction: Definition of operating systems, Single and multi-processor systems, Operating system Services, System commands and
system calls, Interrupt, System boot. OS Structure: Simple, Layered, Microkernel, Hybrid, Modules, Types of OS, Multi-user,
Multitasking, Embedded, Real-time, Network, Distributed. Virtualization: Introduction, Hypervisor, Data center, Virtual data center,
VMware virtualization products. Process and Thread: Process concept, Operations on processes, Inter-process communication, UNIX
pipes, Multithreading, Multithreaded models, PThread API. Process Scheduling: Basic concepts, Scheduling criteria, Scheduling
algorithms. Synchronization: Critical section problem, Peterson solution, Synchronization hardware, Semaphores, Classical problems of
synchronization, Deadlock, Methods for handling deadlock. Memory Management: Swapping, Contiguous memory allocation, Paging,
Structure of Page Table, Segmentation, Demand Paging, Page Replacement Policies, Allocation of Frames, Thrashing. File System
Interface and Implementation: File Concept, Access Methods, Directory and Disk Structure, File System Mounting, File System
Structure, File System Implementation, Allocation Methods, Free Space Management. Disk Management: Disk Scheduling Algorithms,
Disk Management, Swap Space Management.

References:
1. A. Silberschatz, P. B. Galvin, G. Gagne, Operating System Concepts, (9e), Wiley, 2014.
2. A.S. Tanenbaum, H. Bos, Modern Operating Systems, (4e), Pearson, 2015.
3. W. Stallings, Operating Systems: Internals and Design Principles, (9e), Pearson, 2018.

F. Lecture Plan:
Lecture No Topics Session Outcome Mode of Corresponding Mode of Assessing
Delivery CO the Outcome
1 Introduction and Course To acquaint and clear Lecture NA NA
Hand-out briefing teachers’ expectations and
 understand student
expectations
2,3 Introduction: Definition of Discuss the objectives of Lecture 2201.1 Quiz
operating systems, Single OS, dual mode CPU MTE-1
and multi-processor systems, operation, execution of End Term
Operating system Services, system calls, interrupts, and
System commands and booting process.
system calls, Interrupt,
System boot.
4,5 OS Structure: Simple, Distinguish various Lecture 2201.1 Quiz
Layered, Microkernel, operating system structures MTE-1
Hybrid, Modules, Types of and types of operating End Term
OS, Multi-user, Multitasking, systems.
Embedded, Real-time,
Network, Distributed.
6 Tutorial

7,8 Virtualization: Introduction, Describe the process of Lecture 2201.1 Quiz

Hypervisor, Data center, Virtualization MTE-1
Virtual data center, VMware End Term
virtualization products. Programming
Assignment
9,10,11,12, Process: Process Concept, Describe process state Lecture 2201.2 Quiz
Process scheduling transitions, process control MTE-1
Operations on processes block, and context End Term
Inter-process switching and write system Programming
Communication, Unix Pipes programs for process Assignment
creation, execution, inter-
process communication.
13 Tutorial
14,15,16 Multithreaded Describe significance of Lecture 2201.2 Quiz
Programming: Overview, threads, multithreaded MTE-1
multithreaded models Thread models and write system End Term
libraries Programs using programs using PThreads Programming
Pthreads Assignment
17, 18, 19, Process scheduling: Basic Judge various algorithms Lecture 2201.3 Quiz
20 concepts, scheduling criteria, used for process scheduling Tutorial Mid Term I
Scheduling Algorithms. based on various End Term
scheduling criteria
21, 22, 23, Process Synchronization: Apply concepts related to Lecture 2201.4 Quiz
24, 25 Background, Critical section concurrency to achieve the Tutorial MTE-2
problem Peterson’s solution same for cooperating End Term
Synchronization Hardware, processes.
Semaphores Classical
problems of synchronization.
26, 27 Synchronization Programs Write programs for Lecture 2201.4 Quiz
using PThreads synchronization problems. MTE-1
End Term
Project
28, 29, 30, Deadlocks: System model, Apply various deadlock Lecture 2201.4 Quiz
31 Deadlock Characterization, handling strategies to solve Tutorial MTE-1
Methods for handling resource allocation End Term
deadlocks, Deadlock problems.
prevention, Deadlock
avoidance, Deadlock
detection, Recovery from
deadlock.

32, 33, 34, Memory Management: Distinguish between Lecture 2201.5 Quiz
35, 36 Background, Swapping, different memory Tutorial MTE-2
Contiguous Memory management techniques. End Term
Allocation, Paging, Structure
of Page Table, Segmentation,
37, 38, 39, Demand Paging, Page Describe the concept of Lecture 2201.5 Quiz
40, 41 Replacement Policies, virtual memory, and Tutorial End Term
Allocation of Frames, compare various page MTE-2
Thrashing. replacement algorithms
42, 43, 44, File System Interface and Compare various file Lecture 2201.6 Quiz
46, 47, 48 Implementation: File allocation methods and free Tutorial End Term
Concept, Access Methods, space management MTE-2
Directory and Disk Structure, techniques.
File System Mounting, File
System Structure, File
System Implementation,
Space Allocation Methods
for Files, Free Space
Management.

49, 50, 51 Disk Management: Disk Compare various disk Lecture 2201.6 Quiz
Scheduling Algorithms, Disk scheduling algorithms. Tutorial End Term
Management, Swap Space
Management.
 G. Course Articulation Matrix: (Mapping of COs with POs)

CORRELATION WITH PROGRAM OUTCOMES CORRELATION WITH

CO STATEMENT PROGRAM SPECIFIC
OUTCOMES
PO PO PO PO PO PO PO PO PO PO PO PO PSO 1 PSO 2 PSO 3
1 2 3 4 5 6 7 8 9 10 11 12
CS Discuss the objectives, structure, functionality, and
2201.1 types of operating systems. 3 1 2

CS Apply skills to develop system programs using file

2201.2 and process system calls and PThread API. 2 2 3 1 1 1 2 1 1 2
CS Judge various process scheduling algorithms as per
2201.3 scheduling criteria.
3 2 2 1 1 2 1 1 1
CS Examine concepts related to process synchronization
2201.4 and various deadlock handling strategies to solve 3 2 2 1 1 2 1 1 1
resource allocation problems
CS Distinguish different memory management
2201.5 techniques and page replacement algorithms.
3 2 1 1 2 1 1
CS Describe file concepts and compare various disk
2201.6 scheduling and storage strategies
3 2 1 1 1 1 1 2 1 1

1- Low Correlation; 2- Moderate Correlation; 3- Substantial Correlation