Question: 2. [13 MARKS] Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 1, 3 Assuming demand paging with

2. [13 MARKS] Consider the following page reference string: 7, 2,

2. [13 MARKS] Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 1, 3 Assuming demand paging with four frames, how many page faults would occur for the following replacement algorithms? Please circle which references cause page faults. a) Optimal (OPT) replacement [5m] b) LRU replacement [7m]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Consider a logical address space of 256 pages with a 4-KB page size, mapped onto a physical memory of 64 frames. (2 points) a. How many bits are required in the logical address? b. How many bits are...

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 three frames, how many page faults would occur for the following...

1-Asimplifiedviewof threadstates is Ready , Running , and Blocked , where a thread is either ready and waiting to be scheduled, is running on the processor, or is blocked (for example, waiting for...

Exercise 5. (OSC 921) (15%) 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 three frames, hovw many page faults...

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

Consider the following page reference string: 5, 2, 3, 1, 2, 5, 3, 4, 6, 5, 7, 1, 0, 7, 4, 6, 2, 3,0,1 Assuming demand paging with 4 frames, how many page faults would occur for the following...

3. Considering 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 three frames, how many page faults would occur for the...

Concider the following page reference string: 7, 0, 3, 1, 3, 5, 4, 6, 5. Assuming demandpaging with three frames, how many page faults would occur for the following replacement algorithms? 1) FIFO...

Question #3 (5 points): Consider the following page reference string: 0, 3, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1, 2, 3, 4, 6, 7. Assuming demand paging with three (3) frames, how many page faults would occur...

A roller coaster car of mass 320 kg (including passengers) travels around a horizontal curve of radius 35 m. Its speed is 16 m/s. What is the magnitude and direction of the total force exerted on the...

Based on past results found in the Information Please Almanac, there is a 0.120 probability that a baseball World Series contest will last four games, a 0.253 probability that it will last five...

Leverage taken on by growth equity firms in smaller than in buyouts why?

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

2. KMPG LLP

5. Wyeth Pharmaceuticals

2. Go to www.quality.nist.gov, the Web site for the National Institute of Standards and Technology (NIST). The NIST oversees the Malcolm Baldrige Quality Award. Click on Criteria for Performance...