page fault

Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside...

In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replacement algori...

Consider a process P running on a CPU. Which one or more of the following events will always trigger a context switch by the OS that results in process P moving to a non-running st...

Which one or more of the following options guarantee that a computer system will transition from user mode to kernel mode?

Consider a paging system that uses a 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB lookup takes 20 ns....

A system uses $$3$$ page frames for storing process pages in main memory. It uses the Least Recently Used $$(LRU)$$ page replacement policy. Assume that all the page frames are ini...

Assume that there are $$3$$ page frames which are initially empty. If the page reference string is $$1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6,$$ the number of page faults using the optimal...

A system uses FIFO policy for page replacement. It has $$4$$ pages frames with no pages loaded to begin with. The system first accesses $$100$$ distinct pages in some order and the...

A process has been allocated $$3$$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page...

Increasing the $$RAM$$ of a computer typically improves performance because

Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statically linked libraries?

Suppose the time to service a page fault is on the average $$10$$ milliseconds, while a memory access takes $$1$$ microsecond. Then a $$99.99$$% hit ratio results in average memory...

The address sequence generated by tracing a particular program executing in a pure demand paging system with $$100$$ records per page with $$1$$ free main memory frame is recorded...

The following page addresses, in the given sequence, were generated by a program: 1 2 3 4 1 3 5 2 1 5 4 3 2 3 This program is run on a demand paged virtual memory system, with main...

Let the page reference and the working set window be c c d b c e c e a d and 4, respectively. The initial working set at time $$t = 0$$ contains the pages {a, d, e}, where a was re...