Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a queue as shown below.
The time at which the request for J7 will be completed will be
A |
16 |
B |
19 |
C |
20 |
D |
37 |
At t = 0
At t = 8
At t = 10
At t = 11
J7 can be finished at t = 19.