/

Total No. of Questions : 5l SEAT No. :

P-1300 lTotal No. of Pages :2

#'
[605fi1-301
($.omputer Science)
T.Y.
**rS*..
cs - sl_{1noI-,trRArING SYSTE}IS - I
(201e Pattffi - v) (Paper - I) (CBCS)
lf":m*ter
Time: 2 HoursJ +) ,i:,::, [Max Marks : i5
Instructions to the ffiffidatei :
'fuer:
1) Atl queffins fucompulsotry.
2) figryto tbe"'right tndicate full marks.
3) Alt$^^",W tti.Wwe data if necessary.
'2. i _:1

Ql) Attempthuy EIGHT ofthe following (out of ten) : .,",'" [8x1:81

a) What is shell? ,,f\ _,*'
b) What is thread? *
,; , #:
c) List types of system calls. #} , ".,\h- :
-i''t"'
,J

d) State role of medium term scffiulaf,"l;S

***i,k* '* '
e) What is CPU - I/O burstffie?,."\'
\l "I
D What is race conditior$u-a-
.+.Y
*u*
g) Define response tirr%*,-"a'' '' .t '"
-
L,i
h) Define Semaphore. ,..Y'
fti
.":
1) What is page table? ,l'=
'

,i*
) What is segmentation?
'
xY 2 :81
\d

Q2) Attempt any four ofthe following : (out of five) r".T4

qq"Ia
a) What is operating system? List objectives of
th.\ ,

b) Define critical sectionproblem. Explain in deffi" ^ii

"

c)
*t ,,*

Compare LFU and MFU with two pointp. \'

't""&-''tt'
'"*:'
+*',,0
. ';"/ a,}tu +

d) What is purpose of scheduling algorithim*' " V:

w,a t+-'. '

a"r.

nt 'u

r*r'u'"

P.T,O.
 \
\
,.s
,r"

Q3) Atternptany two of the following : (out of three) 12 x 4:81

a) With the help of diagram descrilop process states.
b) Consider following set of pft,cesses CPU time given in milliseconds.
Illustrate executiror-E=r,of pr"gppises using FCFS and preemptive SJF CPU
scheduling algo,.rfui and-p'Blculate turn around time, waiting time, average
turn around t#&i.:.5@' waiting time.

Processes,'*,
.u .''*Bg$ttlme A.T
P^ ry:" I

P, 'qp*li a
J 0
'u.q'
n
Ph-. 2 2
D
t^ 4 a
J
J

P4''' 8 2

c) frasmentation? Explain wi
What is fragmentation? ffi$t it+ffies.
*fit " ,,*'r'
*:-.*
'\"'
:""Es" Y !
fY
+l "

Q4) Attempt any two ofthe following;"{ert 9@ee) 12 x 4:81

't**
a) Describe PCB with all its-fo:lds.
t' i,r'l
b) Which three require;nffi ml#tie satisfied while designing a solution to
critical section probtcm? Exp"[ain each in detail.
r'
c) Consider the following4Jft..nce.^^ai.^*
,r,,,.
string *J'r
"-
^.-,:;,
1,2,3,4,2,1,5,6,2,1,J ."".'
tuu, *"
Assume 3 frames. Find the number of page aurts.*ffc."ffardi; FIFO,
OPT. page replacement algorithms.
,-,];=3'
.--"'# 'i.;*'
.f""-'l..i'

QS) Atternpt any one ofthe following :(out oftwo) t:* ,.*' [1 x 3 : 3]
""'i;-t ,,'".
''

a) Describe the term distributed operating;ffim.,$tate its advt. and

disadvantages. "';;'*
,l;,
b) "irr "*'
With the help of diagram describe s*Spjhg.
e,"" I

gss
MMM

", t"'
,"

160ssl-301