Q.1 Suppose a fixed partitioning memory system with partitions of 100K, 500K, 200K, 300K and 600K (in memory order) exists with all 5 partitions currently unused (or free).

a) Using the best fit algorithm, show the state of memory after processes of 212K, 417K, 112K and 350K (in request order) arrive.

b) Using the best available algorithm, show the state of memory after processes of 212K, 417K, 112K and 350K (in request order) arrive.

c) Compute the total internal fragmentation for part (a), if any.

d) Compute the total external fragmentation for part (b), if any.

Q.2 Differentiate between the concepts of Buffering, Caching and Spooling.

Q.3 Compute the total head movement using FCFS and SSTF algorithms (assuming the head is initially positioned at track 26) for the following disk accesses (in order): 26,37,100,14,88,33,99,12.