The Following Algorithm Can Be Described as ____

Multiple Choice

The following algorithm can be described as ____. 1 Initialize memory_block(0) = 99999
2 Compute initial_memory_waste = memory_block(0) - job_size
3 Initialize subscript = 0
4 Set counter to 1
5 Do while counter <= number of blocks in memory
If job_size > memory_size(counter)
Then counter = counter + 1
Else
Memory_waste = memory_size(counter) - job_size
If initial_memory_waste > memory_waste
Then subscript = counter
Initial_memory_waste = memory_waste
Counter = counter + 1
End do
6 If subscript = 0
Then put job in waiting queue
Else
Load job into memory_size(subscript)
Adjust free/busy memory lists
7 Go fetch next job

A) first-fit memory allocation
B) best-fit memory allocation
C) least-fit memory allocation
D) fixed partition memory allocation