Job List
| Job Number | Memory Requested |
| J1 | 740K |
| J2 | 500K |
| J3 | 700K |
| Memory Block | Size |
| Block 1 | 650K |
| Block 2 | 850K |
| Block 3 | 700K |
Memory List
| Memory Block | Memory Block Size | Job Number | Job Size | Status | Internal Fragmentation |
| Block 1 | 650 K | Job 2 | 500 K | Busy | 150 K |
| Block 2 | 850 K | Job 1 | 740 K | Busy | 110 K |
| Block 2 | 700 K | Job 3 | 700 K | Busy | 0 |
| Total Available | 2200 K | Total Used: | 1940 K | | 260 K |
a. Use the best-fit algorithm to allocate memory blocks to the three arriving jobs.
b. Use the first-fit algorithm to allocate the memory blocks to the three arriving jobs.
ANSWERS:
Job List
| Job Number | Memory Requested |
| J1 | 700K |
| J2 | 500K |
| J3 | 400K |
| Memory Block | Size |
| Block 1 | 650K |
| Block 2 | 850K |
| Block 3 | 700K |
Memory List
a. Use the best-fit algorithm to allocate the memory blocks to the three arriving jobs.
b. Use the first-fit algorithm to allocate the memory blocks to the three arriving jobs.
ANSWERS:
| Memory Block | Memory Block Size | Job Number | Job Size | Status | Internal Fragmentation |
| Block 1 | | | | | |
| Block 2 | | | | | |
| Block 3 | | | | | |
| Total Available: | | | | | |
