problem 1:
Given memory partition of the 100 KB, 500KB, 300kB, 200KB, and 600 KB (in order), how would each of First-fit, Best-fit, and Worst-fit algorithms place processes of 212KB, 417KB, 112KB, and 426KB (in order)?
problem 2:
Which algorithm creates the most resourceful employ of memory?
problem 3:
Why page are sizes always powers of 2? Consider a paging system with the page table kept in memory.
problem 4:
If memory references acquire 200 nanoseconds, how long does the paged memory reference take?
problem 5:
If we add TLBs, and 75% of all page references are found in TLBs, what is the effective memory reference time? (Suppose finding page table reference in TLB takes zero time if it is there).