The main memory condition at time T = 0 and the table mentioning the processes in...

  

Transcribed Image Text:

The main memory condition at time T = 0 and the table mentioning the processes in ready queue along with its respective size is shown below. The figure shows that the partition size which are darkened are being used by some processes, hence cannot be used at this time. 20 50 50 100 a. If the main memory uses fixed size partitioning and the CPU uses first come first serve (FCFS) algorithm, assign the above mentioned processes considering the memory allocation algorithm to be 100 50 75 50 i. First-fit ii. Best-fit iii. Worst-fit 80 30 45 b. Assume, the main memory uses variable size partitioning and the CPU uses shortest job first (SJF) algorithm, assign the processes considering the three memory allocation algorithms mentioned above. Find the total amount of internal and external fragmentation in both the above cases in each of the memory allocation algorithms individually. Process No I Process Size T P1 P2 P3 I I I 11 12 21 I I The main memory condition at time T = 0 and the table mentioning the processes in ready queue along with its respective size is shown below. The figure shows that the partition size which are darkened are being used by some processes, hence cannot be used at this time. 20 50 50 100 a. If the main memory uses fixed size partitioning and the CPU uses first come first serve (FCFS) algorithm, assign the above mentioned processes considering the memory allocation algorithm to be 100 50 75 50 i. First-fit ii. Best-fit iii. Worst-fit 80 30 45 b. Assume, the main memory uses variable size partitioning and the CPU uses shortest job first (SJF) algorithm, assign the processes considering the three memory allocation algorithms mentioned above. Find the total amount of internal and external fragmentation in both the above cases in each of the memory allocation algorithms individually. Process No I Process Size T P1 P2 P3 I I I 11 12 21 I I

Answer rating: 100% (QA)

a Fixed Size Partitioning with FCFS Algorithm i FirstFit Algorithm To assign the processes using the FirstFit algorithm we start from the beginning of the memory and allocate each process to the first ... View the full answer