Question 1

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

Accepted Answer

In a relocatable dynamic partition scheme, the relocation register 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. The bounds register specifies the legal range of memory addresses that a program can access, the load register contains the starting address of a program in memory, and the compaction register is not a relevant concept in this context.

Question 2

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

Accepted Answer

All four memory management techniques require that the entire program being executed must be loaded into memory. This is necessary for the program to be able to execute its instructions and for the operating system to manage memory effectively.

Question 3

____ consists of fragments of free memory between blocks of allocated memory.
A) An inefficient fit
B) Indirect partitioning
C) External fragmentation
D) Internal fragmentation

Accepted Answer

External fragmentation occurs when there are small blocks of unused memory spaces between chunks of allocated memory, making it difficult to utilize these spaces efficiently for new allocations.

Question 4

____ of memory is performed by the operating system to reclaim fragmented sections of the memory space.
A) Deallocation
B) Redirection
C) Compaction
D) Reallocation

Accepted Answer

Compaction is the process of reallocating memory and grouping together the free memory in order to create larger blocks of contiguous memory. This helps to reduce fragmentation and increase the amount of available memory.

Question 5

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

Accepted Answer

The fixed-partition memory management scheme requires keeping track of partition size, memory address, access, and status for each job in the table. This information is crucial for properly managing and allocating memory to each job.

Question 6

Main memory is also known as ____.
A) single-user memory
B) random access memory
C) finite memory
D) virtual memory

Accepted Answer

Main memory is also known as random access memory (RAM), as it allows the computer to access any address in the memory directly, without having to access the preceding memory locations first. The other options are not correct; single-user memory is not a commonly used term, finite memory implies a limited capacity which may not be the case with main memory, and virtual memory is a separate concept altogether, which refers to using hard disk space as an extension of RAM when the latter is full.

Question 7

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

Accepted Answer

The best-fit algorithm is designed to find the smallest memory block that can accommodate a job, making it the most efficient algorithm since it minimizes memory waste.

Question 8

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

Accepted Answer

Compacting and relocating require additional overhead to manage and maintain the memory allocation table and to perform the necessary operations. The other options (null entries, segmentation, main memory) are not directly related to the additional overhead required by this scheme.

Question 9

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

Accepted Answer

The first-fit memory allocation method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory. It satisfies the allocation request by searching the free list starting at the beginning, looking for the first block that is big enough to fulfill the request. Thus, the answer is option B.

Question 10

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

Accepted Answer

Relocatable dynamic partitions allow for memory allocation to be more flexible by dynamically adjusting the size of partitions based on the size of the program being loaded. This helps to minimize fragmentation and increase efficiency. Deallocation, best-fit algorithms, and null entry accounting do not directly address the fragmentation issue in the same way as relocatable dynamic partitions.

Question 11

One approach to performing compaction is to do it when a certain ____ of memory becomes busy.
A) byte
B) percentage
C) bit
D) area

Accepted Answer

Compaction involves rearranging and consolidating memory to reduce fragmentation and improve memory utilization. It is most efficient to perform compaction when a certain percentage of the memory becomes busy to minimize the impact on the running programs. This allows the compaction process to move only the necessary data and avoid unnecessary data movement that can cause performance issues.

Question 12

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

Accepted Answer

The bounds register keeps track of the range of memory locations that a program has access to, thus preventing it from accessing memory locations that don't belong to it. The relocation register is used to adjust memory addresses when a program is loaded into a different memory location. The load register is used to store the next instruction that will be executed. The compaction register is not a commonly used term in the context of memory management.

Question 13

Memory compaction is also referred to as ____.
A) defragmentation
B) collection
C) reallocation
D) dynamic allocation

Accepted Answer

Memory compaction involves rearranging memory to remove fragmentation, which is analogous to defragmentation of a hard drive. The other choices are not directly related to memory compaction.

Question 14

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

Accepted Answer

The answer of A(n)____ in the busy list occurs when...

Question 15

Fixed partitions are also called ____ partitions.
A) complete
B) static
C) direct
D) sized

Accepted Answer

Fixed partitions are referred to as static partitions because the size of each partition is fixed and cannot be changed dynamically.

Question 16

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

Accepted Answer

The operating system can determine the function of each group of digits in an instruction based on their location in the line and the operation code, as different positions are designated for specific purposes such as operation codes, operands, etc.

Question 17

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

Accepted Answer

The fixed partition scheme is designed to work well when all jobs are of similar size. This is because each partition is dedicated to a specific size range and cannot accommodate larger or smaller jobs. If jobs have different sizes or their sizes are not known in advance, a dynamic partition scheme may be more appropriate. All jobs being under 100K is not a determining factor for the fixed partition scheme.

Question 18

In a single-user system,jobs are processed ____.
A) sequentially
B) intermittently
C) randomly
D) in order of longest job to shortest job

Accepted Answer

In a single-user system, jobs are processed sequentially, meaning that they are executed one at a time, in the order that they are received. The computer must complete each task before moving on to the next one. Therefore, option A is the best choice.

Question 19

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

Accepted Answer

The phenomenon of less-than-complete use of memory space in a fixed partition is called internal fragmentation. Option A is incorrect because dynamic fragmentation refers to the situation where the free memory is broken into smaller fragments, making it difficult to allocate larger memory requests. Option C is incorrect because external fragmentation occurs when there are enough free memory spaces available, but they are not contiguous, making it difficult to accommodate larger memory requests. Option D is incorrect because fixed fragmentation is not a known term in computer science.

Question 20

The release of memory space by the Memory Manager is called ____.
A) fragmentation
B) relocation
C) free memory
D) deallocation

Accepted Answer

Deallocation refers to the release of memory space by the Memory Manager. Fragmentation refers to the splitting up of memory into small, unusable chunks. Relocation refers to the process of moving a program from one memory location to another. Free memory simply refers to memory that is not currently being used, and does not necessarily imply that it has been released by the Memory Manager.

Quiz 2: Memory Management: Simple Systems

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.

The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ____.

____ consists of fragments of free memory between blocks of allocated memory.

____ of memory is performed by the operating system to reclaim fragmented sections of the memory space.

In the fixed-partition memory management scheme,the table that the Memory Manager uses to keep track of jobs is composed of the ____.

Main memory is also known as ____.

The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.

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.

The ____ method keeps the free/busy lists organized by memory locations,from low-order memory to high-order memory.

Single-user,fixed partition,and dynamic partition memory schemes share unacceptable fragmentation characteristics that were resolved with the development of ____.

One approach to performing compaction is to do it when a certain ____ of memory becomes busy.

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.

Memory compaction is also referred to as ____.

A(n) ____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

Fixed partitions are also called ____ 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.

The fixed partition scheme works well when ____.

In a single-user system,jobs are processed ____.

The phenomenon of less-than-complete use of memory space in a fixed partition is called ____.

The release of memory space by the Memory Manager is called ____.