Part-B

( 4 x S = 20 Marks)
II What are the steps required to handle a page fault in s L2 4
demand paging?

12 Why page sizes are always power of2? 5 L2 4

13 Explain the types of program threats in detail, including 5 3 5

hO\V each one operates and its potential impact on a
computer system.
14 What are the Goals of Protection and Principles of 5 2 s
Protection
Pa.r t-C
Either OR Choice Questions
2 X t O= 20 Marks
15a A computer has 3 frames (physical memory pages) and IO L4 4
uses the following sequence of page requests:
1, 2, 3, 4, 2, 1, 5, 3, 4, 2
Using the following algorithms, determine the page faults
for each algorithm:
[Link]-In-First-Out(FIFO)
[Link] Recently Used (LRU
3. Optimal Algorithm

(or)
!Sb Explain the physical and logical structure of a disk, 10 L4 4
including the layout of tracks, sectors, and blocks.
Describe the concept of disk formatting, including Jo,v-
level formatting and high-level formatting. Discuss the
role of the file allocation table (FAT) or inode table in
managing disk storage. Finally, illustrate the steps
involved in reading and writing data to a disk, including
seek time, rotational delay, and data transfer time.

Exolain with example Threats to Protection and Securitv 10 3

6a 5
(Or)
10 3 s
5b con1puter security
briefly explain with example about
classification I
 I Sa A disk has 200 cy
is currently at cylinder
queue:
- Request 1: Cylinder 50
- Request 2: Cylinder 120
- Request 3: Cylinder 30
- Request 4: Cylinder 180
- Request 5: Cylinder 70
Using ~ch of the fo llowing disk scheduling algorithms,
detennme the order in which the requests are serviced and the
total distance traveled by the disk head:
I. First-Come-First-Served (FCFS)
2. Shortest-Seek-Time-First (SSTF)
3. SCAN (Elevator Algorithm)
4. C-SCAN (Circular SCAN)
5. LOOK (Circular LOOK)
6. C-LOOK Circular LOOK .
or
1Sb Explain how the concept of segmentation and paging can be 1O
applied to manage the printing facility efficiently. Describe how
the printers can be segmented and paginated to allocate printing
resources to each department, ensuring that both departments get
their required printing done without any conflict. Consider the
scenario where one department requires more printing resources
than the other.
>a Define the security problem in computer systems and discuss the \
various program threats that can compromise system integrit)'
and confidentiality. Provide examples of common program
threats and their otential im acts.
Or
[Link] with example for Program Threats, System and Network
Threats
0) and Bloom's level (BL) Co"eraii
 - • • •• • Y ' ll, : , I . I- - , •, r) .• Y.- .' \ (> ~r"
I , 14 I ' 'cl , II J' I Ii• • I ." If I• ,[Link]; I I . \r u <- \ u r c <'f a d' .·•• ., ,
. • : I YI )' It f f '
I >c •·1t ·,;1,( . flat • .
1
lr ; 11... l-: ·:, '•[Link] · anc\ h\o<.,Y: ..
- - · '-•111t •e pt c, f I . k '• . \ •)I-
I<' , cl lo, •11 : 1lf 111 • , I c I ' ' lot,na tting, in<;\ uchng, '> •
,.,,(. cd fl1c- f J >. •11 1< 1111 1'11 - l cv C•I f• 1rrn ~,\\1n e,. l ) '\',(;•uf,, • the
.
. , . ~ c :ii loc :at i on lahl c ( I· /\'I ) or inodc tah\c 1n \
111.'.11 .11 :'.111 :_ di s k . s lorag c, l-i11all y, illu~lr alc the st~-ps
11 111
" nl\:q f read ing and writi ng data to a disk , inc\u dtng
Sl~ck 1~111:,~~!!~•-~•n!!l__dc~_., and data transf1.."T time. .
! :~~jll:1i11 wi1l1 cxa111plc 'T'hrcats to Protection and Sccu nt·
1-~--,.
~h hric tly explain with example about computer secun
(Or) ..;
classification
Cour se Outc ome (CO) and Bloom's Le\'e\ lBL)
CO Coverage in%
J(JJ
 . . .
_:.._:--~::'.:". :s:-...:--,:

--,-
..::..,.............
-: ___ -- , ..__
_.,..

--- ---- ---- --

... --
~

----------
~
-
- - - - 7 :--
- .... _~
,~
 I d l"l - ~
I Su E ithe r OR C hoice Q uestio ns
(-, V .
A corn putcr h~ <- 'l r_ , "~ 10 == 20 Marks
.., .;, J ararncs (ph ysical memory pages) and \ 3
uses the fo llowi ng sequence of page requests: LA \ 4
J, 2, 3, 4 , 2~ I, 5, 3, 4, 2 \
Using the foll owing algorithms, determine the page faults \
for each algorithm:
[Link]-In-First-Out(FIFO) \ \ \

I
\
'
[Link] Recently Used (LRU
3. Ontimal Al2orithm
15b ~xplai_n the physical and logical ~~ of a disk, \ 10 \ lA
1nc]ud1ng the layout of tracks, sectors, and blocks.
Describe the concept of disk formatting, including \ow-
leve] fonnatting and high-level formatting. Discuss the
role of the file allocation table (FAT) or inode table in
managing disk storage. Finally, illustrate the steps
involved in reading and writing data to a di~k, including
seek time. rotational delay, and data ~fer time.
. • ___, .,,. Tht"PAtA to
 --=- -~ - - -- - - - - - - -- - -- -- - -- -- -
Part-B
4 x 5 = 20 Marks
1~

11 / \\ ·hat arc the stCJlS required to handle a page f au\t in

-~1-~l cn1an(f 11aging?
- -always
- \\ ·11~· arc !lagc sizes -- - at--a power
- --of-------------
2?
,.
I
l. ~ ; E.-XJllain the ty1Jc..~ of program threats in detail, including
! he_.,,,. cacl1 (l11c (li1cratcs and its pote11tial impact on a
/ C()111puter s,1stc111.
I ..I j \\1 l1at ,ire tl1e Goals of Protection and Princip\es
· Prt)tcctio11
Part-C
Either OR Choice Questi I
 1£:: -~ : :
=r e : ;:[Link]. (O r
::s-,,:::-;:c:s..
A . T"' ?O :i=e.:;h P4
.. c l: ;r .e the f . d .; ~ p c s o

-
~
i
" !
1
-
• I • •
. : : ~ ~s:c

-
. I
m c-••c::

i: a
f \0 I

:
.. I •
a;-
i
• !
'
,. !

•
J

-
•
•

v iv o Tb< ·~
Apoorva O ct
,;202,4, W 32
 80.r-.;,
Tu,,. I
Pl 2~=1 0
T1"""-'

4 -
I

'
PJ 4 I 2 -
P3 6 2 3
P4 10 3 s -
PS 8
" l
P6 l 2(h1gn} s 4
P7 9 6 6
l)naw lhe Gann
the proc,cssc:s. Chan and Calwt..IC lhc ro\l.....,ng fo1 ~\\

i) Comptct,oo umc
Ii) Tum Around Tune
ii,) W111ung Time
I
,o,,
t6b
consider the following mapoho1 of a ,yo1cm·
6Jj9s,l\R!I
ARCO
p(\12
~ U-
Al" l1
no11
-1,lt
II ~CD
l'lQ
10 ) 3 I

n. 1nuo 175 n
I\ J\H ll5b
I': Oft ,1 n,n
r no 11 a~~"
r. rollowing (lllCSIIOM using 11M, b:inkcr's
IW"c:r !he
nJgorhhm:
u. Whal IS the contcnl or lhc 11\lllnX 'lccd7
b. Is 1hc system ,n A s.1rc <laic?
c. 1r, r,:quc:sl rrom proccn Pl :umcs for(0,4.2,0), can lhc
-uc:sl be -n1cd 1mmcd1A1d•'?

C••"' 0•1<•tt" (CO) and Oloora•• lc"l (Bl.) Count• In Qu ..11001

BL Cov1u1&• In ¥o

Appro,rd b)' tbe Audll Profes,orlCourff Coordill11or

vivo T2x lli!!>

Apoorva Oct 1, 2024, 11:33
 rm.:.c: Am Pnxa,1
\'lll n11
~
Time Time
·\ 0 3
B I 6
C -I -I
D 6 2
14 1 ) 3
In • system ,.,th '"" pcOCC\an Pl and P1 and l•O
N>OUl'CCS RI and tu, ~ follow,ng ,nwuon an=
.
• r I holds RI and n:quau IU.
P:? holds R2 one! n:quesu Ill
Carutrucl the Rcsoun,c Alloc:,auon Gnph for the ~ c
•lruotio11 and chccJ. "hcthcr deal!~ has .,.,-um,,! If •
Jc:,dlocL. 1s dcta.._,Nl. •v1&,."C"C1 • mnhod to roohc lhc
dcodlocl. and Justir> >~ IIN"CT
Pan -C
l
Elthrr OR Choltt QuNtloo•
px I0 • l0 \l ar~
!Sn Let us tons,d.:t o s,,:cruanu tn ~ l111i.h • r,"'°'c r tn~
rh,rngmg J.1111 tn 11 [Link]«[Link] ncmot) lo.:,llon \t ,he
,.1J1t,> lune •nothcr pro<~< P2 Irle, rc:iJ1ni; J,i. lrom t,hc
,11mc memo!) l<><•llon
I
10
I
L4
l J

u II tcn1,c,n 1hc Nit:$ to be folto"cd for J'l'C$CI' mi;

du1n con1is1cnc).
b E.,pltam the ctum:at sotuuons me! S~,ichroniz:anea
Hllnlwaro for prcscn1ngtbta co~i'1c:nq.

!or!
ISb Exp!Jun [Link] thrc.: methods of rommuruQtK'fl ,n C,rmt• 10 t4 l l
Server • )"'tern ,, tth the nci:e5SU)' d1aiznuns.

I6n Consider the follo\\in11 c"1mrlc \\llh SC'\ffl !'""'CSU:> ud 10 J

j l.i"c [Link] S![Link]

vivo T2x -
Apoorva Oct 1. 2024, 11:33
 l'lln 8
14 • 5 • 10 t,brbl
II What nrc the suucs undcrpnc: b)' a procas [Link] • uaa ,
~ \u
2 2 \ 2h.l
~pens mon, 1111111 one IIJll'hcotion on O bptoi, •• the """-" I
t1me'l lllu11ibatc 1hc L\me using suitable di::t!VlfM.
.
12 lhplnl~ the role of scmiq,harc in chievulJ; n:wt\W
e,u,:lusion.
4
ul 2 2 u..21
s u
IJ
[Link]:nuc: t h e n ~ condiuons for • deadlock to occur. "1I 1.21

14 Cqn,id"': four proccsu. "'"h the length af CPU bw'il lime s u l 2 Ll.3
ond omval lime Cn:a,c [Link] chara ,llusuatang the
••••:.nlon or lh<:ilc pmcca.•cs usm; SR'f
Et!:11.:f:ll ArriYill Iimi: D11c;L Iim~
o.o

I
P, 7
P, 2.0 4
PJ 4.0 I
P, 5.0
"
--
IS• -... . _
._ ~_..,.,~,_.
handldl lhc removal or runn,na ~
fiom tho, CPU
the
Pan -C

! 2 X 10• 20
pn,o:oo
...... \"
Elt~,r OR Clloltt Qu,.don,
Marta)

1111d k i<'llli another f1mCC>O ba....i "" .m~ ,uatcll)' ro,

ploCCSS ,cl1c:duling. Rcprc:acnl lhc pmcoa ,d\cduhng "''"II
!.A 2 l 2.6J

• Qucudng dilllV"m.

15b Who~ condition• l)e,cnbc • .olul,on IO lhc: o,n,na

--;;,,1- -• 10 \ LA l 3 2.6J
nhilosonhcr moblcm !IO lhal no ""'cs 1111C.
10 I 1.3 3 3
--
3.2.3
16• Cnnsl~cr nvc procdSCS Wilh lhc lcn111h ofCPU bunt IIIIIC,
Arrival time Mel Pnonty (amoll value ncans hillh pn<>nty)

P,ectu nunrlor \Jf(I).

e
1-, -.
Pl 40 '
Pl
Pl
..
H I
ti I
?'
11
ii
JC ~-
H j
•
(i) Creole 0111111 cltarb Ul11str111ng 1h: .,.ccu11on or thcle
processes using FCFS. non-p!fflT'pb\'C SJF. prianl)'
scheduling and round-robin sd,cduhog (qumtn= • S ffll)
algorithms foe~ set or pcocc:s,es.
(ii) Calculalc the IUflllllOUIIII lime f o r ~ Pl
ofthe above algorithms.
under•
(iii) Calculate the average wailing liJIIC for -ii qoritbnl
and find out which algorilhm would g,,-c dlC minlmUIII
avera- wai""n tune-

vivo T2x @
Apoorva Octl , 2024, 11:32
 PIO Priority Arrival Burst
Time Time

Pl 2(1ow) o 4

P2 4 1 2

P3 6 2 3

P4 10 3 5

PS 8 4 1

12(high) 5 4
P6
9 6 6
P7
Draw the Gantt Chart and Calculate the Hll
lowing r,
the processes,
i) Co1nplction tirnc
ii) Tun1 Aroun<l Tianc
iii) Waiting Time

Consider the follo\ving snapshot of a system: ~

16b ~llocation Max
AB CD /\B CD
00 12
'
A, 00 12
10 00 17 50
P1 23 56
1'. \~4
,,,Pz Ob32
001-1
06 52
06 5 6
P, • •
using
the following questions
 contcxt-S14itca- bet a·een 1'nl-
ICP C s";tchin2 from Procei
t::? , \\.r itc th cp sc ud oc od cf or ~~
consumer lem . BYffcr- ~ -
t 3 , Consider the processing and its
arri
uh !~ predict the scheduling scheme \ &I . . _
llJT.e ll'\t :n an tbc · S
I
I " tic b gi\·es lo"' est a\'erage tu rn ar o=
~SJF n1 FCTS ,

I
I
Process Arri \'al Processing
Ti: ne T ime
I A I o I 3
B I 1 6
C .; 4
D 6 ,
I t"' In
a s~~cm "'i th t\\ O [Link] Pl and
f'C50crccs R l and R1, the followi ng
Pl and two
sitwrioo [Link]:
s

I I• • PI oo:ds RI u:.d req ues ts Rl.

P:! oo:c.s R:? e:r.d req ues ts R I.
Ccr ..str uct tl:e Rcso:.i:rtt Allocation
Graph for the above
sin ution zed check "'[Link] deadlock
bas occurred. If a
ce.!dlodc is c!e10..1cd. St!l! Ccs t a met
I
dcad!ock md j:JS Ufy ~o:Jt ~ er.
hod lO reso lve the

Pa rt- C
Eit bu OR Clao\ce Qu esd ou
lX \0• 10 ~ta ru
15a La us cocsidcr a ~en .mo in "'h ich a process \>\ U'\C
du ng ing d.:a:a m a P3-1icular memo S \
ry location. A\ \\\c
sam e tim e [Link] pro ces s P2 trie
s rea din g dat a fro m the
same mcmo:-y loc ation.
a. ~cntioo the rules to be followed for l'fc .
scr"'\ag
dara comisamc:y.
t,. E,q,lein the classical so lut i~ and syncbl - ~
'O"'
b pCSG"ing data COD51stcnc:Y·

. or· in C\\eri\-
•hi ,4s of a,m mu nic au on
a S:rr/~
wilh seven pcoc
.
 .
~ d) Kernel
I 6 I \\'bat does the term .thr
j . terms'?
a) The amoun1 0 f .
oughput"-;;m;;:::--=.:-:----
ean in scheduling
I b) The number oftune the CPU is idle
1-,-...L
I c) The total . processes com let .
i d) Tb t t~me a process Spen_dp . ed per unit time
.e Ota) time taken fr s in the ~ystcrn
I com Ietion om process submission t
7 Ideotir., th o
') e deadlock handr
Banker's Algorithm mg technique in the
2
, a) Deadlock Prcven~on
b) Deadlock A voidan
c) Dead! ce
ock Detection and Recov
' d) Deadlock [Link] ery
8 \\'hat does interrupt la1cncy refer to
operating systems? m real-time
a) The time taken ti
execution. or a process to complete its
I
b) Tbe_tune
· . of an interrupt to the start
from the amval
oflhe mt~pt senice routine (LSR).
c) 1:"he nm_e from the completion of an interrupt
sen,ce r~ullne (JSR) to the start of the next interrupt.
d) The ~1me from_ the arrival of an intcrrupt to the
comoletton of the mtcrruot senice routine (ISR).
9 Deadlock detection algorithms differ from deadlock \
prevention algorithms in that they
----
a) Pre\1ent deadlocks from occurring in the first place.
b) A void deadlocks by pre-allocating resources.
c) Detect and recover from deadlocks after they
occur.
d) Use oriority schedulinl! to avoid resource conflicts.
JO \Vhich statement is true about the non-preemptive \
scheduling algorithm?
a) Resources are allocated to a process for a limited
time
b) Process can be interrupted in between
c)High Priority process frequently arrives in the ready
Queue
d)Process holds the resources till it completes ,ts
burst time or S\\~tches to \Vait state \
'ln1: •J1

