Term
| Absolute code can be generated for ___. |
|
Definition
|
|
Term
| Which of the following methods of binding instructions and data to memory is performed by most general-purpose operation systems? |
|
Definition
|
|
Term
| An address generated by a CPU is referred to as a _____. |
|
Definition
|
|
Term
| Suppose we are operating with execution-time binding and the physical address generated is 300. The relocation register is set to 100. What is the corresponding logical address? |
|
Definition
|
|
Term
| In a dynamically linked library ____. |
|
Definition
| more disk space is used than the option of using a statically-linked library |
|
|
Term
| Which of the following binding schemes facilitates swapping? |
|
Definition
|
|
Term
| The roll out, roll in variant of swapping is used ____. |
|
Definition
| for priority-based scheduling algorithms |
|
|
Term
| Which of the following dynamic storage-allocation algorithms results in the smallest leftover hole in memory? |
|
Definition
|
|
Term
| Which of the following is true of compaction? |
|
Definition
| It is possible only if relocation is dynamic and done at execution |
|
|
Term
| A(n) ____ page table has one page entry for each real page (or frame) of memory. |
|
Definition
|
|
Term
| A relocation register is used to check for invalid memory addresses generated by a CPU. (T/F) |
|
Definition
|
|
Term
| Pure code cannot be shared. (T/F) |
|
Definition
|
|
Term
| In current systems, pages are typically between 4 KB and 8 KB in size. (T/F) |
|
Definition
|
|
Term
| Hierarchical page tables are appropriate for 64-bit architectures. (T/F) |
|
Definition
|
|
Term
| The Linux operating system does not rely on segmentation and uses it mininmally. (T/F) |
|
Definition
|
|
Term
| Which of the following is a benefit of allowing a program that is only partially in memory to execute? |
|
Definition
|
|
Term
| In systems that support virtual memory ___. |
|
Definition
| physical memory is separated from logical memory |
|
|
Term
| The vfork() system call in UNIX ___. |
|
Definition
| allows the child process to use the address space of the parent |
|
|
Term
| Suppose we have the following accesses: 1 2 3 4 2 3 4 1 2 1 1. Suppose that there are also three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the exectuion of the given |
|
Definition
|
|
Term
| Belady's Anomaly states that ____. |
|
Definition
| for some page replacement algorithms, the page-fault rate may increase as the number of allocated frames increases |
|
|
Term
| Optimal page replacement ____. |
|
Definition
| is used mostly for comparison with other page-replacement schemes |
|
|
Term
| Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 and a system with three page frames, what is the final configuration of the three frames after the true LRU algorithm is applied? |
|
Definition
|
|
Term
| In the enhanced second chance algorithm, which of the following oredered pairs represents a page that would be the best choice for replacement? |
|
Definition
|
|
Term
| The ____ allocation algorithm allocates available memory to each process according to its size. |
|
Definition
|
|
Term
| The ____ is the number of entries in the TLB multiplied by the page size. |
|
Definition
|
|
Term
| Virtual memory decreases the degree of multiprogramming in a system. (T/F) |
|
Definition
|
|
Term
| Stack algorithms can never exhibit Belady's anomaly. (T/F) |
|
Definition
|
|
Term
| Windows XP implements virtual memory using demand paging with clustering. (T/F) |
|
Definition
|
|
