USN

GBGS SCHEE
LIBRARYi 17CS64

Sinth Semester B.E. Degree Examination, July/August 2022

Operating System
Tme: 3 his. Max. Marks: 100

Note: Answer any F1V E full questions, choosing ONE full question from each madule.

Module-1
I a . etine Operating System. With a neat diagran, explain its two views. (07 Marks)
b. lixplain the muliprogrammed systems and time-sharing systems. 07 Marks
c. xplain multiproeessor systems and its classification. (06 Marks)

OR
2 a. ixplain the storage hierarchy with a neat diagram. (07 Marks)
b. Fxplain coneept ofvirtual machines. (07 Marks)
c. Define process. Explain the process states with a neat diagram. (06 Marks)

Module-2
3 . Explain single and multithreaded process. List the benefits of multithreaded programming
(07 Marks)
b. Define user threads and kernel threads. (03 Marks)
e. Explain multilevel queue scheduling and multilevel feedback queue scheduling with neat
diagrams. (10 Marks)

OR
a. Explain critical-section problem and list its three requirements. (06 Marks)
b. Describe a synchronization tool for the solution of critical-section problem. (07 Marks)
c. Explain Dining-Philosophers problem. (07 Marks)

Module-3
. Define dead lock. Discuss dead lock prevention. (08 Marks

b. Considerthe following snapshot ofa system

Allocation Max Available
A B C A B CA B C
Po 0 1 0 7 5 3 3 3 2
P|2 3 2 2
P2 0 2 9 0
P 2 1 12 2
Pa 0 0 2 4 3 3
(i) Find the need matrix.
Check whether the sequence < P1, P», P4, P, Po> satisfies the safety criteria.
(i)
(11) Suppose, process makes a request, Request
P (1, 0, 2) that is one additional
=

nstance of resource type A and two instances of resource type C, check whether this

request can be immediately granted.

(iv) Whether the Request = (I, 0, 2) leaves the system in safe state, also find the sequence
<Pi, Pa, Pa, Po, Pa > is safe
(v) A new request, Request = (3, 3, 0) can be granted. Justify your answer (12 Marks)

1 of 2
HY

17CS64

LIBRARY
6 a What is paging? Explain paging hardware w ith TLB
OR
(10 Marks)
b Eaplain the concept of shared pages. (06 Marks
c.Explain segmentation w ith a neat diagram (04 Marks)

Module-4
7 a Considerthe following pagereference stream 7,0, 1. 2.0. 3,0, 4, 2. 3, 9,3. 2. 1.2. 0, 1.7
0. 1. Calculate the n u m b e r o f p a g e faults for FIFO. optimal and LRU algorthms for

3 frames. Which algorithm is the most efficient? (12 Marks)

b.What is demand paging? With a neat diagram explain the steps in handling page fauit.
(09% Marks

OR
8 a. Explain the directory structure for file system. (10 Marks)
b. Explain differcnt allocation methods for a file on a disk with neat diagrams. (03 Marks)
c. Explain backup and restore. (02 Marks)

Module-55
a. Explain: (i) FCFS (ii) SSTF (ii) SCAN (iv) C-SCAN (v) LOOK disk scheduling
algorithms with examples. (12 Marks)
b. Explain revocation of access rights to objects shared by different users. (08 Marks)

OR
10 a. With a neat diagram, explain the components of a Linux system. (08 Marks)
b. Explain the process management in Linux platform (08 Marks)
c. Explain passing of data among processes in Linux. (04 Marks)

*****

2 of 2