-~H~'H m: II Vtar / Ill !,,m

·--
fount [Link] & 1111.· 21t .. r ·2o2J
. 0 . ~,.,,.z. ,..,_
~

C~Kuw Arllc11l111,,n Marrh. (to ,w

s •. ( 'ou;;; . wt l'f) . l'O
I 2
PO ro PO ,0
3
" 5
' 7
• PO ' IOI I IOI I
f t I

- -33
(.'(J2 - 3
3
2
3
2 i •
COJ -3
2 J

3 3 2 l
CCJ4 3 3 3 2 I .J
cos 3 2 3 2 .J
J

Part - A JO x I = JO /\f1rb
Q. I a1fnlcrio1tt: Aa:111 tr a\
No Questions .,,ans ,BL /
___
Program
,_ is · - - - t.'Tltity stored on disk and process is LJ
'
a) passive, active
b) active, passive
c) passive, passive
I
d active active
2 A process can be
----
D) both single-threaded and multithrcadcd
b) multithrcadcd
c) single-threaded
d stack
3 - - Scheduler reduces the degree of \
multiprogramming
a) Mid- Term Scheduler
b) CPU Scheduler
c) Short Term Scheduler
Lon Tam Scheduler
Which of the following two operations are provided
the lPC facility?
· & delete message
& receive message
a delete message
n,ceive messa e .
tecps 1fack of pending and b\oc'led b,t
each process's context.
 SRM Institute of Science and Technology
