BCS303
~:'Thini'- S'~p1ester B.E.lB. Tech. Degree Supplementary Examination,
.:: ;:: .lune/July 2024
• II
Operating Systems
. . .
Time: :3 hrs. Max. Marks: 100
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.
2. M: Marks, L: Bloom's level, C: Course outcomes.
..
M L C
Q.l a. Define system call. List the types of system calls. 06 Ll COl
b. With a neat figure, explain the concept of virtual machines. 06 L2 COl
c. Define Operating System. Explain multiprogramming and time sharing 08 L2 COl
operating system.
OR
Q.2 a. List the responsibilities of the operating system for process management 06 Ll COl
and memory management.
b. Different between kernel mode and user mode operation of operating 06 L4 COl
systems.
c. Discuss the services that are provided by the operating systems for users 08 L2 COl
and its efficient operation.
Module - 2
Q.3 a. Explain the process states with a neat figure. 06 L2 C02
b. Differentiate between the different types of multithreading models. 06 L4 C02
c. Consider the following four processes, with the length of the CPU burst 08 L3 C02
given in milliseconds:
~----~----------~------~
Process Arrival Time Burst Time
PI 0 8
P2 1 4
P3 2) 9
P4 3 5
Computer the average waiting for the above processes usmg FCFS,
Preemptive SJF and non-preemptive SJF scheduling algorithms.
OR
Q.4 a. Defme thread. List and explain the benefits of multi threaded programming. 06 L2 C02
b. Differentiate between shared memory and message passing methods for 06 L4 C02
interprocess communication.
c. Consider the following set of processes, with the length of the CPU-burst 08 L3 C02
time given in milliseconds:
,-----~----------~------~
Process Arrival Time Burst Time
PI 10 3
-
Ps 5 2
. -
The processes are assumed to have arrived in the under PI , P2 , P3 , P4 , P,
all at time O.
Compute the average waiting time for the above processes using FCFS,
Priority (Smaller priority number implies higher priority) and RR (Time
quantum = 1) scheduling algorithms.
10f3
BCS303
Module -3
Q.5 a. What is critical section problem? Discuss the three requirements that a 06 L2 C03
solution to critical section problem must satisfy.
b. Define semaphore. Explain how mutual exclusion can be implemented 06 L2 C03
using semaphores.
c. Consider a system with five processes Po through P 4 and three resource type 08 L3 C03
A has ten instances, resource type B was five instances and resource type C
has seven instances. Suppose at time 70, the following snapshot of the
system has been taken. Determine whether the following system is safe
using Banker's algorithm. Write the safe sequence.
Allocation Max Available
A B C A B C A B C
1 7 5 3 3 3 2
Po
PI
P2
° ° °°
2
3 2
3 2 2
9 2
P3
P4
°
2 1 1
2
°
2 2 2
4 3 3
° ° OR
Q.6 a. What is deadlock? What are the necessary conditions for a deadlock to 06 L2 C03
occur? I.-
b. Illustrate how dining philosophers' problem can be solved using 06 L2 C03
semaphores.
c. Give five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 08 L3 C03
600 KB (in order). How would each of the fifst fit, best fit and worst-fit
algorithms place processes of 212 KB, 417KB, 112 KB and 426 KB
(in order)? Which algorithm makes the most efficient use of memory?
Module - 4
Q.7 a. Explain segmentation with an example. 06 L2 C04
b. Describe the steps in handling a page fault with a neat figure. 06 L2 C04
c. Consider the following reference string 08 L3 C04
7,0, 1,20,3,0,42,3,03,2,1,2,0, 1, 7, 0, 1
How many page faults would occur for the following replacement
algorithms assuming three frames?
(i) FIFa page replacement (ii) LRU page replacement
OR
Q.8 a. What is thrashing? How can it be controlled? 06 L2 C04
b. Compare and contrast internal and external fragmentation of memory. 06 L2 C04 -
c. Consider the following page reference string: 08 L3 C04
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
algorithms assuming four frames.
replacement . -
i) LRU replacement ii) Optimal replacement
-).
20f3
BCS303
~
Module - S
Q.9 a. Compare and contrast sequential access and direct access methods for 06 L4 COS
extracting information from files.
b. Describe the concept of protection domain with an example of a system 06 L2 C06
with three protection domains.
c. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive 08 L3 COS
is currently serving a request at cylinder 53, and the previous request was at
cylinder 20. The queue of pending requests in FIFO order is
98, 183, 37, 122, 14, 124, 65, 67
Starting from current head position, what is a total distance (in cylinders)
that the disk arm move to satisfy all pending requests, for each of the
following scheduling algorithms?
i) SSTF ii) C-SCAN
OR
Q.I0 a. Differentiate between acyclic-graph directories and tree structured 06 L4 COS
directories.
b. Illustrate the concepts of access matrix with suitable examples. 06 L2 C06
c. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The 08 L3 COS
drive is currently serving a request at cylinder 143, and suppose the
previous request was at cylinder 125. The queue of. pending requests i11
FIFO order is
86,1470,913, 1774,948,1509,1022,1750,130.
Starting from current head position, what is the total distance (in cylinders)
that the disk arm move to satisfy all the pending requests, for each of the
following disk scheduling algorithms:
i) FCFS ii) SCAN
*****
30f3
