Scribd
Upload
72 views3 pages

Commerce Bba CA Semester 4 2023 April Operating System 2019 Pattern

Uploaded by

Revati Gadhave
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
72 views3 pages

Commerce Bba CA Semester 4 2023 April Operating System 2019 Pattern

Uploaded by

Revati Gadhave
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Total No.

of Questions : 5l

P-1914 Ilctal No. nf I'ages : -l

[6034,1-403
s.\'. B.B.A. (CA)
CA - : OPERATII\G SYSTEM
4.S3
(ZA19 Pattern) (Semester - IV)

Time: 2% Hoursl [k[a:a Marks : 7l]

lrrslructions to the cfinclidates :


1) Allqiiestion; are roml*lsory.
2) Figxies ti-lhe ight ittcticate.fuil morks.

QI) !,ttempt'rany Eight of the follot'ing : [8x2=t6l


a) Define'LeastRecently Usecl' iltlnemcry tnartagei'ltcnt
b) DeflneContextSwitch? ,-..-' ...

d) I-ist valious properlies o1'tlrc)&.1e. .-.-


e) What is 'seek time' in Dilt scheduling'l
1) What is compaction'l ''-" '. '
l
C) Define Betadl"sAni+-tlalY
h) L,ist any lbur characteristrcs ot opcrating s\'sten-l
i) Define a saf'e state.

i) What is starvation?

a) Explain Operating Sysiem Structure.


b) What is schedullng? Compare short term sche,jtler rvith long tenn scheditler.
c) Drar'v and explaiu Round Robin Schetluling rvith tlre heip of an cxample.

d) What are Semaphores? tirplain the t"r*pts of Setrirphores.


e) Drarv and expla.in the Contiguous N4entorr Allocation.

PT.O.

/
\\
\)
s
t-1., Attempt any Four of the following : {4 x 4 = 16l
a) State and explain Critical Section Problem.
b) Consider the tbllorving set of precesses with the length of the CPU burst
timc eiven in milliseconds -
Plocess Bulst?me,. Arrival Time
PI J 3

P2 ,) 6

P3 4 0
D,i
t? 5

i) Dra\i;r(;alrtt chart using non preernptive Slrortest Job First method


iil CalcLrlate average Turnaround time & average lVaiting tinre.
c) Whal js a deatllock.) Ilou' can rlcadlock be avoiJcd'j
d) Explain File System Access N{ethods- :

e) Irxplain Paging in case of memory :tlenagenr€nt.

Q41 Attempt ant' Four of the followi*g : . r [4 x 4: 16l


ii,} Assume there arc ii total ltt(i trar.'ks prcscnt on the disk" il the r*cluest
clueucis: 82. 170.43. 1'1{-)"24. l6- l90andtheinitial positionofthe head
-f,iare
is 50. Appll, Short-:;I Seek First (SSTF) disk schedr:ling algorithm
arttl ealeulalc total hJad ntdvcntent.

b) Fixplain Job Clontrol Block u'ith the help of a rliagrarn. ;"


e ) What are the charactcrisrics antj necessary conditions tilr a dca.,J!rick?

d) Consider the page ret-erence string. 4. 7, 6" 1. 7, 6. 1:2.'i,2. "


The rrunrber of tiames in the nremory is 3. Initiallli$ liar.ncs are empr,v*.
Find out the number of page l'aults respective tcr :

i) Optimal Page ReplacementAlgorithnr ,., - -

ii) FIFr;Png.Replacenrent,A,lgorirhm
iii) LI{lJ I,age }teplacernentAlgorithrn '.

e) Explain mernory management through Fragmentation r.r'ith thc he Ip of a


diarlunr.

[60341-403
g.i, \\'iitc a shurt fii)tc o| T$o of thr'tLr11o$ing : 11 :, -1 - 6l
ir) Sh.!rtcst 5e k Tinrc Fir,st.
e

b r l.ini,c.i .\llocation hr'l:ilo Sy strn.

c I .\rldre ss binding in case ol nre rror\ inilnilgcnralt.

VVVV

[60341 -403

You might also like