College of Engineering and Technology I SETB I
School of Computing
SRM Nagnr, Kattankulathur - 603203, Chcngalpattu District, Tamilnadu
Academic Year: 2023-24 (ODD)

Test: FJI Date: 07.08.2024

Course Code & Title: 21CSC202J - Operating Systems Duration: 50 Minutes
Year & Sem: 11 Year I Ill Sem Mn. Marks: 25

Course Articulation Matrix: to be laced

[Link] Course POI PO2 PO3 PO4 POS PO6 PO7 P08 P09 POJ0 POI I POil PSOJ PS02 PSO3
Outcome
I COi 3 3 2 2 3
2 CO2 3 3 3 2 3
3 C03 3 3 3 2 3
4 CO4 3 3 3 2 3
5 cos 3 2 3 2 3

PARTB
2 x IO = 20 Marks
Either OR Choice uestions 6 OR 7 8 OR 9
10 L3 1 2 2.6.2
Write a note on Monolithic, Layered and microkemel OS structure and
discuss ros and cons for the same.
OR
10 L3 1 2 2.6.4
As a systems architect, how would you approach designing the operating
system environment for various applications and use cases? What factors
would you consider when selecting and configuring the appropriate
computing environment to meet the specific needs of each scenario?
As a systems analyst working on a project to enhance the functionality of a 10 L3 1 2 2.6.1
computer system, how would you approach designing and implementing various
software components? What types of system programs would you select for
different needs within this ro· ect and how would ou ex lain their suitabilit
OR
Discuss, with examples, how the problem of maintaining coherence of cached 10 L2 1 2 2.6.3 I
data manifests itself in the following processing environments:

