In a computer system where the 'best-fit' algorithm is used for allocating…
1998
In a computer system where the 'best-fit' algorithm is used for allocating 'jobs' to 'memory partitions', the following situation was encountered:
When will the 20K job complete?
Note - This question was subjective type.
- A.
8
- B.
18
- C.
11
- D.
None of these
Attempted by 10 students.
Show answer & explanation
Correct answer: D
Correct answer: None of these.
Under best-fit, each job is assigned to the smallest partition that can hold it. With the given job order:
2K partition: 2K job (time 4), then 2K job (time 6).
4K partition: 3K job (time 2).
8K partition: 6K job (time 1), then 6K job (time 4).
20K partition: 14K job (time 10), then 10K job (time 1), then 20K job (time 8).
So the 20K partition is occupied by the 14K job from time 0 to 10, then by the 10K job from time 10 to 11. The 20K job starts at time 11 and runs for 8 units.
Completion time of the 20K job = 11 + 8 = 19.
Since 19 is not one of the numeric options, the correct choice is None of these.