COURSEPACK (Winter 2024-25)
SCHEME
The scheme is an overview of work-integrated learning opportunities and gets students out into the
real world. This will show what a course entails.
Course Operating System Course Type Integrated
Title
Course R1UC403B Class B. Tech CSE 4th Sem
Code
Activity Credits Credit Total Number of Classes Assessment in
Hours per Semester Weightage
Lecture 3 3
Instruction
delivery Tutorial 0 0
Practical 1 2
Self-study 0 7
Total 4 12 45 45 30 105 50% 50%
Course Dr. Tanveer Hasan Course Mr. Yashwant Soni
Lead Coordinator
Names Theory
COURSEPACK |
Course Dr. J. N. Singh Dr. J. N. Singh
Instructors Dr. Sonia Kukreja Dr. Sonia Kukreja
Dr. E. Rajesh Dr. E. Rajesh
Mr. P. Rajakumar Mr. P. Rajakumar
Dr. S. Srinivasan Dr. S. Srinivasan
Indervati Indervati
Pragya Tewari Pragya Tewari
Urvashi Sugandh Urvashi Sugandh
K. Suresh K. Suresh
Yashwant Soni Yashwant Soni
Dr. P Sudhakar Dr. P Sudhakar
R. Radhika R. Radhika
Satheesh Kumar Satheesh Kumar
Pragya Pragya
Nripendra Dwivedi Nripendra Dwivedi
Sundara Kumar Sundara Kumar
Sandeep Kumar M Sandeep Kumar M
Aditya Kishore Saxena Aditya Kishore Saxena
Manu Singh Manu Singh
Kirti Kirti
Dr. Gaurav Agarwal Dr. Gaurav Agarwal
Kushal Gupta Kushal Gupta
Shwet Ketu Shwet Ketu
Maheshwari Niranjan Maheshwari Niranjan
Dr. Munish Khanna Dr. Munish Khanna
Sonu Kumar Jha Sonu Kumar Jha
S Karpaga Selvi S Karpaga Selvi
Anjali Kapoor Anjali Kapoor
Amit Yadav Amit Yadav
Dr. Gaurav Agrawal Dr. Gaurav Agrawal
Ranjith M Ranjith M
Siddharth Gautam Siddharth Gautam
Tanveer Hassan Tanveer Hassan
Chaya Rawal Chaya Rawal
Muzafar Mehraj Misgar Muzafar Mehraj Misgar
Rikendra Rikendra
Sheelesh Kumar Sharma Sheelesh Kumar Sharma
COURSEPACK |
COURSE OVERVIEW
This course will introduce the student to the basic concepts involved in the design and
implementation of an operating system. Students will be made familiar to the important modules
of operating systems like process management, memory management, file systems,
synchronization primitives and exception handling. Important data structures used in the design
of these modules will be introduced. The accompanying lab course is intended to give students an
illustration of the concepts introduced in the theory course.
PREREQUISITE COURSE
PREREQUISITE COURSE YES
REQUIRED
If, yes please fill in the Prerequisite Prerequisite course name
Details. course code
Computer Organization
Architecture.
COURSE OBJECTIVE
1. To understand Functions, Services and structure of Operating Systems.
2. To learn processes, threads, schedulers and explanation of CPU scheduling.
3. To understand issues related to Process Synchronization and focus on principles of Deadlock and related
problems
4. To comprehend the mechanisms used in Memory Management and Virtual Memory.
5. To use the concepts of File System, secondary storage management and Disk Scheduling
COURSE OUTCOMES(COs)
After the completion of the course, the student will be able to:
CO No. Course Outcomes
R1UC403B .1 Describe, contrast and compare differing structures for operating systems
R1UC403B .2 Understand and analyse theory and implementation of processes and resource control.
R1UC403B .3 Implement various synchronization and scheduling algorithms in operating system.
R1UC403B .4 Explain the low-level implementation of memory and I/O management techniques.
COURSEPACK |
BLOOM’S LEVEL OF THE COURSE OUTCOMES
Bloom'staxonomyisasetofhierarchicalmodelsusedfortheclassificationofeducationallearning
Objectives into levels of complexity and specificity. The learning domains are cognitive,
affective, and sychomotor.
COMPREHENSIVE
Remember Understand Apply Analyse Evaluate Create
CO No.
KL1 KL 2 KL 3 KL 4 KL 5 KL 6
R1UC403B .1 √
R1UC403B .2 √
R1UC403B .3 √
R1UC403B .4 √
PROGRAM OUTCOMES (POs): AS DEFINED BY CONCERNED THE APEX BODIES
Engineering Knowledge: Apply knowledge of mathematics, natural science, computing,
PO1: engineering fundamentals and an engineering specialization as specified in WK1 to WK4
respectively to develop to the solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature and analyse complex
PO2: engineering problems reaching substantiated conclusions with consideration for sustainable
development. (WK1 to WK4).
Design/Development of Solutions: Design creative solutions for complex engineering
problems and design/develop systems/components/processes to meet identified needs with
PO3:
consideration for the public health and safety, whole-life cost, net zero carbon, culture, society
and environment as required. (WK5).
Conduct Investigations of Complex Problems: Conduct investigations of complex
PO4: engineering problems using research-based knowledge including design of experiments,
modelling, analysis & interpretation of data to provide valid conclusions. (WK8).
Modern Tool Usage: Create, select and apply appropriate techniques, resources and modern
PO5: engineering & IT tools, including prediction and modelling recognizing their limitations to solve
complex engineering problems. (WK2 and WK6).
The Engineer and The World: Analyze and evaluate societal and environmental aspects while
PO6: solving complex engineering problems for its impact on sustainability with reference to
economy, health, safety, legal framework, culture and environment. (WK1, WK5, and WK7).
Ethics: Apply ethical principles and commit to professional ethics, human values, diversity and
PO7:
inclusion; adhere to national & international laws. (WK9).
Individual and Collaborative Team work: Function effectively as an individual, and as a
PO8:
member or leader in diverse/multi-disciplinary teams.
COURSEPACK |
Communication: Communicate effectively and inclusively within the engineering community
and society at large, such as being able to comprehend and write effective reports and design
PO9:
documentation, make effective presentations considering cultural, language, and learning
differences.
Project Management and Finance: Apply knowledge and understanding of engineering
PO10: management principles and economic decision-making and apply these to one’s own work, as a
member and leader in a team, and to manage projects and in multidisciplinary environments..
Life-Long Learning: Recognize the need for, and have the preparation and ability for:
PO11: i) independent and life-long learning ii) adaptability to new and emerging technologies and iii)
critical thinking in the broadest context of technological change. (WK8).
Have the ability to work with emerging technologies in Computer Science and Engineering
PSO1:
requisite to Industry 4.0.
Demonstrate Engineering Practice learned through industry internship and research project
PSO2:
to solve live problems in various domains.
COURSE ARTICULATIONMATRIX
The Course articulation matrix indicates the correlation between Course Outcomes and
Program Outcomes and their expected strength of mapping in three levels (low, medium,
and high).
COs/
POs
R1UC403B - - - - - - - - - - - 2
2 -
.1
R1UC403B
2 1 - - - - - - - - - -
2
.2
R1UC403B 2 2 -
- - - - - - - - - 2
-
.3
R1UC403B
2 2 - - -
- - - - - - -
- 2
.4
Note: 1-Low, 2-Medium, 3-High
COURSE ASSESSMENT
The course assessment patterns are the assessment tools used both in formative and
summative examinations.
COURSEPACK |
Assessment Pattern for Integrated (Blended) Course:
CIE Total Marks Final Marks
Type of Course (B) CIE*0.5+SEE*0.5
LAB MTE CIE SEE
Work@ LAB
EXAM*
+ Record
INTEGRATED 25 50 25 100 100 100
@Lab Work-15 marks + Lab Record-10 marks
*Passing Criteria-30% of marks to be secured in the lab Exam conducted by two examiners (one internal and one external)
COURSE CONTENT
THEORY+ PRACTICAL
Contents
Theory
Introduction: Operating system and functions, Classification of Operating systems-Batch,
Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser Systems,
Multi process Systems, Multithreaded Systems, Operating System Structure-Layered
structure, System Components, Operating System services.
CPU Scheduling: Scheduling Concepts, Performance Criteria, Process Concept Process
States, Process Transition Diagram, Schedulers, Process Control Block (PCB), Process
address space, Process identification information, Threads and their management,
Scheduling Algorithms, Multiprocessor Scheduling.
Concurrent Processes: Process Concept, Principle of Concurrency, Producer / Consumer
Problem, Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution,
Semaphores, Test and Set operation; Classical Problem in Concurrency-Dining Philosopher
Problem, Sleeping Barber Problem; Inter Process Communication models and Schemes,
Process generation. Deadlock: System model, Deadlock characterization, Prevention,
Avoidance and detection, Recovery from deadlock.
Memory Management: Basic bare machine, Resident monitor, Multiprogramming with fixed
partitions, Multiprogramming with variable partitions, Protection schemes, Paging,
Segmentation, Paged segmentation, Virtual memory concepts, Demand paging,
Performance of demand paging, Page replacement algorithms, Thrashing, Cache memory
organization, Locality of reference.
I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk
storage and disk scheduling, RAID. File System: File concept, File organization and access
mechanism, File directories, and File sharing, File system implementation issues, File
system protection and security. .
COURSEPACK |
Lab (To be implemented in C)
1.Basic Commands in Linux Operating System
2.Write a Shell program to check the given number is even or odd
3.Write a Shell program to swap the two integers
4.Write a Shell program to find the factorial of a number
5.write a shell program to generate fibonacci series
6.Write a C program using the following system calls (fork, exec).
7.Write a C program using the following system calls (get_pid, exit).
8.Write a C program using the I/O system calls (open, read, write, etc)
9.Write a C program to simulate CPU scheduling algorithms: FCFS, SJF, and Round Robin
10.Write a C programs to simulate Page Replacement Algorithms a) FIFO b) LRU
11. Implementation of memory allocation algorithms: a)First Fit b) Best Fit c)Worst Fit)
12.Implement the Producer – Consumer problem using semaphores
13.Implement the Dining Philospher problem using semaphores
14.Write a C programs to simulate Intra & Inter – Process Communication (IPC) techniques.
15. Write a C program to simulate Bankers Algorithm for Deadlock Detection
16. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance
17. Simulate all File Organization Techniques a) Single level directory b) Two level
18. Simulate all file allocation strategies a) Sequential b) Indexed c) Linked.
19. Write a C programs to simulate implementation of FCFS Disk Scheduling Algorithms.
20.Write a C programs to simulate implementation SSTF Disk Scheduling Algorithm.
LESSON PLAN
Topics for Delivery Theory/ Skills Competency
L.No.
Practical
1 Introduction of Operating system, Operating system Theory Understand the
and functions fundamental concepts
in operating system
2 Classification of Operating systems, Batch, Theory
Interactive, Time sharing
3 Real Time System, Multiprocessor Systems Theory CO1
COURSEPACK |
4 Multiuser Systems, Multi process Systems, Theory
Multithreaded Systems
5 Operating System Structure-Layered structure Theory
6 System Components Theory
7 Operating system Services Theory
8 Process Concept, Process States, Process Theory
Transition Diagram
9 Schedulers, Process Control Block (PCB) Theory Understand the
10 Process Scheduling, Operations on Processes Theory process concepts of
Operating system and
11 Inter Process Communication models and Theory
Scheduling
Schemes,
Algorithms
12 Threads and their management, Multithreading Theory
13 Models Theory
CO1, CO2
14 CPU Scheduling Concepts, Scheduling Criteria, Theory
15 Process Scheduling, Operations on Processes Theory
16 Scheduling Algorithms (RR, Multilevel queue) Theory
17 Scheduling Algorithms (Multilevel queue and Theory
18 Multilevel feedback Queue) Theory
19 Process Synchronization, Principle of Theory Know how to
Concurrency prevent deadlock in
20 Producer / Consumer Problem, Mutual Exclusion Theory Operating system,
21 Critical Section Problem, Dekker’s solution, Theory know how to avoid,
22 Semaphores, Test and Set operation Theory detect and recover
deadlock in
23 Classical Problem in Concurrency-Dining Theory
Operating system CO3
Philosopher Problem
24 Sleeping Barber Problem Theory
COURSEPACK |
25 Deadlock: System model, Deadlock characte Theory
26 CO3
Avoidance and detection, Recovery from
deadlock.
27 Memory Management: Basic bare machine, Theory
Resident monitor
28 Multiprogramming with fixed partitions Theory
29 Multiprogramming with variable partitions Theory CO3
30 Protection schemes, Paging Theory
Understand about
31 Segmentation, Paged segmentation Theory
memory management
32 Virtual memory concepts Theory concept, concept of
paging and Thrashing
33 Demand paging, Performance of demand paging Theory
34 Page replacement algorithms Theory
35 Page fault Theory
CO4
36 Thrashing, Cache memory organization Theory
37 Locality of reference. Theory
38 I/O Management and Disk Scheduling: I/O Theory
devices
39 I/O subsystems, I/O buffering Theory
40 Disk storage and disk scheduling Theory
41 RAID. File System: File concept, File organization Theory
and access mechanism,
42 File directories, and File sharing Theory CO5
43 File system implementation issues Theory
44 File organization and access mechanism, Theory M
45 Files system Protection and securities Theory Understand the concept
46 Recent Trends and Development Theory of File System, File
COURSEPACK |
organization and its
mechanism, concept of
I/O Management and
Disk Scheduling
BIBLIOGRAPHY
◻ Text Book
Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley, Ninth Edition, 2013.
◻ Reference Books
• R. Modern Operating Systems, Andrew S. Tanenbaum, Herbert Bos, Pearson Education
India; Fourth edition 2016. ISBN-13:978- 9332575776
• 2. Operating Systems: A Design-Oriented Approach, Charles Crowley, International
edition, McGraw-Hill Education (ISE Editions). ISBN-13 978 0071144629
• 3. Operating Systems: Internals and Design Principles William Stallings, Pearson
Education India; 7 edition (2013). ISBN-13: 978-9332518803
•4. D M Dhamdhere, “Operating Systems: A Concept based Approach”, McGraw Hill
Education, edition, 2012
◻ Webliography
• https://www.geeksforgeeks.org/operating-systems/
• https://www.tutorialspoint.com/operating_system/index.htm
◻ NPTEL/MOOCs Certification
• 1. https://onlinecourses.nptel.ac.in/noc20_cs04/preview
• 2. https://archive.nptel.ac.in/courses/106/105/106105214/
PROBLEM-BASED LEARNING
Exercises in Problem-based Learning (Assignments)
Sr. No. Practice Problem
1. Define an Operating system. Explain the functions of an operating system.
2. Explain the classification of operating system in detail.
3. Define batch systems? How they are different from time sharing systems?
COURSEPACK |
4. Define the benefit of viewing a system such as an operating system as a set of layers?
5. What are the main differences between operating systems for main frame computers and
personal computers?
6. Classify the following applications as batch-oriented or interactive: a)
Word processing
b) Generating monthly bank statements
Computing pi to a million decimal places
7. Define a real time system or interactive system. Define its characteristics?
8. Consider a system with a set of processes P1, P2, P3 and P4. Let their arrival times and
CPU burst times mentioned as below:- Process
Arrival time CPU Burst Time
P1 0 3
P2 1 6
P3 5 4
P4 6 2
1) Draw Gant chart using FCFS, SJF, RR (Assume quantum to be 2 units of time]
Calculate: -a) Average Turnaround Time (b) Average Waiting Time
9. Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is
given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is
on track 50. Compute the additional distance in tracks that will be traversed by the R/W
head when the Shortest Seek Time First (SSTF) algorithm and SCAN (Elevator) algorithm are
used (assuming that SCAN algorithm moves towards 100 when it starts execution).
10. Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB ( in order), how
would each off the first fit, best fit, and worst fit algorithms place processes of 212 KB, 417
KB, 112 KB, and 426 KB (in order) ? Which algorithm makes the most efficient use of
memory?
11. On a system using first-fit allocation, assume memory is allocated as below before additional
requests for 20K, 10K, 5K are received.
Used Hole Used Hole Used Hole Used Hole Used Hole Used Hole
10 K 10K 20K 30K 10K 5K 30K 20K 10K 15K 20K 20K
At what starting address will each of the additional requests be allocated?
12. Explain the following:
a) Page Table Base Register
b) TLB Miss
c) Valid- Invalid bit
d) Effective memory access time
13. Given references to the following pages by program:
0,1,4,2,0,2,6,5,1,2,3,2,1,2,6,2,1,3,6,2how many page faults will occur if the program has
three page frames available to it and uses:
a) FIFO replacement
b) LRU replacement
c) Optimal replacement
COURSEPACK |
14. List three examples of deadlocks that are not related to a computer system
environment.
15. Explain the differences between multiprocessor and multi-tasking systems.
16. Explain the idea/concept behind Multiprogramming? How multi-programming
is different from multiprocessing?
17. Consider the following set of processes that need to be scheduled on a single CPU. All the
times are given in milliseconds.
Process Name Arrival Time Execution Time
A 0 6
B 3 2
c 5 4
D 7 6
E 10 3
Using the shortest remaining time first scheduling algorithm, calculate the average process turnaround
time (in msec)
18. Explain the different system components of operating system in detail.
19. What are the objectives of a good scheduling algorithm?
20. For the processes, Draw the chart illustrating their execution time:
Process Arrival Time Processing time
A 0.0000 3
B 1.001 6
C 4.001 4
D 6.001 2
a) Compute the Average turnaround time using Round-robin ( quantum=2), Round-robin(
quantum=1). b) Compute the wait time using Round-robin ( quantum=2), Round-robin(
quantum=1).
21. For the processes, Draw the chart illustrating their execution time:
Process Arrival Time Processing time
A 0.0000 3
B 1.001 6
C 4.001 4
D 6.001 2
a) Compute the Average turnaround time using FCFS, SJF.
b) Compute the wait time using FCFS, SJF.
22. Define the following:
a) Wait time
b) Response time
c) Turnaround time
23. Define a critical section? List the requirements that a solution to the critical section problem
must satisfy?
24. Explain the following:
(a) Mutual exclusion
(b) Bounded waiting
(c) Race condition
COURSEPACK |
25. Explain critical section problem in concurrency.
26. List and describe different types of semaphore? Which semaphore is used to solve
Producer consumer problem?
27. Describe a semaphore? Give difference between a semaphore
and mutex.
28. Explain deadlock and starvation in a semaphore.
29. Consider a logical address space of 64 pages of 1,024 words each, mapped
onto a physical memory of 32 frames.
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?
30. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600
KB (in order), how would the first-fit, best-fit, and worst-fit algorithms
place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which
algorithm makes the most efficient use of memory?
31. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement
algorithms, assuming one, two, three, four, five, six, and seven frames?
Remember that all frames are initially empty, so your first unique pages
will cost one fault each.
• LRU replacement
• FIFO replacement
• Optimal replacement
32. The following is a code with two threads, producer and consumer, that can run in
parallel. Further, S and Q are binary semaphores equipped with the standard P and V
operations.
semaphore S = 1, Q = 0;
integer x;
producer: consumer:
while (true) do while (true) do
P(S); P(Q);
x = produce (); consume (x);
V(Q); V(S);
done done
Which of the following is TRUE about the program above?
(A) The process can deadlock
(B) One of the threads can starve
(C) Some of the items produced by the producer may be lost
(D) Values generated and stored in ‘x’ by the producer will always be consumed before the
producer can generate a new value
33. Choose among the following suffer from Belady's anomaly and which of them not.
Explain.
COURSEPACK |
a) LRU replacement
b) FIFO replacement
c) Optimal replacement
34. Define page replacement? Define the need of page replacement? Elaborate it via diagram.
35. Suppose the following disk request sequence (track numbers) for a disk with
100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the
R/W head is on track 50. Compute the additional distance in tracks that will be traversed by
the R/W head when the Shortest Seek Time First (SSTF) algorithm and SCAN (Elevator)
algorithm are used (assuming that SCAN algorithm moves towards 100 when it starts
execution).
36. Write short notes on:
a. Devices independent I/O software
b. Device Controller
c. Interrupt handler
d. I/O Devices.
37. Consider a disk queue with request for input/output to block cylinders
98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at
cylinder 53 and moving towards cylinder number 0. Compute the total number of head
movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively
38. Suppose a disk drive has 400 cylinders, numbered 0 to 399.The driver is currently
serving a request at cylinder 143.The queue of pending request in FIFO order is:
86,147,312,91,177,48,309,222,175,130. Starting from the current head position Define
the total distance in cylinders that the disk to satisfy all the pending request for each of
the following disk scheduling algorithms?
1] SCAN 2] C-SCAN
39. Define file management system?
Define the main tasks of the file management system?
40. Compare the different levels of RAID organization.
COURSEPACK |
