CITF 120 Understanding Operating Systems Concepts Quiz 1

With segmented memory allocation, each job is divided into several ____ of different sizes, one for each module that contains pieces that perform related functions.

Modules

In demand paging schemes, the ____ in a Page Map Table indicates whether the page is currently in memory.

Status bit

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

Indirect partitioning

In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ____.

Thrashing

In a fixed partition scheme, large jobs will need to wait if the large partitions are already booked, and they will be rejected if they're too big to fit into the largest partition.

True

In the 1980s, as a result of multiprocessing techniques, it became possible to execute two programs at the same time in parallel.

True

Memory defragmentation is performed by the operating system to reclaim fragmented space.

True

The Device Manager is responsible for connecting with every device that's available on the system and for choosing the most efficient way to allocate them.

True

The bounds register is used to store the highest (or lowest, depending on the specific system) location in memory accessible by each program.

True

The segmented/demand paged memory allocation scheme is a combination of segmentation and demand paging, and it offers the logical benefits of segmentation, as well as the physical benefits of paging.

True

The ____ is often very different from one operating system to the next, sometimes even between different versions of the same operating system.

User Interface

In a paged memory allocation scheme, a page size that is too small will generate ____.

Very long page map tables

In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____.

Job set

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

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

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

Best-fit algorithms

____ means that several logical records are grouped within one physical record.

Blocking

Paged memory allocation offers the advantage that it doesn't require the entire job to be stored in memory during its execution.

False

The best-fit allocation method keeps the free/busy lists organized by memory locations, low-order memory to high-order memory.

False

The content of a random access memory (RAM) chip is nonvolatile, meaning that it is not erased when the power is turned off.

False

When executing a job, the File Manager determines whether a user request requires that a file be retrieved from storage or whether it is already in memory.

False

When using a FIFO scheme, adding more memory always results in better performance.

False

With segmented memory allocation, each job is divided into several segments of the same size, one for each module containing pieces that perform related functions.

False

Main memory is also known as ____.

Finite memory

____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.

Paging

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

____ is where the data and instructions of a computer must reside to be processed.

Read-only memory

____ systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit.

Real-time

In active multiprogramming schemes, a job can monopolize the CPU for a long time while all other jobs waited.

False

Fixed partitions are also called ____ partitions.

Direct

A single-user system supports multiprogramming.

False

The fixed partition scheme works well when ____.

All jobs are of similar size

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

Deallocation

Memory compaction is also referred to as ____.

Defragmentation

General-purpose operating systems such as Linux or Windows are used in embedded systems.

False

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.

Embedded

A disadvantage of segmented memory allocation is ____.

External fragmentation

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

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

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

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

____ allows separate partitions of a single server to support different operating systems.

Multithreading

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.

Page file

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 a single-user system, jobs are processed ____.

Sequentially

____ effectively removes restrictions on maximum program size.

Shared memory

To access a location in memory when using segmented memory management, the address is composed of two entries: ____.

The segment number and the displacement

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