page-faults

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 the following two-dimensional array D in the C programming language, which is stored in row-major order: int D[128] [128]; Demand paging is used for allocating memory and...

Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with res...

A computer has twenty physical page frames which contain pages numbered $$101$$ through $$120.$$ Now a program accesses the pages numbered $$1, 2, …, 100$$ in that order, and repea...

Consider the virtual page reference string $$$1,2,3,2,4,1,3,2,4,1$$$ On a demand paged virtual memory system running on a computer system that has main memory size of $$3$$ page fr...

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...

A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements: $$P:$$ Increa...

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