a. Single-processor systems

b. Multiprocessor systems

Coune Outcome (CO) and Bloom'• level (BL) Covera1e ID Quntion,

COCcMIICll"l BL Coverqe I")

.. •
• •
■ ILi
• •a>
• IIU

• •••
•
. Ill cm 1111 aa

Approved b)' tile Audit Profeaor/Coune Coordinator

 SRM Institute of Science and Technology
College of Engineering and Technology
School of Computing
SRM Nagar, Kattanlculathur- 603203, Chcngalpattu District, Tamilnadu
[Link] Year: 2023-24 (ODD)

Test: FJI Date: 07.08.2024

Cou rse Cod e & Title: 21CSC202J • Operating Systems Duration : 50 Minutes
Year & Sem: IJ Year / IJJ Sem Mu. Marks: 25

Course Articul ation M a trix: robe laced

[Link] C ourse POI POl POJ PO4 POS PO6 P07 PO8 P09 POI0 POii POl2 PSOI PSOJ PSOJ
Outcome
CO i 3 3 2 2 3
2 CO2 3 3 3 2 3
3 CO3 3 3 3 2 3
4 C04 3 3 3 2 3
5 cos 3 2 3 2 3

PARTB
2 x 10 = 20 Marks
Either OR Choice uestions 6 OR 7, 8 OR 9
I) Describe in detail the various services provided by an operating system, 10 L2 l
explaining how each service contributes to the overall functionality and
erformance of the s stem.
OR
2) Imagine that you are a software developer working on the project to 10
design a new Operating system. You need to satisfy the following
requirements ofloosely coupled system, changes in one component do not
affect another component and successfull y run in computer networks and
web applications. Identify the suitable operating structure for these
requirements and justify it.

