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

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

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

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

_________ 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

_________ replacement allows each process to only select from its own set of allocated frames.

• A. Local
• B. Universal
• C. Global
• D. Public

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

________ replacement generally results in greater system throughput.

• A. Local
• B. Global
• C. Universal
• D. Public

The NFS servers ____________

• A. Are stateless
• B. Save the current state of the request
• C. Maybe stateless
• D. None of the mentioned

Every NFS request has a _________ allowing the server to determine if a request is duplicated or if any are missing.

• A. Name
• B. Transaction
• C. Sequence number
• D. All of the mentioned