Q5

MCQMarks unknown

A computer installation has $1000k$ of main memory. The jobs arrive and finish in the following sequences. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 300k arrives Job 1 finishes Job 4 requiring 120k arrives Job 5 requiring 150k arrives Job 6 requiring 80k arrives

(A)

Draw the memory allocation table using Best Fit and First Fit algorithms.

(B)

Which algorithm performs better for this sequence?

Loading…