Reference no: EM133300621
Questions
1. In a binary buddy allocator, a request for 129KiB of memory will be fulfilled by allocating what amount of memory?
A. Exactly 129KiB
B. 129KiB + a small amount of accounting overhead
C. 128KiB
D. 256KiB
E. 129KiB is not a valid amount of memory to allocate with a binary buddy allocator
2. True or False: If a system uses a slab allocator, it can also use a binary buddy allocator.
3. In single-level paging, how is the entry within the page table for a given address found?
A. By using the page number directly as an index to offset within the array of the page table
B. By dividing the page number by the page table entry size
C. By multiplying the page number by the page table entry size and using that as the address
D. By looking the page number in the segment table
E. By scanning the page directory for a matching entry
5. What is the main problem with using contiguous memory allocation with variably sized partitions in a system?
A. Message passing is not possible with such a system
B. Discontinuous memory holes can be created that prevent processes from being able to start, even though there is sufficient free memory
C. Processes take up more memory space because they have to keep track of page tables
D. Internal fragmentation
E. Process execution speed is lower than using a segmentation-based scheme
6. Which of the following are benefits of dynamic loading? (Select all that apply)
A. Less memory used
B. Entire program doesn't need to be resident in memory to start the process
C. Process execution speed increases once initial loading has completed
D. Code to handle infrequently used cases need not be loaded from disk unless called upon
E. Process execution can begin quicker