HomeworkLib
Question

A process references five pages, A, B, C, D, and E, in the following order: B;...

  1. A process references five pages, A, B, C, D, and E, in the following order:

B; C; B; A; E; A; D; E; C; B; D; A

Assume that the replacement algorithm is Optimal, find out the number of page faults occurring after the frame allocation is initially filled with an empty main memory with three page frames.

Optimal

B

C

B

A

E

A

D

E

C

B

D

A
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
A process references five pages, A, B, C, D, and E, in the following order: B;...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Name Olbinna COSC414/514 Quiz3 (1) Suppose a computer has 4 physical pages, and a process referen...

    Name Olbinna COSC414/514 Quiz3 (1) Suppose a computer has 4 physical pages, and a process references its virtual pages (page o through page 7) in the following order: 021354637473355311172341 Also suppose the first four pages have been loaded in the physical memory as the following figure: Frame 0 Frame 1 Frame 2 Frame 3 a. Suppose the kernel uses First-In-First-Out (FIFO) page replacement algorithm. How many page faults would the process have? Which page references are page faults? b. Suppose...

  • Consider the following page reference string: A C B D B A E F B F...

    Consider the following page reference string: A C B D B A E F B F A G E F A Assuming demand paging with four frames, how many page faults would occur for the following replacement algorithms? Remember that all frames are initially empty, so your first unique pages will cost one fault each. Show all of your works. LRU replacement FIFO replacement Optimal (MIN) replacement

  • <Operating System> 1. A process accesses pages in the following order (Assume all frames are initially...

    <Operating System> 1. A process accesses pages in the following order (Assume all frames are initially empty): 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 Determine the number of page faults that will occur for the following algorithms: (Show your work!) Least Recently Used replacement algorithm with 5 frames available to the process. What is the minimum number of page faults that can occur for this process, regardless...

  • 1. Consider a system where 3 page frames are allocated to a process. Consider the following...

    1. Consider a system where 3 page frames are allocated to a process. Consider the following sequence of memory references: 3 2 1 0 3 2 4 3 2 1 0 4. Assuming no pages are initially in memory, how many page faults are there assuming a FIFO page replacement algorithm is used? 2. Repeat problem 1 with number of frames increased to 4. 3. Compare the number of page faults from 1 and 2. Is there Belady’s anomaly? 4....

  • Assuming that there are three frames available in main memory, for the following string of page...

    Assuming that there are three frames available in main memory, for the following string of page references, determine how many page faults would be generated using the Optimal Page Replacement Algorithm. 1,2,4,3,1,3,5,1,2,4,5,3

  • Answer the following questions based on the Memory Management tasks of an Operating System. 5 Consider...

    Answer the following questions based on the Memory Management tasks of an Operating System. 5 Consider the following sequence of page references: 5, 6, 7, 6, 8, 7, 9, 5, 9, 6, 8, 9 Assuming that all frames are initially empty, indicate the contents of memory after each reference, and how many page faults are found for each of the following page replacement algorithms: First In First Out (FIFO):                                   [2 .5 M]                                               Reference String 5 6 7 6 8 7...

  • Suppose an application is assigned 4 pages of physical memory and the memory is initially empty....

    Suppose an application is assigned 4 pages of physical memory and the memory is initially empty. It then references pages in the following sequence: ACBDBAEFBFAGEFA a. Show how the system would fault pages into the four frames of physical memory, using the LRU replacement policy. b. Show how the system would fault pages into the four frames of physical memory, using the MIN replacement policy. c. Show how the system would fault pages into the four frames of physical memory,...

  • A page shall be paged out when page is not required in the memory pages. Page...

    A page shall be paged out when page is not required in the memory pages. Page replacement algorithms are used to perform the page out activity. Calculate the page faults for reference string 1 3 3 5 1 1 8 3 8 9 9 9 with respect to frame size of 3 using the algorithms as follows. Show your workings in details. a) Belady’s anomaly algorithm b) Optimal algorithm answer should be in essay format (including resolution steps) with approximately...

  • Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware...

    Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware B)Virtual Memory uses storage device to extend the physical main memory C)The optimal replacement strategy is the most practical strategy D)Multiple process can share pages What should we do when having a page fault (Multiple answers)? A)Skip the machine instruction causing the page fault. B)Update the page table after loading the missing page C) Switch to a process that does not have page faults...

  • Q1. Consider the following reference string and the frame size is 3 (3 pages can be...

    Q1. Consider the following reference string and the frame size is 3 (3 pages can be in main memory at a time) 10 2 3 4 1 2 3 0 3 2 1 4 1 1 0 3 4 1 2 Apply the following page replacement algorithms and find the page faults: a. FIFO b. Optimal LRU

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT