Deck 7: Memory Management

Question 1

Main memory divided into a number of equal size frames is the __________ technique.

A) simple paging
B) dynamic partitioning
C) fixed partitioning
D) virtual memory segmentation

Answer 1

A

Question 2

Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.

Answer 2

True

Question 3

In a uniprogramming system main memory is divided into two parts.

Answer 3

True

Question 4

Secondary memory provides fast access at relatively high cost.

Question 5

One technique for overcoming external fragmentation is __________ .

A) loading
B) compaction
C) relocation
D) partitioning

Question 6

The memory protection requirement must be satisfied by the operating system rather than the processor.

Question 7

Segmentation does not eliminate internal fragmentation.

Question 8

All segments of all programs must be of the same length.

Question 9

The principal operation of memory management is to bring processes into main memory for execution by the processor.

Question 10

A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.

Question 11

With __________ a process is loaded by loading all of its segments into dynamic partitions that need not be contiguous.

A) simple paging
B) virtual memory segmentation
C) virtual memory paging
D) simple segmentations

Question 12

Overlay programming wastes programmer time.

Question 13

In a multiprogramming system the available main memory is not generally shared among a number of processes.

Question 14

In a multiprogramming environment the programmer knows at the time of coding how much space will be available and where that space will be.

Question 15

The use of unequal size partitions provides a degree of flexibility to fixed partitioning.

Question 16

Main memory divided into a number of static partitions at system generation time is _________ .

A) fixed partitioning
B) simple segmentation
C) dynamic partitioning
D) simple paging

Question 17

A ___________ is a particular example of logical address in which the address is expressed as a location relative to some known point, usually a value in a processor register.

A) logical address
B) relative address
C) absolute address
D) physical address

Question 18

A hardware mechanism is needed for translating relative addresses to physical main memory addresses at the time of execution of the instruction that contains the reference.

Question 19

Programs in other processes should not be able to reference memory locations in a process for reading or writing purposes without permission.

Question 20

The best-fit algorithm is usually the worst performer.

Question 21

The chunks of a process are known as __________ .

A) pages
B) addresses
C) frames
D) segments

Question 22

In a system employing a segmentation scheme for memory management wasted space is due to _________ .

A) external fragmentation
B) frames of different sizes
C) internal fragmentation
D) segments of different sizes

Question 23

A __________ is an actual location in main memory.

Question 24

A compromise to overcome the disadvantages of fixed partitioning and dynamic partitioning is the __________ .

Question 25

In a system employing a segmentation scheme for memory management a process is divided into _________ .

A) one segment per thread
B) a number of threads
C) a number of segments which need not be of equal size
D) a number of segments which must be of equal size

Question 26

In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________ .

A) last-fit
B) best-fit
C) next-fit
D) first-fit

Question 27

A _________ is a fixed length block of main memory.

Question 28

A problem with the largely obsolete Fixed Partitioning memory management technique is that of:

A) all of the above
B) inefficient use of memory
C) internal fragmentation
D) allowing only a fixed number of processes

Question 29

A fixed length block of data that resides in secondary memory is a __________ .

Question 30

Available chunks of memory are known as ___________ .

A) frames
B) segments
C) addresses
D) pages

Question 31

When there is wasted space internal to a partition due to the fact that the block of data loaded is smaller than the partition is referred to as __________.

Question 32

The page table for each process maintains _________ .

A) the physical memory location of the process
B) the frame location for each page of the process
C) the page location for each frame of the process
D) the logical memory location of the process

Question 33

In a system employing a paging scheme for memory management wasted space is due to _________ .

A) internal fragmentation
B) pages of different specified sizes
C) external fragmentation
D) frames of different specified sizes

Question 34

The concept of Memory Management satisfies certain system requirements including:

A) relocation
B) protection
C) all of the above
D) physical organization

Question 35

A __________ is a variable length block of data that resides in secondary memory.

Question 36

In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called __________ .

A) first-fit
B) best-fit
C) last-fit
D) next-fit

Question 37

The task of subdividing memory to accommodate multiple processes is carried out dynamically by the operating system and is known as ___________ .

Question 38

In a practice known as _________ , the program and data are organized in such a way that various modules can be assigned the same region of memory with a main program responsible for switching the modules in and out as needed.

Question 39

As time goes on, memory becomes more and more fragmented and memory utilization declines, creating a phenomenon referred to as _________ .

Question 40

_________ in a computer system is organized as a linear, or one-dimensional, address space, consisting of a sequence of bytes or words.

Question 41

A __________ is a reference to a memory location independent of the current assignment of data to memory.

Question 42

The __________ shows the frame location for each page of the process.

Question 43

A __________ can occur as a result of a programming error when a process attempts to store data beyond the limits of a fixed-sized buffer and consequently overwrites adjacent memory locations.

Question 44

Countermeasures to defend systems against attacks can be classified into two categories: compile-time defenses and _________ .

Question 45

The basic tools of memory management are paging and __________ .