8 Describe the client- server and peer-to-peer models of distributed systems.

OR
9 Identify and explain the type of system call and give an equivalent
system caU for Unix operating system.
a) SetFileSecurityO
b) GetCurrentProcessIDO
c) ReadFileO
d SetConsoleMod

Cou rse Outcome (CO) and Bloom's level (BL)

coea.e,a,el\J

•
 SRM l mlhulc ofl>clnm and Tc<hnolOI)
(S)SRM
... __ ,..,._,,_,
Collet< or Entln«rinl and Ttthnolol)
School of Compulln~
~ " , li,lf \:......,~ t,,\:c,, " " " " ~ DriMws r......-.i
~ \ .-,r.: 1&!..\.H tOOhl

r-,..... u.-1uu1
1 f'l' t.' l \ Tl ._._2......
( ,..nc l * ' - 1~\f" !IIV !tU ·Otent--C , u a.- \ht.. \lt.1\1: jO
, ... , ,_ ..,.._ n \n, 111,.,_

" ~,,...
t-
...._ '
"-"~M&I.. \blf1, . , - M
I'() I'"
,., ..
l'O
• •
I'()
~
• , •
I'() I'()

• • '°'
PO

' '
Iro• "" '
POI
I
,so l'50
l

• , : " '~
•- I • '• •
(t,)I ) . l l
I• J I J l J
nn.
, , -.' ,~
'
\

