3.

First fit: (a) 20Kb (b) 10Kb (c) 18Kb

Best fit: (a) 12Kb (b) 10Kb (c) 9Kb

Worst fit: (a) 20Kb (b) 18Kb (c) 15Kb

Next fit: (a) 20 KB (b) 18Kb (c) 9Kb

3.2

Logical address space contains 64 pages and to represent 64 pages we need 6 bits (2^6=64) and each
page contains 2048 words therefore the offset or "d" parameter can be represented by 11 bits
(2^11=2048). So total number of bits to represent logical address = 6+11=17 bits.

3.3
Suppose a virtual address space of 2^28 words and the page size is 2^12 words. If the virtual address is
1234567 in Hexadecimal, what would be the page number in Hexadecimal: 1234

3.6

Twenty bits are used for the virtual page numbers, leaving 12 over for the offset. This yields a 4K page.
Twenty bits for the virtual page implies 2^20 pages.

3.7

32 – 22(10+12) pages = 10

3.8

a) LRU: Page 1 because is referenced at 265 (Least Recently)

b) FIFO: Page 2 because it is loaded at 110 (First In)

c) NRU: Page 0 because R M = 0 0

d) Second change: Page 0 because it is loaded at 226 and the reference bit is 0.