Sample Test 4

Question 1

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

Answer 1

fixed partitioning

Question 2

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

Answer 2

simple paging

Question 3

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

Answer 3

simple segmentations

Question 4

One technique for overcoming external fragmentation is __________ .

Answer 4

compaction

Question 5

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.

Answer 5

relative address

Question 6

The chunks of a process are known as __________ .

Answer 6

pages

Question 7

Available chunks of memory are known as ___________ .

Answer 7

frames

Question 8

The concept of Memory Management satisfies certain system requirements including:

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

Answer 8

C) all of the above

Question 9

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 9

best-fit

Question 10

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 10

next-fit

Question 11

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

Answer 11

A) all of the above

Question 12

The page table for each process maintains _________ .

Answer 12

the frame location for each page of the process

Question 13

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

Answer 13

external fragmentation

Question 14

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

Answer 14

internal fragmentation

Question 15

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

Answer 15

a number of segments which need not be of equal size

Question 16

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

Answer 16

memory management

Question 17

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

Answer 17

segment

Question 18

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.

Answer 18

overlaying

Question 19

A __________ is an actual location in main memory.

Answer 19

physical address (or absolute address)

Question 20

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

Answer 20

page

Question 21

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 21

internal fragmentation

Question 22

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

Answer 22

Main memory

Question 23

A _________ is a fixed length block of main memory.

Answer 23

frame

Question 24

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

Answer 24

external fragmentation

Question 25

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

Answer 25

buddy system

Question 26

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

Answer 26

logical address

Question 27

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

Answer 27

page table

Question 28

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.

Answer 28

buffer overflow

Question 29

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

Answer 29

run-time defenses

Question 30

The basic tools of memory management are paging and __________ .

Answer 30

segmentation

Question 31

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

Answer 31

real address

Question 32

_________ is the virtual storage assigned to a process.

Answer 32

Virtual address space

Question 33

__________ is the range of memory addresses available to a process.

Answer 33

Address space

Question 34

The __________ structure indexes page table entries by frame number rather than by virtual page number.

Answer 34

inverted page table

Question 35

The _________ states the process that owns the page.

Answer 35

process identifier

Question 36

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

Answer 36

page fault

Question 37

_________ allows the programmer to view memory as consisting of multiple address spaces.

Answer 37

Segmentation

Question 38

__________ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.

Answer 38

Paging

Question 39

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

Answer 39

fetch policy

Question 40

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

Answer 40

prepaging

Question 41

The _________ policy results in the fewest number of page faults.

Answer 41

Optimal

Question 42

A _________ chooses only among the resident pages of the process that generated the page fault in selecting a page to replace.

Answer 42

local replacement policy

Question 43

The _________ algorithm requires a use bit to be associated with each page in memory.

Answer 43

page fault frequency

Question 44

_________ is where modified process pages can be written out at the time of replacement, or a precleaning policy can be used, which clusters the output activity by writing out a number of pages at once.

Answer 44

Cleaning policy

Question 45

_________ is the concept associated with determining the number of processes that will be resident in main memory.

Answer 45

Load Control

Question 46

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 46

virtual address

Question 47

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

Answer 47

Virtual memory

Question 48

The size of virtual storage is limited by the addressing scheme of the computer system and by the amount of __________ available.

Answer 48

secondary memory

Question 49

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

Answer 49

first-in-first-out (FIFO)

Question 50

The portion of a process that is actually in main memory at any time is defined to be the _________ of the process.

Answer 50

resident set

Question 51

A __________ policy allows the number of page frames allocated to a process to be varied over the lifetime of the process.

Answer 51

variable-allocation

Question 52

Because a process executes only in main memory, that memory is referred to as ____________ .

Answer 52

real memory

Question 53

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

Answer 53

thrashing

Question 54

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 54

translation lookaside buffer (TLB)

Question 55

The technique where the processor is equipped with hardware that allows it to interrogate simultaneously a number of TLB entries to determine if there is a match on page number is referred to as __________ .

Answer 55

associative mapping

Question 56

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

Answer 56

demand paging

Question 57

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

Answer 57

least recently used (LRU)

Question 58

The __________ provides a virtual memory capability that allocates page frames in main memory to processes and also allocates page frames to disk block buffers.

Answer 58

paging system

Question 59

Linux makes use of a three-level page table structure consisting of the following types of tables: page directory, page table, and __________ .

Answer 59

page middle directory

Question 60

In SVR4 and Solaris systems, the memory management scheme that manages memory allocation for the kernel is called the _________ .

Answer 60

kernel memory allocator