Question 1

A single-user system supports multiprogramming.

Accepted Answer

A) True 
 B)False

Question 2

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

Accepted Answer

A)  dynamic fragmentation 
B)  internal fragmentation 
C)  external fragmentation 
D)  fixed fragmentation

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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.

Accepted Answer

A) True 
 B)False

Question 5

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.

Accepted Answer

A)  function 
B)  value 
C)  order 
D)  assignment

Question 6

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

Accepted Answer

A)  deallocation 
B)  best-fit algorithms 
C)  relocatable dynamic partitions 
D)  null entry accounting

Question 7

The ____ method keeps the free/busy lists organized by memory locations,from low-order memory to high-order memory.

Accepted Answer

A)  fixed partition allocation 
B)  first-fit memory allocation 
C)  dynamic fit memory allocation 
D)  best-fit memory allocation

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

The first attempt to allow for multiprogramming used fixed partitions.

Accepted Answer

A) True 
 B)False

Question 10

Memory compaction is also referred to as ____.

Accepted Answer

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

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

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

Question 13

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

Accepted Answer

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

Question 14

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.

Accepted Answer

A) True 
 B)False

Question 15

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.

Accepted Answer

A) True 
 B)False

Question 16

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.

Accepted Answer

A)  relocation register 
B)  load register 
C)  compaction register 
D)  bounds register

Question 17

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

Accepted Answer

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

Question 18

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.

Accepted Answer

A) True 
 B)False

Question 19

The fixed partition scheme works well when ____.

Accepted Answer

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 20

The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.

Accepted Answer

A)  smallest-fit 
B)  first-fit 
C)  dynamic-fit 
D)  best-fit

Exam 2: Memory Management: Simple Systems

A single-user system supports multiprogramming.

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

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

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.

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.

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

The ____ method keeps the free/busy lists organized by memory locations,from low-order memory to high-order memory.

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

The first attempt to allow for multiprogramming used fixed partitions.

Memory compaction is also referred to as ____.

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

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

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

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.

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.

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.

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

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.

The fixed partition scheme works well when ____.

The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.