The aim of creating page replacement algorithms is to ____________

• A. Replace pages faster
• B. Increase the page fault rate
• C. Decrease the page fault rate
• D. To allocate multiple pages to processes

What is the Optimal page – replacement algorithm?

• 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 the mentioned

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

LRU page – replacement algorithm associates with each page the ______

• A. Time it was brought into memory
• B. The time of that page’s last use
• C. Page after and before it
• D. All of the mentioned

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. 15
• C. 11
• D. 12

What are the two methods of the LRU page replacement policy that can be implemented in hardware?

• A. Counters
• B. Ram & registers
• C. Stack & counters
• D. Registers

Data cannot be written to secondary storage unless written within a ______

• A. File
• B. Swap space
• C. Directory
• D. Text format

File attributes consist of ____________

• A. Name
• B. Type
• C. Identifier
• D. All of the mentioned

A file is a/an _______ data type.

• A. Abstract
• B. Primitive
• C. Public
• D. Private

In UNIX, what will the open system call return?

• A. Pointer to the entry in the open file table
• B. Pointer to the entry in the system wide table
• C. A file to the process calling it
• D. None of the mentioned