Operating System Multiple Choice Questions & Answers on “Virtual Memory – Allocation of Frames”.
1. The minimum number of frames to be allocated to a process is decided by the ____________
a) the amount of available physical memory
b) operating System
c) instruction set architecture
d) none of the mentioned
Answer: c
Clarification: None.
2. When a page fault occurs before an executing instruction is complete if ____________
a) the instruction must be restarted
b) the instruction must be ignored
c) the instruction must be completed ignoring the page fault
d) none of the mentioned
Answer: a
Clarification: None.
3. Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _____ frame(s).
a) one
b) two
c) three
d) none of the mentioned
Answer: b
Clarification: At least one frame for the instruction and one for the memory reference.
4. The maximum number of frames per process is defined by ____________
a) the amount of available physical memory
b) operating System
c) instruction set architecture
d) none of the mentioned
Answer: a
Clarification: None.
5. The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________
a) proportional allocation algorithm
b) equal allocation algorithm
c) split allocation algorithm
d) none of the mentioned
Answer: b
Clarification: None.
6. The algorithm in which we allocate memory to each process according to its size is known as ____________
a) proportional allocation algorithm
b) equal allocation algorithm
c) split allocation algorithm
d) none of the mentioned
Answer: a
Clarification: None.
7. With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.
a) greater than
b) same as
c) lesser than
d) none of the mentioned
Answer: b
Clarification: None.
8. _________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.
a) Local
b) Universal
c) Global
d) Public
Answer: c
Clarification: None.
9. _________ replacement allows each process to only select from its own set of allocated frames.
a) Local
b) Universal
c) Global
d) Public
Answer: a
Clarification: None.
10. One problem with the global replacement algorithm is that ____________
a) it is very expensive
b) many frames can be allocated to a process
c) only a few frames can be allocated to a process
d) a process cannot control its own page – fault rate
Answer: d
Clarification: None.
11. ________ replacement generally results in greater system throughput.
a) Local
b) Global
c) Universal
d) Public
Answer: b