1142 progress graphs a progress graph models the

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: oup, only one statement is true. Your task is to indicate the statement that is true. 1. (a) In a buddy system, up to 50% of the space can be wasted due to internal fragmentation. (b) The first-fit memory allocation algorithm is slower than the best-fit algorithm (on average). (c) Deallocation using boundary tags is fast only when the list of free blocks is ordered according to increasing memory addresses. (d) The buddy system suffers from internal fragmentation, but not from external fragmentation. 2. (a) Using the first-fit algorithm on a free list that is ordered according to decreasing block sizes results in low performance for allocations, but avoids external fragmentation. (b) For the best-fit method, the list of free blocks should be ordered according to increasing memory addresses. (c) The best-fit method chooses the largest free block into which the requested segment fits. (d) Using the first-fit algorithm on a free list that is ordered according to increasing block sizes is...
View Full Document

This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online