Question 1

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 more efficient use of memory by dynamically adjusting partition sizes and reducing fragmentation. This is achieved by allowing programs to be loaded into any available partition of appropriate size, rather than being limited to a specific fixed or dynamic partition. Deallocations and best-fit algorithms are helpful, but relocatable dynamic partitions are a more comprehensive solution to the fragmentation problem. Null entry accounting 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

The four memory management techniques- contiguous memory allocation, non-contiguous memory allocation, paging, and segmentation - all require that the entire program being executed must be loaded into memory in order to be executed.

Question 3

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 works well when all jobs are of similar size, as the partitions can be pre-defined and allocated accordingly. If jobs have different sizes or their sizes are not known in advance, dynamic partitioning schemes may be more suitable. The size of the jobs being under 100K does not necessarily impact the effectiveness of the fixed partition scheme.

Question 4

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

Accepted Answer

Memory compaction is the process of rearranging the memory space in such a way that all the free memory is contiguous and together, allowing for efficient allocation of memory. This process is similar to defragmentation in file systems, as it reorganizes data to reduce fragmentation. Thus, the best answer is A) defragmentation. The other options, collection, reallocation, and dynamic allocation, refer to different memory management techniques but do not specifically relate to memory compaction.

Question 5

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 6

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 in a relocatable dynamic partition scheme ensures that the program can only access memory locations that are within its allocated partition bounds. It prevents the program from attempting to access memory locations that belong to another partition, which could result in a segmentation fault or other errors. The relocation register is used to adjust memory addresses during program execution, the load register is used to load a program into memory, and the compaction register is not a standard term in this context.

Question 7

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

Accepted Answer

The release of memory space by the Memory Manager is commonly referred to as deallocation. This means that the block of memory that was previously allocated to a program or process is now free to be used by other programs or processes. Choice A, fragmentation, refers to the phenomenon where available memory becomes divided into smaller fragments that are too small to be usable by a program. Choice B, relocation, refers to the process of moving a program or process between different locations in memory. Choice C, free memory, is a more general term that can include memory that was never allocated as well as memory that has been deallocated.

Question 8

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 can access the correct memory addresses after relocation. The bounds register is used for memory protection, the load register is used for loading instructions and data into memory, and the compaction register is not a register used in this scheme.

Question 9

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 is usually performed when a certain percentage of memory becomes busy, as opposed to a specific byte, bit, or area. This allows for more flexible and efficient use of memory space.

Question 10

____ 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 rearranging the memory space in order to create a continuous block of available memory. This is done by moving all the allocated memory blocks together and all the free memory blocks together. This helps to avoid fragmentation and makes it easier for the operating system to allocate contiguous blocks of memory when requested by an application.

Question 11

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 one job is processed at a time in the order it was received.

Question 12

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 organizes free/busy lists by memory locations, allocating the first block of memory that is large enough to satisfy a request, thus keeping the list ordered from low to high memory addresses.

Question 13

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 memory allocation algorithm aims to find the smallest available memory block that is closest in size to the size of the job that needs to be allocated. This helps minimize wasted memory space and allows for better overall memory utilization.

Question 14

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

Accepted Answer

Fixed partitions are also known as static partitions because the size and number of partitions are predetermined and cannot be changed dynamically.

Question 15

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

In the fixed-partition memory management scheme, the Memory Manager uses a table to keep track of jobs which typically includes partition size, memory address, access information, and the status of the partition (whether it is free or allocated). Therefore, Option D which includes all four of these attributes is the correct choice.

Question 16

____ 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 17

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). It is a type of computer memory that can be accessed randomly, meaning any byte of memory can be accessed without touching the preceding bytes. The term "random access" refers to the ability to access any memory location directly.

Question 18

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 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

Internal fragmentation occurs when a fixed partition is allocated to a process, but the process does not use all of the space. This results in wasted memory that cannot be used to store other processes or data, hence the term "fragmentation." Dynamic fragmentation generally refers to the fragmentation that occurs in a variable partition scheme, while external fragmentation refers to fragmentation of the memory space available on the whole system, not just within a specific partition. Fixed fragmentation is not a standard term in operating systems.

Question 20

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 compared to other memory allocation schemes because it involves moving blocks of memory around to optimize usage. This moving of memory requires additional processing time and resources, resulting in increased overhead.

Quiz 2: Early Memory Management Systems

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

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

The fixed partition scheme works well when ____.

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.

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.

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

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.

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

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

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

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

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

Fixed partitions are also called ____ partitions.

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

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

Main memory is also known as ____.

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 phenomenon of less-than-complete use of memory space in a fixed partition is called ____.

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.