INT-1700 Study Guide 1 (Multiple Choice)
The ____ demonstrates that when using a FIFO policy, in rare cases, adding more memory to a system can cause an increase in page interrupts.
Belady Anomaly
____ means that several logical records are grouped within one physical record.
Blocking
____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.
Cache memory
______ is the practice of using Internet-connected resources to perform processing, storage, or other operations.
Cloud computing
____ of memory is performed by the operating system to reclaim fragmented sections of the memory space.
Compaction
The ___ uniquely identifies each resource, starts its operation, monitors its progress, and, finally, deallocates it, making the operating system available to the next waiting process.
Device Manager
_____ consists of fragments of free memory between blocks of allocated memory.
External fragmentation
The ____ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest.
FIFO
In a paged memory allocation scheme, the ___ contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.
Job Table
____ is where the data and instructions of a computer must reside to be processed.
Main memory
In a paged memory allocation scheme, a simple ____ has one entry for each page frame that shows its location and its free/busy status.
Memory Map Table
A ___ chip holds software that is used to start the computer
ROM
______ systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit.
Real-time
The ___ is often very different from one operating system to the next, sometimes even between different versions of the same operating system.
User Interface
____ effectively removes restrictions on maximum program size.
Virtual memory
___ allows separate partitions of a single server to support different operating systems.
Virtualization
The fixed partition scheme works well when _____.
all jobs are of similar size
A hybrid system is a combination of ____ systems.
batch and interactive
The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.
best-fit
The purpose of cache memory is to keep handy the most recently accessed data and instructions so that the CPU can access them repeatedly without wasting time. This purpose is similar to that of the ____ of a Web browser.
bookmark file
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.
bounds register
A variation of the LRU page replacement algorithm known as the ___ replacement policy is implemented with a circular queue.
clock page
Starting in the 1950s, to reduce the discrepancy in speed between the I/O and the CPU, an interface called the ____ was placed between them to act as a buffer.
control unit
The release of memory space by the Memory Manager is called _____
deallocation
Memory compaction is also referred to as ______/
defragmentation
Each peripheral device has its own software, called a(n) _____, which contains the detailed instructions required to start the device, allocate it to a job, use the device correctly, and deallocate it when it's appropriate.
device driver
With ___ operating systems, users can think they are working with a system using one processor, when in fact they are connected to a cluster of many processors working closely together.
distributed
A disadvantage of segmented memory allocation is ____.
external fragmentation
The word ____ is used to indicate that a program is permanentlly held in ROM (read only memory), as opposed to being held in secondary storage.
firmware
The ___ method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory.
first-fit memory allocation
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.
function
There are two types of real-time systems depending on the consequences of missing the deadline. A ____ real-time system risks total system failure if the predicted time deadline is missed.
hard
The phenomenon of less-than-complete use of memory space in a fixed partition is called ________
internal fragmentation
The most common mechanism for implementing multiprogramming was the introduction of the ____ concept, whereby the CPU was notified of events needing operating systems services.
interrupt
The name for the core portion of an operating system is the ______.
kernel
The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ____
loaded into memory
The term ____ means that during any phase of its execution, a program
locality of reference
The primary advantage of storing programs in noncontigouous locations is that ____
main memory is used more efficently
With the development of ___ technology, a single chip was a equipped with two or more processors cores.
multicore
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
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.
overhead
In the fixed-partition memory management scheme, the table that the Memory Manager uses to keep track of jobs is composed of the _____.
partition size, memory address, access, and status
One approach to performing compaction is to do it when a certain ___ of memory becomes busy.
percentage
Main memory is also known as ____.
random access memory
Single-user, fixed partition, and dynamic partition memory schemes share unacceptable fragmentation characteristics that were resolved with the development of ____
relocatable dynamic partitions
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.
relocation register
With segmented memory allocation, each job is divided into several ____ of different sizes, one for each module that contains pieces that perform related functions.
segments
In a single-user system, jobs are processed _____.
sequentially
Cache memory is divided into blocks of equal size called ____.
slots
Fixed partitions are also called _____ partitions.
static
In demand paging schemes, the ____ in a Page Map Table indicates whether the page is currently in memory.
status bit
In demand paging, pages are ____ between main memory and secondary storage.
swapped
To access a location in memory when using segmented memory management, the address is composed of two entries: ____.
the segment number and the displacement
In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ____
thrashing
The efficiency of a batch system is measured in _____, which is the number of jobs completed in a given amount of time.
throughput
In active multiprogramming, each program is allowed to use only a preset amount of CPU time before it is interrupted so another job can begin its execution. The interrupted job resumes execution at some later time. This idea is called _________.
time slicing
In a paged memory allocation scheme, a page size that is too small will generate ____
very long Page Map Tables
A system with ____ divides programs into parts and keep them in secondary storage, bringing each part into memory only as it is needed.
virtual memory
One of the most important innovations of demand paging is that it makes ___ feasible.
virtual memory
In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the _______
working set
