When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as ___________.

• A) Page replacement
• B) Segmentation
• C) Page Fault
• D) Paging

In pages segmentation, the logical address is legal if d is _________segment length.

• A) Greater than
• B) Less than
• C) Equal to
• D) Greater than or equal to

Following statement is NOT true about Virtual memory.

• A) Virtual memory also allows files and memory to be shared by several different processes through page sharing.
• B) Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory.
• C) Virtual memory help in executing bigger programs even greater in size that of main memory.
• D) Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory,

The logical address of Intel 80386 is _________.

• A) 128 bits
• B) 64 bits
• C) 48 bits
• D) 36 bits

An optimal page-replacement algorithm has the lowest page fault rate of all algorithms.

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

How does a logical-address space is represented?

• A) Through Segments
• B) Through Critical section
• C)
• D)

Each page is a power of -------- bytes long in paging scheme.

• A) 3
• B) 5
• C) 2
• D) 4

The high paging activity is called _______

• A) Thrashing
• B) Segmentation
• C) Page Fault
• D) Multiprogramming

In paged segmentation, we divide every segment in a process into __________ pages.

• A) Fixed size
• B) Variable size
• C)
• D)

A ____________ system is similar to a paging system with swapping

• A) Context switching
• B) Demand paging
• C) Page fault
• D) None of the given options

To eliminate external fragmentation in segmentation the scheme used is ___________.

• A) Fixed size partition scheme
• B) Variable size paging scheme
• C) Variable size partition scheme
• D) Fixed size paging scheme

_________ allows directories to have shared sub directories and files.

• A) Tree structure
• B) None
• C) Both (Acyclic graph and tree structure)
• D) Acyclic graph

The main criteria for Page Replacement in Optimal Page Replacement Algorithm is to

• A) replace the page which is biggest in size
• B) replace the page which is smaller in size
• C) replace that page which will not be used for the longest period of time.
• D) replace that page which will be required most frequently in the execution of a process

Memory protection in paging is achieved by associating ___________ with each page. This bit indicates whether the page is in the process address space or not.

• A) segment table
• B) counting bits
• C) paging table
• D) protection bits

____________ is commonly implemented as demand paging.

• A) Logical Addressing
• B) Paging
• C) Virtual Memory
• D) Physical Memory

A page table needed for keeping track of pages of the page table is called --------------

• A) Page size
• B) Page directory
• C) 2-level paging
• D) Page table size

In __________ scheme free frames are equally divided among processes.

• A) None of the given options
• B) Fixed Allocation
• C) Proportional Allocation
• D) Priority Allocation

We want a page replacement algorithm with the _____________ page-fault rate.

• A) Lowest
• B) None of the given
• C) Highest
• D) Normal

__________is a variation of fork system call in several Unix operating system.

• A) avfork ( )
• B) bfork ( )
• C) vfork ( )
• D) wfork ( )

The segment table maps the _________________ to physical addresses.

• A) Two-dimensional logical addresses
• B) One-dimensional logical addresses
• C) Page addresses
• D) Shared page addresses