Q1) Consider a logical address space of 64 pages of 1024 words each, mapped onto a physical memory of 32 frames.
a. How many bits are there in the logical address?
b. Draw the logical address format.
c. How many bits are there in the physical address?
d. Draw the physical address format.
Q2) Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?
Q3) Assuming a 1-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers):
a. 2375 b. 19366 c. 30000 d. 256 e. 16385