Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These blocks are…

PYQ GATE 2007

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.

Request No

J1

J2

J3

J4

J5

J6

J7

J8

Request Sizes

2k

14k

3k

6k

6k

10k

7k

20k

Usage Time

4

10

2

8

4

1

8

6

The time at which the request for J7 will be completed will be

  1. A.

    16

  2. B.

    19

  3. C.

    20

  4. D.

    37

Attempted by 198 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…