Question 1

Fixed partitions are also called ____ partitions.

Accepted Answer

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

Question 2

A single-user system supports multiprogramming.

Accepted Answer

A) True 
 B)False  False

Question 3

Main memory is also known as ____.

Accepted Answer

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

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

Research continues to focus on finding the optimum allocation scheme.

Accepted Answer

A) True 
 B)False

Question 6

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.

Accepted Answer

A)  null entries 
B)  segmentation 
C)  main memory 
D)  overhead 
A)  null entries 
B)  segmentation 
C)  main memory 
D)  overhead

Question 7

A(n)____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

Accepted Answer

A)  blank line 
B)  null entry 
C)  joined entry 
D)  empty entry 
A)  blank line 
B)  null entry 
C)  joined entry 
D)  empty entry

Question 8

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 9

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.

Accepted Answer

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

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

In the fixed-partition memory management scheme,the table that the Memory Manager uses to keep track of jobs is composed of the ____.

Accepted Answer

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 
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 12

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 
A)  sequentially 
B)  intermittently 
C)  randomly 
D)  in order of longest job to shortest job

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.

Accepted Answer

A) True 
 B)False

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.

Accepted Answer

A) True 
 B)False

Question 15

The first attempt to allow for multiprogramming used fixed partitions.

Accepted Answer

A) True 
 B)False

Question 16

Memory compaction is also referred to as ____.

Accepted Answer

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

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

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.

Accepted Answer

A) True 
 B)False

Question 19

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 
A)  fixed partition allocation 
B)  first-fit memory allocation 
C)  dynamic fit memory allocation 
D)  best-fit memory allocation

Question 20

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 
A)  function 
B)  value 
C)  order 
D)  assignment

Fixed partitions are also called ____ partitions.

A single-user system supports multiprogramming.

Main memory is also known as ____.

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

Research continues to focus on finding the optimum allocation scheme.

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(n)____ 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 ____ 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.

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

In the fixed-partition memory management scheme,the table that the Memory Manager uses to keep track of jobs is composed of the ____.

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

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

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.

The first attempt to allow for multiprogramming used fixed partitions.

Memory compaction is also referred to as ____.

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

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.

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

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.

Introducing Operating Systems

Memory Management Includes Virtual Memory

Processor Management

Process Synchronization

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating Systems

Windows Operating Systems

Linux Operating Systems

Android Operating Systems

Filters

Exam 2: Early Memory Management Systems

Fixed partitions are also called ____ partitions.

A single-user system supports multiprogramming.

Main memory is also known as ____.

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

Research continues to focus on finding the optimum allocation scheme.

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(n)____ 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 ____ 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.

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

In the fixed-partition memory management scheme,the table that the Memory Manager uses to keep track of jobs is composed of the ____.

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

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

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.

The first attempt to allow for multiprogramming used fixed partitions.

Memory compaction is also referred to as ____.

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

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.

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

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.

Introducing Operating Systems

Memory Management Includes Virtual Memory

Processor Management

Process Synchronization

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating Systems

Windows Operating Systems

Linux Operating Systems

Android Operating Systems

Filters