Consider the following page reference string 1 2 34 12 3 4 1 2 3 41 21 2 3 1. Which of the following statements are correct? I. The number of page faults using FIFO and LRU will be same using 3 empty frames. II. The number of page faults using optimal page replacement algorithm and LRU will be same using 3 empty frames. The number of page faults using optimal page replacement algorithm will be same using 3 empty frames and 2 empty frames. IV. The number of page faults using FIFO, LRU and optimal page replacement algorithm will be same using 4 empty frames. III. (A)I and II (B) I and IV (C)I, III and IV (D)I, II and III

Consider the following page reference string 1 2 34 12 3 4 1 2 3 41 21 2 3 1. Which of the following statements are correct? I. The number of page faults using FIFO and LRU will be same using 3 empty frames. II. The number of page faults using optimal page replacement algorithm and LRU will be same using 3 empty frames. The number of page faults using optimal page replacement algorithm will be same using 3 empty frames and 2 empty frames. IV. The number of page faults using FIFO, LRU and optimal page replacement algorithm will be same using 4 empty frames. III. (A)I and II (B) I and IV (C)I, III and IV (D)I, II and III

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following page reference string: 4, 2, 3, 1, 2, 6, 3, 4, 6, 7, 7, 1, 0, 5, 4, 1, 2, 5, 4, 4 Using the Optimal page replacement algorithms with 3 frames, show the page load order and number of page faults that would occur.
Consider the following page reference string: 3,1,3,6,7,5,1,4,5,6,2,2,6,2,2,7,4,5,1,7,2 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Show procedure Optimal replacement
Consider the following page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 How many page faults would occur for the following replacement algorithms, assuming one, two, three, or even four frames? Remember that all frames are initially empty, so your first unique pages will all cost one fault each.
Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1. Assuming demand paging with 3 frames, how many page faults would occur for the following replacement algorithms? LRU replacement FIFO replacement Optimal replacement
Given that main memory is composed of two page frames for public use and that aseven-page program (with pages A,B, C, D) requests pages in the following order:A, B, A, C, A, B, D, B, A, C, Da. Using the FIFO page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate. b. Using the LRU page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate.
1. When a page is to be replaced, which of the ff. pages is chosen if FIFO algorithm is used? 2. When a page is to be replaced, which of the ff. pages is chosen if optimal page replacement algorithm is used? 3. Which of the ff. page replacement algorithms will generate the lowest page fault rate?
There are 5 page frames and 8 pages (numbered 0; 1; : : : ; 7). Assume that all frames are initially empty. The reference sequence is the following:7 1 2 3 1 4 2 0 5 6 2 5 0 3 1 2 1:(a) How many page faults will occur if the FIFO page replacement is used?(b) What if we use the "second chance" algorithm?Your answer should be justied (which references cause page faults and what is the reason).
Consider the following page reference string:7, 2, 2, 4, 1, 2, 3, 0, 6, 6, 5, 0, 7, 2, 7, 0, 0, 4, 7, 7Assuming demand paging with three frames, how many page faults would occur for the followingreplacement algorithms?• LRU replacement• FIFO replacement• Optimal replacement
Consider a reference string: 1,2,3,4,1,2,5,1,2,3,4,5. the number of frames in the memory is 3. Find out the number of page faults , page faults ratio and page hit ratio with respective to: Optimal Page Replacement Algorithm FIFO Page Replacement Algorithm LRU Page Replacement Algorithm
Consider the following page reference string: 2 1 3 7 2 6 3 2 1 2 3 6 4 3 2 1 2 3 4 6 Assuming demand paging with four frames: How many page faults _____ would occur for the LRU replacement algorithm? Show the final state of the four frames. The top most entry is the most recently used, the bottom-most entry is the least recently used: Age | PageMost Recent ______- ______- ______Least Recent ______
Consider the following sequence of page accesses: 1, 4, 4, 8, 2, 6, 4, 9, 1, 3, 6, 4, 1, 2, 9 Assuming demand paging with three initially empty frames, how many page faults occur for LRU and Optimal replacement algorithms? You can show your work by creating a frame table, crossing out and adding new entries on replacement while talleying above the page access sequence.
Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 What are the last pages in main memory in their order, and how many page faults would occur for the following page replacement algorithms? Assuming 4 frames. A) FIFO B) Optimal C) LRU