-56
cashes Opercgsietts on itey Veer mame “Kelty Sent
Problem 1(18) Ture or False
1 assume the value ofthe base and init egies ae 3300 and 120 respective adres 3410 is gal T?¥?
2. Fragmentation doesnot our a paging system. FNC
3. One factor in favors of compaction over swapping is moving data within memory is faster than moving data to dish We
4.4 Git ogial address space in bytes with page sze OF bytes will ave 2°4 entries in he page table. 1r“¢
Concerning the page-fult service time, restaning the process contributes more to service time than swapping in the pass pe
‘With address-space emt
fers, TLB can hold
pairs for different processes at the same time. we
s
6
47 Am general, spatial locality can improve TB performance by increasing TLB hit rate. 1
8. Low CPU utilization must be caused by thrashing, °C
9. A valid bit marks whether a page has been written or not. yt
10, Using the second-shance page replacement algorithm, the leat recently used page can always Pe selected 1
11 Af the page-fault ates low, we can assure thatthe process may allocated less frames than it cumen!y needs. 7
12. Given reference sing. 3212.43 and thes fares within stem, Using LRU replacement algorithm with Pus
can tg re wil for page Bn. Fe, AY ES, F
13. A segment canbe divided into fivedsize pages. [7vt
14a ab giles wih 3 KB page size wilhave 2” cnes ina cretion ag able fat
1S considera oicl adres space of 4.096 pages wih an $-KB page size, mapped ot a py scal memary of 1024 nes
anreey ces event jean 23 is ae reel he sea atts specie #46 7
problem 2(15) Given a process image f 300 yt the page sie of 1 1038), Asam nee ares pest 120 the
ere eam unis oe byte. Physical memon is ge enough. FYE: 1024, 242088), 3KL3072) SK14076)
ain rae te needed forte process? How much memory willbe wasted as intemal ragmemaion?
what ae the page number and offset forthe addres reference 1258?
face fered wd
a ae” Wet
(b) AD . : « Problem 4(15) Paging
‘Thee processes and their memory allocations ae given below. Fill inthe page tables forthe three processes accordingly
Process rage Table Physical memory»
0 ]s
Ti is Tom] 1
» 2 S
ibe 3 ™ oe
| Daal 7
7 :
ey 7 7p
Th : 7 [oar
= j 7
Daas 9 Tite
10] Daa
we 7
; Ie il
The y
‘Datad 1 ibe ut
5
Problem §.(18) SHORT ANSWERS.
Explain Briefly how protection is achieved inthe address translation schemes preset in Figures (and ().
‘rp: asesng err
wr wy
ual aie deed Ty We bd ee ie Te [asl oe Te
We ¥ He i posed acy, dete alld pore: Weed w fonp (adden ae)
cps 6 abel ory
phan dhe sie of the yee, it oat
(yee los a Lon oti, « dee (oti sm) a
athe yet dalle * Pl
QU (ur od ate ears vill she 
