Total No.

of Questions : 5_1
SEAT No. :/
P5157 ~---__ .
[Total No. of Pages : 2
rss2Jb
(',....'
601
T.Y.B~~ (C.S.)
CS-361 : OPEJµ.'TING SYSTEM-I I
(2019 _~~,tatte rn) (Semester - VI) '
Time: 2 Hours/ ~':) -~\/
_'-,)
Instructions to the ca11Ji!..~,._.
,,
.!.\," [Max. Marks: 35
1) All questio~~com pµ'lsory.
2) Figures t(/ ~~ rig~fJ~dicate full marks.
~-

Y
v
~
\, , ~

QI) Attempt~ '~_i§g-f"ofthe following.

, .,) \'._"I [8x 1=8]

EM
a) List an~tour attributes of files.
V\ I

b) Wq(tj s·starvation? ,..::,.

V .• ,

,.;_~
c) Li ~ the features of ios. mobile OS?
..,_ . .
d) What is Access Transparency ? -~ ',, l"'i,·~/
AD
e) Define mobile OS? \"C'j ~'/
A, '<'-.) \0 I I

f) .
De fime rational latency? '.;-- I\\ "
r"- ,C'\
~"-.) ~\-
g) Define claim edge?
~ "r\,/
h) Wha is cloud comput~ , ~
AC

i) Define P2P architec~ ? IC'C

0..
j) Define native level pro~ ming?
("I ,,
,-1
·y

Q2) Attempt any four of the following ~1 ~ ~>< 2=8]

a) Define cluster computing. State the advantages .~ is~ tages of
SG

cluster operating system. ~~ \~

b) Differ~nti~te mobile _os _an~ desktop OS. 'o/ {\
~ J "'~~'j
c) Exp lam disk formattmg m disk rnanagem~~ -::l-, v
d) What_is distrib~~ed operating system/ ~ tt~~ rpose of distributed
N

operatmg system ? V '3..., _

C:-t·
e) List down the advantages and disadvanta~;s of windows mobile OS?
... (..y
, ,
..:./
P.T.O.
 QJ) Attempt any two of the following. (2x4=8]
a) List down the architectural styles in distri buted operating system & explain
any one in detail. ,. ?<-
b) What is deadlock? Explain,._,ctl£fferent ways of deadlock recovery.
c) List down di ffere.~ file aU~o1tion methods explain any one in detail.
r "~ ,. r;;",.
Q4) Attempt any two o~ foll3wmg. f2x4=8]
a) Diffemtiate~'tie~~ luster, grid & cloud computing.
b) Consid~ )~) f~lii>wing snap shot of a system with 5 processes P 0 ,
Pl'P2,RrJ.7 an,.,~ 6sources A, B,C.

Y
i Pro AAocation i Max !
·'-, I
·/ .~ ·/ B/ c A / B i c l,

EM
(""' • ! ! I j

3
1

1• 2 9 1 7 1
Si I •• ~
t - - ~-;r-r --
/ Pl , ~/ / 4 0 / 0
1 - - - i - -+ -- - - ' - - i!
---;--
5 / 2 2 I . ; ';

~~·
·' p_2_ _ ;i-s-,r-o~.l-4- +--l-l~/--ir :~~~hLi ~.:; ·
l ; ~i-:"1 ,,.,'V
i P3 4 3
.
i 3 4 1
,.
.· 4 . 4
'
I~> -i

; '.Y· ~r
I
i
AD / " ,'-J
! p. 2 2 1 4 I 6 1
•

; Available ,q,,'-· "7·

/A / B/ c/ ~~ .:::,De
I I i ! ( ,Y ,,.....

..
AC

13 1 3 / 2 / J .,...~
b~
r~\ ~
Answer the following ~"tp:g Banker 's algorithm . ':',f°
i) What are the co~en.ts of matrix need? ~? ·
ii) Is the system in a safe state? If yes find safe seq~ce . .::j ·
c) Write a note on tree structured directories. N~ r\r \.J
SG

i~ ~ /

Q5) Attempt any one of the following , ~ r:f;v

_ [1 x3=3]
a) Suppose the re~~est_sequence is 176, 79, .~ ~~, 9~~ 1, 41,_ 114, and
initial head pos1t10n IS 50. Calculate total ~,ir ma.,~ents usmg SSTF
disk scheduling algorithm. '7'-ry ,,---
N

b) Write a sholi note on kernel architec~bf~bile OS.

• •
2
f5823J-601