Enrolment No.

NITM/XXXXXX
NATIONAL INSTITUTE OF TECHNOLOGY, MANIPUR
B.Tech. Semester - V (CSE). End Term Examination 2022
Subjeet: Operating System (CS303)
Total Marks: 50 Time: 2 hrs
The figures in the margin indicate full marks for the questions
Use of caleulator and steam table is permissible.
Draw diagrams wherever applicable.

a Define the following: (i) Operating system Gi) Distributed Operating system
(ii) Thread ivJob Queue (v)Many to One Multithreading
b. What is a deadlock? List out the necessary conditions for deadlock. Explain about 5
the methods for handling deadlock.
OR
What is a process? List out the various states of process. Explain about Process Control 51
Block.
a) Shown below is the workload for 5 jobs arriving at time zero in the order given 10
below

Job Burst Time

10

12

Now find out which algorithm among FCFS, SJF And Round Robin with
quantum 10.
would give the minimum average time.
woiimp tme
5. a) Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB
13
and 250 KB. These partitions need to be allocated to four
processes of sizes 357 KB
210 KB, 468 KB and 491 KB in that order. Perform the allocation
i.First Fit Algorithm ii.Best Fit Algorithm
of processes using-
ii. Worst
Fit Algorithm
,bSuppose that disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is
currently serving a request at cylinder 143, and the previous request was at cylinder 13*2
125. The queue of pending requests are as follows:
86,1470,913,1774,948,1509,1022,1750,130.
Starting from the current head position, How the following disk scheduling algorithm
will processed the request(afCFS bLOOK JESCAN
CA system is having 3 user processes each requiring 2 units of resource R. What is
the minimum number of units of R such that no deadlock will occur?

4 Differentiate the following |101

i) Tree Structured and Acyclic Graph Directories
ii) Paging and Segmentation

1/2
Enrolment No.

lExternal Fragmentation
iii) Internal and
memory allocation
i Contiguous and Non-Contiguous
and Short term Scheduler
Long term

OR
about the various page replacement
RAID structure. Explain
Discuss in details about

algorithms. r e s o u r c e s of type 5+51

to P5 and three
with five processes PI
aConsidering systema
RI has 10 instances R2 has instances
5 and R3 has7
R1.R2 and R3.Resource type has been taken:
instances. Suppose at time t0 following
snapshot ofthe system

Max
Allocation
ProcessS R2 R3
RI R2 R3 R1
7 5 3
P1 0
3 2
2 0 0
P2
0 2 9
P3
2 2 2
P4 2
O
Ps
ind a safe sequence using Banker's Algorithm.

in detail about the file attributes. List out the operations

What is a file? Explain
possible on the file.
-X

2/2