Question

Fill in the table below based on the reference string (RS) shown. The resident set at time 0 is given Algorithm to use is: PFF with t-2 RS 2 35 3 212 3 2 4 3 45 3 P1 P2 )X P3 P4 P5 IN 2 OUT PF 1 Based on the logical adáresses given in problem 1 on the previous page what would that reference string be? 1. Given the following physical addresses and value in memory: Val | 16 | 14 | 12 | 10|36 | 34|32 | 30 | 0|40 | 35 | 30 | 28 | 18 | 24 | 20 | 32 | 0|4018|132 | 24 | 54 add 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 4344454647 val 8403516 14121222244217 19 2123252716 1513 119700 add 48 49551 52 53 54 55 56 5758 5961 62 6364 65 6667 68 69 70 71 val 24 28 32 62 64 32 18 27 25 23 21 19 17 15 13 11 16 72 32 48 80 2 Each page has 16 words. add is the address of memory val is the value at that address The size of the page table is: 6indexed 0 - 5) The m the value imcs tat aeiot curendly present in memory Processes P1 is running. The page table starts at physical address 64. Process P1 references the following logical addresses in the order given in the logical address column below: The Access column is the value at that location. Use ER to indicate a non-existent page. Use PF to indicate a page fault. Fill in the chart logical addresslogical addresspage in offset in binary in decimal 12 15 19 in binary binary access 36 41 45 56 63 76 78 80

Answer 1

Given thok Legica Addboss bA s tbts i-p 1-P J- bits ίο.of enkle s ?n po. Toble : A04 the R ges ?n tte 91:2 6x220.f6 Phys.cod Ackess Space. 64GB age re 14 98 956 29512 2Im

0111 001. ooo cool at owl oni oooo oooo 0011 001-anoooo gt !100 coo oooo, 9g low 0110 con oooo 1020 0100 ooooooo Shi 000 mp oooooooooo í011 0010 0110 coo oooo-o-o looo cooo oooo! oo_o Q100 000 000-98 looo onoam coso 0101 9too coooooool 、000 0100 oooooooo LE t2991 tuya/u. N3 fo@g uo ssem, royollapp doro ya 201