Basics 4

Question 1

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

Answer 1

simple paging

Question 2

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

Answer 2

simple segmentations

Question 3

The chunks of a process are known as __________ .

Answer 3

pages

Question 4

Available chunks of memory are known as ___________ .

Answer 4

frames

Question 5

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 __________ .

Answer 5

best-fit

Question 6

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 __________ .

Answer 6

next-fit

Question 7

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

Answer 7

a number of segments which need not be of equal size

Question 8

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

Answer 8

memory management

Question 9

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

Answer 9

segment

Question 10

A __________ is an actual location in main memory.

Answer 10

physical address (or absolute address)

Question 11

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

Answer 11

page

Question 12

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 __________.

Answer 12

internal fragmentation

Question 13

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

Answer 13

Main memory

Question 14

A _________ is a fixed length block of main memory.

Answer 14

frame

Question 15

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

Answer 15

external fragmentation

Question 16

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

Answer 16

logical address

Question 17

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

Answer 17

page table

Question 18

The basic tools of memory management are paging and __________ .

Answer 18

segmentation

Question 19

The address of a storage location in main memory is the __________ .

Answer 19

real address

Question 20

A _________ is issued if a desired page is not in main memory.

Answer 20

page fault

Question 21

The _________ determines when a page should be brought into main memory.

Answer 21

fetch policy

Question 22

With _________ pages other than the one demanded by a page fault are brought in.

Answer 22

prepaging

Question 23

The address assigned to a location in virtual memory to allow that location to be accessed as though it were part of main memory is the __________ .

Answer 23

virtual address

Question 24

_________ is a storage allocation scheme in which secondary memory can be addressed as though it were part of main memory.

Answer 24

Virtual memory

Question 25

The __________ policy treats the page frames allocated to a process as a circular buffer and pages are removed in round robin style.

Answer 25

first-in-first-out (FIFO)

Question 26

When the system spends most of its time swapping pieces rather than executing instructions it leads to a condition known as _________ .

Answer 26

thrashing

Question 27

To overcome the problem of doubling the memory access time, most virtual memory schemes make use of a special high-speed cache for page table entries called a __________ .

Answer 27

translation lookaside buffer (TLB)

Question 28

With __________ , a page is brought into main memory only when a reference is made to a location on that page.

Answer 28

demand paging

Question 29

The __________ policy replaces the page in memory that has not been referenced for the longest time.

Answer 29

least recently used (LRU)