• ..
( "01
~ ) l
)
I 1
:
-- -
J :
) I
J

- • (Oi l 1 J

A11.,wer A11y Fiw! q11esril111s S X 10.,.S0marks

to•

\ - ~ I ll••• 'lftC ,r.,t. A f\ {'_ 0 ... t fltq, •ffh ..-..l .. IWTnat ,_,, n
..,1,-,., I I • t. aN.1 I, t toc, M \ ( N...._.I ,__... 1.0 ff ,,t U.U . . )
..,Ml,,-. t~""l'."-11,.lt 1hr.")' I.I\~ lltat pv,nt,,
a, 1.' I J Nit \ ~ f t , 11t1111l I
I'\ - 0 11rt..;1tw~•"'ff ""') l('f~•N•tw-~Wo#loc.,_-dMillr_..,...... ._.....
""' ....,.,_,_a ,.._1,.,J -,11,-.;: llfltt I'll ,., 1111 ,.,.«."" liat"ff 1W __, ~ " "
l!IIIL', i,,."'...._,.\~tli,;.- .l \.lttlllNl "'" h • ~ r . ..... , ......... ,,cn#_.
~1-.·

I ,_...._"' """' Pr , .... tt# I IM(' ~ " ' " r1 wd Pl T\ic ,,,.. ,.... 11w 11......- ,_
ri ..:• .,,,... " ' ,n""' 100 ~,.,rl) n.- ~ ....-n .rri .., , 1 [Link] » -.t
"'1" r,1.1,1.t-, l h. , .,_,_. a.n, tt [Link]: ptt,r.,_.. ...._., ~ .,_., m
"-N ,,,, ... ;..r:i....~ "" \,[Link] t,1111:, . , , ~

\ ell('(~ .I'd flil'("tC I ~ lllrae' c,,Kntn C. hit -.:lwditl:W .......... ~

,~llflt~"
11.!lf J<tdl•~
...... ~ ••lc'!Wtlhbc:~-
..
t, \pc-1
~ aa -«t llltW .....,_ I(
'"""-' •[Link]._,., tlw
_.....,.,...11..... l l t ~
at
~ 1"-'
w.. •
(__.,, , IJW"" .. ,-,itt.t~... [Link]"'.aPI P'l. r 1.l'l-4'1_,lrn Jl)JICI
Nt,

fll ".,_·"'••~AO ..a f' &di_....< 1);,t:' ' - t • _, 1 ttq'.'«'I~

A,,.... tl • ,tl'C lk~•..l • i a - . , c d ~ -.-..-.:c+> NM· .C-tkrroco,n
.. Jt•• ~al- ff1l(JWQ ~ - H " " ' " ' '
;\"-, • "'• Ir"~ ·• • l'I ~ PJ ..........,
J
 l ll
oo:
..._.,. 1 l"'l'cw,."',v r•~"'•s~•~'
,sr

.., ,.t,,t-1(

'"'
"I
r ftJ Ille ul.c ~ •hew~ lliit1)""" dPit'\""" Ind IO• dadik_1, o&liflC:

[Link]- t'nc ~
9N :~ ~u [Link]:c
PM'\,__,"'" l:O ..S "° ~8. t.!4 [Link].
aw t,,,:A,•~ pm(cun Pl P1 "'"' _. r-,. ..,,._,. [Link]
'°' ._O 4 JO ~8

.. ,~t-tc 1 - - " ) P"'''...._ 1he ,Wfl " ' " " fft<na,r, ttt u• tr..D. :ua::n '"" tr,,.H
tnll""' ,n ,tlN(1 ~ct, rv,,,,,..1~ .~-..M•t11......., •"'I
a, l •vl,t ·'"t·"....,.
I
t- tt..,r t ,i .\li""''"-
4"1 "t,1;l1tAlr'l.a+.-

..,...,..
( ••4' I~ Jlt'tJ .-1..,MN aC l.)1-Jrf.,a"'11.~ 6" J,,A...,"".,1,_ t.;.;cu I
tt.-..i ..na ()1.-.irf,-,ho,

I '
.,
' I

•• ,,.
••
., ",..
••
Tlic'i&.,)._.,;\c.1,,lfy~{ ',(A, M~•W"'•.... "-'...,...,--.i,~,,_CII
J,U. a.:, 1. ,l1&,,lll A eel 11-; t .A"' °'i;.....,,_ •1111 P"'f"-.~.: """,..._ I )
lie "'-•.r,.t 1.6 tt ~,N H"-H • '"". ,. ~
Chrd •
._.,_,.,....,,,
:ci•itt
)
I
1,j ...... INC'"'•• 1,.._,.___,_,.,..,.w..J_.~ .... ..,_
IUMfltl' '--'> >""' ..... "
I
• Gt1r11,-ptt~•llli.
I J)J I t J.}J I lt.7Jl I U
J 7
'A't«• ..,,..,. .. llllf...,,. ~ . . . . .Jii.1111-a......J-II..
1
- - -- --
 . ~~~==:~
