@B@t)SXq

USN

Third Semester B.E./B.Tech. I)egree Exami'nation, June/July

Operating Systems
Tirne: 3 hrs. Max. Marks: I00
Note: l. Answer any FIVE./itll questions, cltoosing ONE lull question fntm etclt moilule.
2. fuI : Mwks , L: Bloom's level , C: Course oulcofies.

Module - 1 M L C
o.1 a. lxplain multi progr:arlnring and time sharing systcrlrs. 07 L3 co1
b. Explain the dual mode operation in operating systems with a neat biock 07 L3 c0l
diagram.
c What are virtual machines? Explain rvitl-r a neat figure, 06 L3 cor
OR
Q.2 a. What are system calls? Brietly explain different types of system calls. 07 L3 cor
b. List and explain the services provided by OS for tl"re user in efficient 07 L3 col
operation of a system:
c. What arc micro kernels? With a neat figure. explain the micro kerncl 06 L3 co1
structure? Point out their advantages over layered approacli.
Module - 2
Q.3 a. What is proccssl) I'.xplain diffcrcnt statos of thc proccss wjth etatc trarrsition OB r,2 co2
diagrar"n and proccss qg4trol block. I
h. What is Interyrlocess comnrnnicalion'l Eryrlain. 06 L2 c02
c. What is thread'l llor,v it ''is ditlbrent tioni process'i lJis,;uss various 06 L2 co2
rnu lt ithread ins rnode ls with su itable il lustration.
OR
Q.4 a. Consider the fbllowing processes where smallcr the nunrber has higher t2 L,2 co2
priority. Drarv thc Gantt chart conrputc thc waiting timc ancl avcragc
tut'rtaround rtne by'using
rour tirne Dv usln FCFS,, SRTF,) ive priority scheduling.
lve
l)rocesscs I 'Arrival
Processes Arrival times
timcs I Burst tiitre
tinre Priorit
Priority
Pr 0 ,7 4
P2 -1 5 2
P3 3 J 6
1
Pa 5 5 J
* 3Y J
b. DiSCuss the benefits bf multithreaded programming. Bxplain the threading 08 1,2 co2
issues in detail.
Module * 3
Q.s a. What are the requirements that must be satisfied by a solution to the critical 08 L3 co3
section problern'l lllustr:ate rvith an example the Peterson's solution tbr
critical section prollern.
b. what is critical section problern and solutions to the problem? Hou, to solve 06 L3 c03
using semaphores?
c. Explain the classical bounded buffer problem of synchronization. Give the 06 L3 c03
solution
OR
Q.6 a. what is dead lock'l what are the necessary conditions for the d;dlock ro
occur? How to recover fi'om deadlocks.
"folr-
1 of2
 . ,i,..
'z;.'ll
BC5303
LIBNARY lPnd'
]

u& /&)(rrne that there are 5 processes

7u l|rc systcnl has fbllowing:

I pr"*rsct:l at k *-i'o,r-T-
Po

M"*
to P+ and 4 types of resources. At time

--l-TtaGbG-l
10 L3 c03

I tA-tsTc*fDTATBffi
I r,,, lolrlr lololzlr lolt l:ltlol
lltlLlrrrrllll

tI n l-iT+t4
p,--1-il-rl-o ffi_l=--l
t n -lol-6-l-t -
[-P-]ol-qffi-l
Apply the bankers algoritlim to answer fbllowing:
(r) What is the conlent of'need matrix?
(ii) ls the system in a salb state?
(iii) If the request f?orn P1(2, l, l, 0) affives can it be granted?

Module - 4
Q.7 a. What is paging? llifferentiate between paging and segmentation. 06 L3 co4
b. What are TLI]? Explain TLB in detail with a simple paging system and 08 L3 co4
neat diagrarn.
Given the memory pmtitions of 100K, 500K, 200K, 300K and 600K, apply 06 L3 co4
first Iit, best fit and worst ht algorithms to place 212K,417K, 112K ancl
426K.
OR
Q.8 a. What is page fault? With a neat diagram, explain'the steps in handlirrg page 08 L3 co4
f ault.
b. lliustrate how denund paging affects system performance. What is 06 L3 c04
thrashing how it can be controlled'l
c. Consider the fbllorving sequence: 06 [,3 co4
7, 0, 1,2, 0, 3, 0, 4,2,3, 0, 3, 2, l, 2,0, 1, 7, 0, 1

Assunring lrame size of 4, apply LRU, FIFO and optin,al algorithm to find
the page faults. Find out rvhich algorithm is tnost et{cl
Module - 5
Q.e a tlxplain various file attributes and operatious of files. 06 L3 cos
co6
b. With a neat diagram, explain two level and tree structured directory 08 L3 cos
struct ttre. co6
c What is file'? Explain the l'tle tnounting. 06 L3 co5
co6
OR
Q.l0 a Clive the following sequence: 95, 180, 34, l19, ll, 123,62.64 r,vith the l2 L3 co5
head initiallir at 50 and ending at track 199. What is the total disk travelled co6
by thc disk drurn to satisfy request trsing FCFS, SSTF, LOOK and CLOOK
alsorithn-ls.
b. Explain the access matrix moclei of implementing protection on OS. 08 L3 co5
c06
{<x{<r<+

2of2