A. Wide interactive network development for office work solution
B. World interactive development for office work solution
C. Wide internet network development for office work solution
D. Wide internet network development for office work solution
For 3 Page Frames, the following is the reference string 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1:
How many page faults does the LRU page replacement algorithm produce?
A. 10
B. 11
C. 15
D. 12
LRU (Least Recently Used) page replacement algorithm associates with each page the ___:
A. Time it was brought into the memory
B. The time of that page is last used
C. Page after and before it
D. All of these
Optimal page replacement algorithm is difficult to implement because:
A. It requires a lot of information
B. It requires future knowledge of the reference string
C. It is too complex
D. It is extremely expensive
Optimal page replacement algorithm is:
A. Replace the page that has not been used for a long time
B. Replace the page that has been used for a long time
C. Replace the page that will not be used for a long time
D. None of these
A FIFO replacement algorithm association each page the ____.
A. Time it was brought into the memory
B. Size of the page in the memory
C. Page after and before it.
D. All of these
The aim of creating page replacement algorithm is to:
A. Replace pages faster
B. Increase the fault rate
C. Decrease the page fault rate
D. To allocate multiple pages to process
Users are ___ that their processes are running on a paged system:
A. Aware
B. Unaware
C. Informed
D. None of these
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed and then the page replacement algorithm used is:
A. LRU
B. LFU
C. FIFO
D. None of these
A process refers to 5 pages, A,B,C,D,E in order:
A,B,C,D,A,B,E,A,B,C,D,E. If the page replacement algorithm is FIFO, the number of page transfer with an empty internal store of 3 frames is:
A. 8
B. 10
C. 9
D. 7
Which one of the following can’t be scheduled by the kernel?
A. Kernel level thread
B. User level thread
C. Process
D. None of these
In multilevel feedback scheduling algorithm:
A. A process can move to a different classified ready queue
B. Classification of ready queue is permanent
C. Processes are not classified into groups
D. None of the mentioned