• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | Gate IT 2007 | Question 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 shown below.
2007_11
The time at which the request for J7 will be completed will be

(A)

16

(B)

19

(C)

20

(D)

37

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments