The following algorithm can be described as ____. 1 Set counter to 1
2 Do while counter <= number of blocks in memory
If job_size > memory_size(counter)
Then counter = counter + 1
Else
Load job into memory_size(counter)
Adjust free/busy memory lists
Go to step 4
End do
3 Put job in waiting queue
4 Go fetch next job

Question

The following algorithm can be described as ____. 1 Set counter to 1
2 Do while counter <= number of blocks in memory
If job_size > memory_size(counter)
Then counter = counter + 1
Else
Load job into memory_size(counter)
Adjust free/busy memory lists
Go to step 4
End do
3 Put job in waiting queue
4 Go fetch next job
A) first-fit memory allocation
B) best-fit memory allocation
C) least-fit memory allocation
D) fixed partition memory allocation

Quizplus · Accepted Answer

This algorithm is describing the first-fit memory allocation method, where the first available block of memory that is large enough to hold a job is allocated.

The Following Algorithm Can Be Described as ____