0 — Test 343
Page 1 of 3
Question 1
The implementation of the LFU and the MFU algorithm is very uncommon because ____________
0
System Administrator 2026
Question 2
The minimum number of frames to be allocated to a process is decided by the ____________
0
System Administrator 2026
Question 3
When a page fault occurs before an executing instruction is complete if ____________
0
System Administrator 2026
Question 4
Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _____ frame(s).
0
System Administrator 2026
Question 5
The maximum number of frames per process is defined by ____________
0
System Administrator 2026
Question 6
The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________
0
System Administrator 2026
Question 7
The algorithm in which we allocate memory to each process according to its size is known as ____________
0
System Administrator 2026
Question 8
With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.
0
System Administrator 2026
Question 9
_________ 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.
0
System Administrator 2026
Question 10
_________ replacement allows each process to only select from its own set of allocated frames.
0
System Administrator 2026