adplus-dvertising
frame-decoration

Question

A page fault ..................

a.

is an error in specific page

b.

is an access to the page not currently in main memory

c.

occurs when a page program accesses a page of memory

d.

is reference to the page which belongs to another program

Answer: (b).is an access to the page not currently in main memory

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A page fault ..................

Similar Questions

Discover Related MCQs

Q. .................. synchronize critical resources to prevent deadlock.

Q. The memory allocation scheme subjected to “external” fragmentation is:

Q. Producer consumer problem can be solved using:

Q. Banker’s algorithm is used for ................... purpose.

Q. Bankers algorithm is for

Q. Which is the correct definition of a valid process transition in an operating system ?

Q. Semaphores are used to:

Q. In which of the following storage replacement strategies, is a program placed in the largest available hole in the memory?

Q. Remote computing system involves the use of timesharing systems and:

Q. Match the following

(a) Disk scheduling                 (1) Round robin
(b) Batch processing               (2) Scan
(c) Time sharing                       (3) LIFO
(d) Interrupt processing          (4) FIFO

Q. IC 80287 is:

Q. A solution to external fragmentation.

Q. Not a storage placement strategy for an incoming program/data:

Q. A preemptive type of process scheduling strategy:

Q. When a process is accessing shared modifiable data, the process is said to be in:

Q. The first MPI function call made by every MPI process is the call to:

Q. Dijkstra’s Banker’s algorithm is used for:

Q. Memory bank experiencing too much contention from processor:

Q. Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is

Q. Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 0.5 ns, 5 ns and 100 ns respectively. The hit rates of Level 1 and Level 2 caches are 0.7 and 0.8 respectively. What is the average access time of the system ignoring the search time within the cache?