Chapter 10, Problem 56E

Program Plan Intro

Given data:

It is given that the partitions are fixed and there is a new job which requires 52 blocks of main memory. Refer the given diagram in the textbook. From that, it is need to show the memory after using each of the following partition selection approaches.

Dynamic-partition technique:

• In this technique, main memory is-divided into single partition and each job is loaded into the partition which is big enough to hold it.
• The size of the partition is dynamic.
• The following three approaches are used to allocates a new program in the main memory in dynamic partition technique,
  • First fit
  • Best fit
  • Worst fit

Explanation of Solution

b. Best fit

• The best fit is the technique in which the program is allocated to the smallest partition which is big enough to hold it.
• When a new program arrives, the smallest partition in the main memory is “empty 52 blocks” which is big enough to hold “52 blocks”, and the new process is allocated in that partition...

Explanation of Solution

c. Worst fit

• The worst fit is the technique in which the program is allocated to the largest partition which is big enough to hold it.
• When a new program arrives, the largest partition in the main memory is “empty 100 blocks” which is big enough to hold “52 blocks”, and there will be remaining 48 blocks which is allocated as empty and it is used by other processes...