Q1. Explain the First fit, best fit and the worst fit allocation algorithms. Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order), how would each of the First-fit, Best-fit and Worst-fit algorithms place processes of 212K, 417K, 112K and 426K (in order)? Name the algorithm which makes the most proficient use of memory?
Q2. Consider a demand-paging system with the given time-measured utilizations:
CPU utilization 20%
Paging disk 97.7%
Other I/O devices 5%
Which (if any) of the given will (probably) enhance CPU utilization? Describe your answer.
a) Install a faster CPU.
b) Install a bigger paging disk.
c) Raise the degree of multiprogramming.
d) Reduce the degree of multiprogramming.
e) Install more main memory.
f) Install a faster hard disk or multiple controllers by multiple hard disks.
g) Add pre-paging to the page fetch algorithms.
h) Enlarge the page size.