17268354
Beschreibung
Karteikarten von Tyler Rock, aktualisiert more than 1 year ago
|
Erstellt von Tyler Rock
vor fast 6 Jahre
|
|
| Frage | Antworten |
| Main memory is also known as ____. a. single-user memory b. random access memory c. finite memory d. virtual memory | b. random access memory |
| In a single-user system, jobs are processed ____. a. sequentially b. intermittently c. randomly d. in order of longest job to shortest job | a. sequentially |
| Fixed partitions are also called ____ partitions. a. complete b. static c. direct d. sized | b. static |
| In the fixed-partition memory management scheme, the table that the Memory Manager uses to keep track of jobs is composed of the ____. a. partition size, memory address, and status b. status, access, and memory address c. partition size, status, and access d. partition size, memory address, access, and status | d. partition size, memory address, access, and status |
| The fixed partition scheme works well when ____. a. all jobs are of similar size b. jobs have different sizes c. job sizes are not known in advance d. all jobs are under 100K | a. all jobs are of similar size |
| The phenomenon of less-than-complete use of memory space in a fixed partition is called ____. a. dynamic fragmentation b. internal fragmentation c. external fragmentation d. fixed fragmentation | b. internal fragmentation |
| ____ consists of fragments of free memory between blocks of allocated memory. a. An inefficient fit b. Indirect partitioning c. External fragmentation d. Internal fragmentation | c. External fragmentation |
| The ____ method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory. a. fixed partition allocation b. first-fit memory allocation c. dynamic fit memory allocation d. best-fit memory allocation | b. first-fit memory allocation |
| The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit. a. smallest-fit b. first-fit c. dynamic-fit d. best-fit | d. best-fit |
| The release of memory space by the Memory Manager is called ____. a. fragmentation b. relocation c. free memory d. deallocation | d. deallocation |
| A(n) ____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list. a. blank line b. null entry c. joined entry d. empty entry | b. null entry |
| ____ of memory is performed by the operating system to reclaim fragmented sections of the memory space. a. Deallocation b. Redirection c. Compaction d. Reallocation | c. Compaction |
| Memory compaction is also referred to as ____. a. defragmentation b. collection c. reallocation d. dynamic allocation | a. defragmentation |
| Single-user, fixed partition, and dynamic partition memory schemes share unacceptable fragmentation characteristics that were resolved with the development of ____. a. deallocation b. best-fit algorithms c. relocatable dynamic partitions d. null entry accounting | c. relocatable dynamic partitions |
| When reading an instruction, the operating system can tell the ____ of each group of digits by its location in the line and the operation code. a. function b. value c. order d. assignment | a. function |
| In a relocatable dynamic partition scheme, the ____ ensures that, during execution, a program won’t try to access memory locations that don’t belong to it. a. relocation register b. load register c. compaction register d. bounds register | d. bounds register |
| In a relocatable dynamic partition scheme, the ____ contains a value that must be added to each address referenced in a program so that the system will be able to access the correct memory addresses after relocation. a. bounds register b. load register c. relocation register d. compaction register | c. relocation register |
| By compacting and relocating, the Memory Manager optimizes the use of memory and thus improves throughput. However, it also requires more ____ than the other memory allocation schemes discussed in this chapter. a. null entries b. segmentation c. main memory d. overhead | d. overhead |
| One approach to performing compaction is to do it when a certain ____ of memory becomes busy. a. byte b. percentage c. bit d. area | b. percentage |
| The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ____. a. loaded into memory b. stored on disk c. written in a single language d. relocatable | a. loaded into memory |
Möchten Sie mit GoConqr kostenlos Ihre eigenen Karteikarten erstellen? Mehr erfahren.