Question: 4. Worst-fit is an allocation algorithm that allocates the largest free block to a new job. It is the opposite of the best-fit algorithm. Using

4. Worst-fit is an allocation algorithm that allocates the largest free block to a new job. It is the opposite of the best-fit algorithm. Using the following configuration with jobs arriving in order (Job A, B, C, D) and with blocks shown in order from low order memory to high order memory:

Job List:

Memory Block List:

Job Number

Memory Requested

Memory Block

Memory Block Size

Job A

44K

Block 1

250K

Job B

220K

Block 2

900K

Job C

670K

Block 3

280K

Job D

64K

Block 4

200K

Block 5

750K

a) Indicate which memory blocks are allocated to each of the arriving jobs.

b) In this chapter we introduced external and internal fragmentation. Explain in your own words which one would be expected in a worst-fit memory allocation scheme

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!