The following,____, describes the first memory allocation scheme.

Each program to be processed was loaded in its entirety into memory and allocated as much contiguous space in memory as it needed

In the algorithm to load a job in a single-user system, the program counter is initially set to ____.

the address of the first memory location

____ is the first step in the algorithm to load a job in a fixed partition.

Determining the job’s requested memory size

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

partition size, memory address, access, and status

____ is how memory is deallocated in a fixed partition scheme.

Memory Manager resets the status of the memory block where the job was stored to “free.”

In a dynamic partition scheme, ____, is how the Memory Manager deallocates a block that is between two other free blocks.

the sizes of the three free partitions must be combined

Help

Options

focusNode

Didn't know it?
click below

Knew it?
click below

Don't Know

Remaining cards (0)

Know

retry

shuffle

restart

0:00

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

Normal Size Small Size show me how

Chapter 2 OSystems

Chapter 2 questions PCOS

Question	Answer
The following,____, describes the first memory allocation scheme.	Each program to be processed was loaded in its entirety into memory and allocated as much contiguous space in memory as it needed
In a single-user system, jobs are processed ____.	sequentially
In the algorithm to load a job in a single-user system, the program counter is initially set to ____.	the address of the first memory location
Fixed partitions are also called ____ partitions.	static
____ is the first step in the algorithm to load a job in a fixed partition.	Determining the job’s requested memory size
In the partition scheme, the table that the Memory Manager uses to keep track of jobs is composed of the ____.	partition size, memory address, access, and status
The fixed partition scheme works well ____.	when jobs have the same size
____ consists of fragments of free memory between blocks of allocated memory.	External fragmentation
The ____ keeps the free/busy lists organized by memory locations, low-order memory to high-order memory.	first-fit memory allocation
____ has the least wasted space and the smallest partition fitting the requirements.	Best-fit memory allocation
____ is how memory is deallocated in a fixed partition scheme.	Memory Manager resets the status of the memory block where the job was stored to “free.”
In a dynamic partition scheme, ____, is how the Memory Manager deallocates a block that is between two other free blocks.	the sizes of the three free partitions must be combined
When memory is deallocated, an entry can be removed from the free list by creating a(n) ____.	null entry
A(n) ____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.	null entry
The ____ of memory, sometimes referred to as garbage collection or defragmentation, is performed by the operating system to reclaim fragmented sections of the memory space.	compaction
The operating system can tell the ____ of each group of digits by its location in the line and the operation code.	function
The ____ contains the value that must be added to each address referenced in the program so it will be able to access the correct memory addresses after relocation.	relocation register
____ is the actual memory address for a job that starts at 18K	18,432
By compacting and relocating, the Memory Manager optimizes the use of memory and thus improves throughput, but an unfortunate side effect is more ____.	overhead
One approach to performing compaction is to do it when a certain ____ of memory becomes busy.	percentage

Created by: 1260298507

"Know" box contains:
Time elapsed:
Retries: