GATE - 2007 | OS | Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These

GATE - 2007 | OS | Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These
Posted on 16-02-2022

GATE - 2007 [Operating System]

Question:

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.  

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

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

A

16

B

19

C

20

D

37

      

Solution:

Option (B) is Correct.

At t = 0
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


At t = 8
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


At t = 10

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

At t = 11

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

J7 can be finished at t = 19.

Thank You

Download App for Free PDF Download

GovtVacancy.Net Android App: Download

government vacancy govt job sarkari naukri android application google play store https://play.google.com/store/apps/details?id=xyz.appmaker.juptmh