For some page replacement algorithms, the page fault rate may increase as the number of allocated frames __________.

• A) increased
• B) constant
• C) decreased
• D) All of the given

______________is the operating system’s attempt to improve the computer system’s utilization and throughput.

• A) Exec
• B) Demand Paging
• C) Thrashing
• D) Fork

In _____________ page replacement algorithm we will replace the page that has not been used for the longest period of time.

• A) LRU
• B) FIFO
• C) Least Frequently Used
• D) Counter based

FIFO Page Replacement Algorithm has the lowest page fault rate

• A) True
• B) False
• C)
• D)

_____________is the separation of user logical memory from physical memory.

• A) Physical memory
• B) None of the given options
• C) Virtual Memory
• D) ROM

The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address.

• A) Valid, invalid
• B) Physical, Virtual
• C) Hexadecimal, Binary
• D) Virtual, physical

The __________ protection scheme guards against a process trying to access a page that does not belong to its address space.

• A) Secondary
• B) Primary
• C) Hybrid
• D) Tertiary

It is not possible to run a program whose size is greater than the size of the main memory.

• A) False
• B) True
• C)
• D)

The main objective of LRU Page Replacement Algorithm is to

• A) replace that page which is referenced most frequently
• B) replace the page which is replaced most recently
• C) replace that page which was used most previously
• D) replace the page which is used urgently

Logical address is defined by which tuple/tuples?

• A) Paging
• B) Indexed number and offset
• C) Segment number and offset
• D) Physical address

A process is _____________if it is spending more time on paging

• A) Fixed Allocation
• B) Thrashing
• C) Demand paging
• D) Paging

___________ is a memory management scheme that supports programmer’s view of Memory.

• A) Segmentation
• B) Stack
• C) Fragmentation
• D) Assembly

In memory management programmer’s view of memory representation is called ________________.

• A) Segmentation
• B) Physical address
• C) Offset
• D) Logical address

Following are the advantages of Virtual memory EXCEPT

• A) Concept of memory mapped files
• B) Efficient process creation
• C) Low CPU consumption
• D) Running large sized processes

The ____________ command is used to create both soft and hard links.

• A) lS
• B) mv
• C) ln
• D) pwd

This __________ algorithm is based on the locality of reference concept.

• A) Page Buffering Algorithm
• B) All of above
• C) Most Frequently Used (MFU)
• D) Least Frequently Used (LFU)

The major criterion in the selection of a particular algorithm is that we want to ______________

• A) minimize the number of page faults.
• B) maximize the number of page faults.
• C) reduce running time of page replacement algorithm.
• D) increase efficiency.