FINALS

Question 1

Programs on disk, ready to be brought into memory to execute

Answer 1

input queue

Question 2

If memory location known a priori, absolute code can be generated; must recompile code if starting
location changes

Answer 2

Compile time

Question 3

Must generate relocatable code if memory location is not known at compile time

Answer 3

Load time

Question 4

Binding delayed until run time if the process can be moved during its execution from one memory segment to another

Answer 4

Execution time

Question 5

generated by the CPU; also referred to
as virtual address

Answer 5

Logical address

Question 6

address seen by the memory unit

Answer 6

Physical address

Question 7

is the set of all logical addresses
generated by a program

Answer 7

Logical address space

Question 8

is the set of all physical addresses
generated by a program

Answer 8

Physical address space

Question 9

Hardware device that at run time maps virtual to physical
address

Answer 9

Memory-Management Unit (MMU)

Question 10

system libraries and program code combined by
the loader into the binary program image

Answer 10

Static linking

Question 11

linking postponed until execution time

Answer 11

Dynamic linking

Question 12

Small piece of code, used to locate the appropriate
memory-resident library routine

Answer 12

stub

Question 13

fast disk large enough to accommodate copies
of all memory images for all users; must provide direct access to
these memory images

Answer 13

Backing store

Question 14

ready-to-run processes
which have memory images on disk

Answer 14

ready queue

Question 15

can’t swap out as I/O would occur to wrong
process

Answer 15

Pending I/O

Question 15

swapping variant used for priority-based
scheduling algorithms; lower-priority process is swapped out so
higher-priority process can be loaded and executed

Answer 15

Roll out, roll in

Question 16

always transfer I/O to kernel space, then to I/O device

Answer 16

double buffering

Question 17

block of available memory; holes of various size are scattered
throughout memory

Answer 17

Hole

Question 17

sizes for efficiency (sized to a given process’ needs)

Answer 17

Variable-partition

Question 18

Allocate the first hole that is big enough

Answer 18

First-fit

Question 19

Allocate the smallest hole that is big enough; must
search entire list, unless ordered by size

Answer 19

Best-fit:

Question 20

Allocate the largest hole; must also search entire list

Answer 20

Worst-fit

Question 21

total memory space exists to
satisfy a request, but it is not contiguous

Answer 21

External Fragmentation

Question 22

allocated memory may be slightly
larger than requested memory; this size difference is memory
internal to a partition, but not being used

Answer 22

Internal Fragmentation

Question 23

Reduce external fragmentation

Answer 23

compaction

Question 24

Memory-management scheme that supports user view of memory

Answer 24

Segmentation

Question 25

maps two-dimensional physical addresses

Answer 25

Segment table

Question 26

contains the starting physical address where the
segments reside in memory

Answer 26

base

Question 27

specifies the length of the segment

Answer 27

limit –

Question 28

points to the segment
table’s location in memory

Answer 28

Segment-table base register (STBR)

Question 29

indicates number of
segments used by a program

Answer 29

Segment-table length register (STLR)