Section 1

Preview this deck

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. written in a single language c. stored on disk d. relocatable

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (18)

Section 1

(18 cards)

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. written in a single language c. stored on disk d. relocatable

Front

Loaded into memory

Back

A hybrid system is a combination of ____ systems a. interactive and real-time b. batch and real-time c. real-time and general-purpose d. batch and interactive

Front

Batch and Interactive

Back

T/F There are two primary types of user interfaces: the graphical user interface and the command line interface

Front

True

Back

The ____ is often very different from one operating system to the next, sometimes even between different versions of the same operating system a. User interface b. File manager c. Memory manager d. Process Manager

Front

User interface

Back

The name for the core portion of an operating system is the a. center b. nucleus c. manager d. kernal

Front

Kernal

Back

T/F The fixed partition scheme does not require that the entire program be stored contiguously and in memory from the beginning to the end of its execution

Front

False

Back

The fixed partition scheme works well if all of the jobs run on the system are of the same size or if the sizes are known ahead of time and don't vary between reconfigurations True False

Front

True

Back

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. main memory b. null entries c. segmentation d. overhead

Front

Overhead

Back

_____ of memory is performed by the operating system to reclaim fragmented sections of the memory space a. Deallocation b. Redirection c. Reallocation d. Compaction

Front

Compaction

Back

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 a. hard b. soft c. restricted d. constrained

Front

Hard

Back

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

Front

False

Back

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

Front

Internal Fragmentation

Back

The fixed partition scheme works well when a. all jobs are of similar size b. all jobs are under 100K c. jobs have different sizes d. job sizes are not known in advance

Front

All jobs are of similar size

Back

T/f Single-user systems in a non-networked environment allocate, to each user, access to all available main memory for each job, and jobs are process sequentially, one after the other.

Front

True

Back

One of the problems with the best-fit algorithm is that the entire table must be searched before the allocation can be made because the memory blocks are physically stored in sequence according to their location in memory. True False

Front

True

Back

T/F General-purpose operating systems such as Linux or Windows are used in embedded systems

Front

False

Back

A system with ____ divides programs into parts and keep them in secondary storage, bringing each part into memory only as it is needed a. shared memory b. passive multiprogramming c. segmented processing d. virtual memory

Front

Virtual memory

Back

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, access, and status b. partition size, memory address, and status c. partition size, status, and access d. status, access, and memory access

Front

Partition size, memory address, access, and status

Back