Let a memory have four free blocks 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.
Request No. |
Request sizes |
Usage Time |
J1 |
2k |
4 |
J2 |
14k |
10 |
J3 |
3k |
2 |
J4 |
6k |
8 |
J5 |
6k |
4 |
J6 |
10k |
1 |
J7 |
7k |
8 |
J8 |
20k |
6 |
The time at which the request for J7 will be completed will be