Deck 2: Memory Management: Simple Systems

Question 1

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.

Answer 1

True

Question 2

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.

Answer 2

False

Question 3

Single-user contiguous allocation schemes have the problem of partition intrusion..

Answer 3

False

Question 4

A large job can have problems with a first-fit memory allocation scheme.

Question 5

A single-user system supports multiprogramming.

Question 6

The first-fit algorithm assumes that the Memory Manager keeps only one list containing free memory blocks.

Question 7

In the relocatable dynamic partitions scheme,the Memory Manager relocates programs to gather together all of the empty blocks and compact them to make one block of memory large enough to accommodate some or all of the jobs waiting to get in.

Question 8

The first attempt to allow for multiprogramming used fixed partitions.

Question 9

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

Question 10

Compaction should always be performed only when there are jobs waiting to get in.

Question 11

After relocation and compaction,both the free list and the busy list are updated.

Question 12

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

Question 13

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

Question 14

The algorithm used to store jobs into memory in a fixed partition system requires a few more steps than the one used for a single-user system because the size of the job must be matched with the size of the partition to make sure it fits completely.

Question 15

Research continues to focus on finding the optimum allocation scheme.

Question 16

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

Question 17

For a fixed partition system,memory deallocation is relatively complex.

Question 18

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.

Question 19

In a dynamic partition system,a null entry in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

Question 20

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.

Question 21

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

Question 22

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

Question 23

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

A) An inefficient fit
B) Indirect partitioning
C) External fragmentation
D) Internal fragmentation

Question 24

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

A) Deallocation
B) Redirection
C) Compaction
D) Reallocation

Question 25

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

Question 26

Main memory is also known as ____.

A) single-user memory
B) random access memory
C) finite memory
D) virtual memory

Question 27

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

Question 28

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

Question 29

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

Question 30

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

Question 31

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

A) byte
B) percentage
C) bit
D) area

Question 32

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

Question 33

Memory compaction is also referred to as ____.

A) defragmentation
B) collection
C) reallocation
D) dynamic allocation

Question 34

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

Question 35

Fixed partitions are also called ____ partitions.

A) complete
B) static
C) direct
D) sized

Question 36

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

Question 37

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

Question 38

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

A) sequentially
B) intermittently
C) randomly
D) in order of longest job to shortest job

Question 39

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

Question 40

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

A) fragmentation
B) relocation
C) free memory
D) deallocation