preview

Koko

Satisfactory Essays

Final (Memory Management) Multiple Choice Identify the choice that best completes the statement or answers the question. ____ 1. The following,____, describes the first memory allocation scheme. a.|Each program to be processed was loaded into secondary storage, then swapped into memory in parts| b.|Each program to be processed was partially loaded into memory, then granted more memory as needed| c.|Each program to be processed was allocated a portion of memory and could negotiate with other programs to access more memory| d.|Each program to be processed was loaded in its entirety into memory and allocated as much contiguous space in memory as it needed| ____ 2. In a single-user system, jobs are processed ____. …show more content…

Assume the Memory Manager receives a request for a block of 200. When the best-fit algorithm is used, ____ is the beginning address of the block granted by the Memory Manager. Beginning Address Memory Block Size 4075 105 5225 5 6785 600 7560 20 7600 205 10250 4050 15125 230 24500 1000 a.|6785|c.|10250| b.|7600|d.|15125| ____ 16. ____ is how memory is deallocated in a fixed partition scheme. a.|Memory Manager releases the block and combines it with another free block.| b.|Memory Manager immediately gives memory to another program.| c.|Memory Manager adds block to free list and removes it from busy list.| d.|Memory Manager resets the status of the memory block where the job was stored to “free.”| ____ 17. In a dynamic partition scheme, ____, is how the Memory Manager deallocates a block that is between

Get Access