Textbook Notes (270,000)
CA (160,000)
York (10,000)
EECS (100)
EECS 1520 (100)
Chapter 10

EECS 1520 Chapter Notes - Chapter 10: Selection Algorithm, Logical Address, Context Switch


Department
Electrical Engineering and Computer Science
Course Code
EECS 1520
Professor
Lew Lewther
Chapter
10

This preview shows page 1. to view the full 5 pages of the document.
1. Which of the following describes a reference made to an actual location in main memory?
A. single contiguous
B. logical address
C. physical address
D. partition
E. paged
2. Which of the following describes a memory management technique in which main memory is divided into
multiple, different sized sections?
F. single contiguous
G. logical address
H. physical address
I. partition
J. paged
3. Which of the following describes a memory management technique in which a program is divided into fixed
sized sections and stored into areas of memory called frames?
K. single contiguous
L. logical address
M. physical address
N. round robin
O. paged
4. Which of the following best describes a partitioning approach in which a new partition is created to
accommodate a new process?
P. dynamic partitions
Q. fixed partitions
R. both A and B
S. neither A or B
5. Which of the following best describes a partitioning approach in which partitions can have different sizes, but
each keeps its original size?
T. dynamic partitions
U. fixed partitions
V. both A and B
W. neither A or B
6. Which of the following best describes a partitioning approach that uses the base register to store the beginning
address of the current partition?
X. dynamic partitions
Y. fixed partitions
Z. both A and B
AA. neither A or B
7. Which of the following best describes a partitioning approach that uses the bounds register to store the last
address of the current position?
BB. dynamic partitions
CC. fixed partitions
DD. both A and B
EE. neither A or B
1
You're Reading a Preview

Unlock to view full version

Only page 1 are available for preview. Some parts have been intentionally blurred.

8. Which of the following best describes a partitioning approach in which all partitions are the same size?
FF. dynamic partitions
GG. fixed partitions
HH. both A and B
II. neither A or B
9. Which of the following describes a partition selection algorithm in which the program is allocated to the smallest
partition big enough to hold it?
JJ. best fit
KK. worst fit
LL. shortest fit
MM. first fit
NN. last fit
10. Which of the following describes a partition selection algorithm in which the program is allocated to the largest
partition big enough to hold it?
OO. best fit
PP. worst fit
QQ. shortest fit
RR. first fit
SS. last fit
11. Which of the following describes a partition selection algorithm in which the program is allocated to the first
partition big enough to hold it?
TT. best fit
UU. worst fit
VV. shortest fit
WW. first fit
XX. last fit
12. Which of the following describes the act of bringing in a page from secondary memory, which may cause
another to be written back to secondary memory?
YY. swapping
ZZ. context switch
AAA. demand paging
BBB. thrashing
CCC. virtual memory
13. Which of the following describes the act of storing register values for the currently executing process and
loading the register values for the process taking over the CPU?
DDD. swapping
EEE. context switch
FFF.demand paging
GGG. thrashing
HHH. virtual memory
14. Which of the following describes the situation in which memory appears to be unlimited because the program
size is not restricted?
III. swapping
JJJ. context switch
KKK. demand paging
LLL. thrashing
2
You're Reading a Preview

Unlock to view full version