6
- ! i r (i(ii) cc'aon,~,~•d~•~r-;;.-;:..,~...
:;;;;;
.,,:;;O~w
:iti.i;;;"'C:6611<[Link];;i
'-' -[Link]~ rl'\>ffl • d1.)k -.i 1h ro11-..f rdata •hoiAd - -
;..SplncHe l•~lfA - - IMency ;,. ...,.,.,n, pa,tarnc:tco.
1 1
'4.200 j1.,. - -
·~ - - :~5.56
;;;-- - - - l
I tnoo ~ 7
110000 - t= -
~ - 12 -
Disk RPM - 1200 3
A vcmgc seek lfme; 5ms
Tmnsrc, ro1c: I OB/sec
Con1rollcr ovcmco<1: 0. I.,,_,
Calculnrc 1hc avcriayc drsk access time.

ii. Rend nnd wrhc •re lhc t"''O opcra110ns iha can be pcrfonnc,s
1
frcquen1ly o;'cr 1'1<, life do1a. Consider we need 10 >ynchronitc
these opcra11ons 10 h•vc data consirtcocy. Explain how 1hc
7 nllribu1c ""file o n count~ hcl in achicvin lhc """'·
There an: lhn:e l)'pe., of life acec,,.s methods. They an:
comi11uou.,. linked and indexed aecc,:,. A..umc • Jile is
currcnlly consl,1ing of I SO blocks. All the de1a1ls n:l1,1cd to lilc
con1rol opcrn1ion urc slorcd in lhc memory. Calculo1c how
I
m11ny dis k n:ad/wri1c opcrn1ions ore required for con1111uous.
linked, ond indexed (single-level) alloca1ion •tralegics. A.,sun,c
, 1h01 in the. cnse of con11suou-J-all«alion. 1hcrc i~ no way 10
grow(ndd) a1 lhc bcginnini,: bu1 We can cxlcnd(Add} al lhc cnd. 4 3
I Also llK<ume 1h01 the block lnforma1ion lo be a<l_dcd ts slorcd in
memory.
a. Add a block in lhc bcgrnning
b. Addo block in lhe middle
c. Add a block al lhc end.
d. [Link]!)O)'.~ a. bl~Jc ff'2m !hc_bcJ!i!!.'1!n&.i.,' __________._
Course Ourc:ome (CO) and Bloom's level (BL) Coverqe In Questions
co~ (l)\l(llA(i[ !HO'J!IV,G( "
.,
,.••
• ~ n•
II .7 .,, • '"'
·•·
•II\

,proved by. 'he Audit Proressor/Coum Coordinator