Page reference string: 5,3,7,8,5,3,9,1,2,7,4,9,8,2 and 3 -Number of page frames : 3 ( All three page...

Question

Question

Page reference string: 5,3,7,8,5,3,9,1,2,7,4,9,8,2 and 3

-Number of page frames : 3 ( All three page frames are initially invalid )

Problem 2.3

Let us assume that the working set window is 10. what is the working set at the above access pattern after the last page number 3 is accessed?

Answer 1

Answer #1

232 22 S3,7 8. 5 3 1, 8, 2, 3 Page neference sh 10 poga prames: ,2,3, , ,8,9} 53,7, 8,5 3,9, 2,7,4,9,2, 2,3 1,2,3,4, 5,7,8,93

Answer 2

Similar Homework Help Questions

Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1,...

Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1 If OPT replacement is used, the number of page faults will be a. 8 b. 9 c. 10 d. 7 e.None of the above If LRU replacement is used, the number of page fault will be a. 8 b. 9 c. 10 d. 11 e. None of the above
Consider the following page reference string, for a process with 5 virtual pages, and three frames...

Consider the following page reference string, for a process with 5 virtual pages, and three frames in memory, and fill in the tables for the LRU. B. LRU. Reference string: ABCBDEABCDA Page Page Reference Fault Total Page Faults
Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has...

Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has 4 page frames allocated to these 7 pages. Follow the page placement and replacement using the following three replacement algorithms: • LRU replacement • FIFO replacement • Optimal replacement How many page faults will occur for these three algorithms? Assume that all frames are initially empty, so your first unique pages will all cost one fault each USE ENCLOSED TABLES! Show all calculations in...

Consider the following page reference string 43.2,145,5,4,3,2.1,5. How many page faults would occur for the following...

Consider the following page reference string 43.2,145,5,4,3,2.1,5. How many page faults would occur for the following page replacement algorithms assuming three frames? Initially, all frames are empty. a.FIFO b.LRU C-Optimal
Given the following page reference string, count the number of page faults for a memory capacity...

Given the following page reference string, count the number of page faults for a memory capacity of 4 frames using the CLOCK page replacement algorithm. Reference string: 0, 1, 2, 3, 0, 1, 4, 0, 1, 2, 3, 4, 5, 6, 3, 2, 1, 0. Show all work.
A system has 5 frames. For each of the algorithms below give the number of pages...

A system has 5 frames. For each of the algorithms below give the number of pages faults for the reference string 43214573654632714. Show all your work. (a) FIFO (b) Optimal Algorithm (c) LRU (d) Working set Algorithm. Assume that there are 3 page reference between clock ticks. Also in case of a tie the page with the lowest number is paged out.

Given the following page-reference string, show the allocation of 3 frames of memory using FIFO ,...

Given the following page-reference string, show the allocation of 3 frames of memory using FIFO , LRU and OPT. How many page faults for FIFO, LRU and OPT? 3,1,2,1,3,1,4,1,3,2,4,2,5,6,4,6,2,1,6,5
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1,...

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, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each. • LRU replacement • FIFO replacement • Optimal replacement
Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6,...

Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that these particular pages need to be accessed by the computer in the order shown. Consider each of the following 4 algorithm-frame combinations: LRU with 3 frames FIFO with 3 frames LRU with 4 frames FIFO with 4 frames . For each of the 4 combinations, below, move from left to right as the virtual page numbers are...