edited by
7,255 views
1 votes
1 votes
Consider five memory partitions of size 100 KB, 500 KB, 200 KB, 450 KB and 600 KB in same order. If sequence of requests for blocks of size 212 KB, 417 KB, 112 KB and 426 KB in same order come, then which of the following algorithm makes the efficient use of memory?

A) BEST FIT

B) FIRST FIT

C) NEXT FIT

D) BOTH NEXT FIT AND BEST FIT RESULTS IN SAME
edited by

1 Answer

0 votes
0 votes
In this if you use dynamic allocation partition then option (d) are correct .

Both next field and best field result are same which gives total 683 space are vacent. so acording to me if there are dynamic allocation partition then answer will be d if it is static then answer will be change.

Related questions

0 votes
0 votes
3 answers
1
2 votes
2 votes
2 answers
3