Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Memory has 3 frames containing pages 0, 1, and 2, where O is the oldest page. RS is the page Referencing String for time t from 0 to 11. (1) Using optimal page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) A A (2) Using FIFO page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) A A (3) Using LRU page replace algorithm, how many page faults will occur? Which page is at the end of the queue when this program runs to completion? (put your answer in the following blanks from left to right, answer only) A A

Memory has 3 frames containing pages 0, 1, and 2, where O is the oldest page. RS is the page Referencing String for time t from 0 to 11. (1) Using optimal page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) A A (2) Using FIFO page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) A A (3) Using LRU page replace algorithm, how many page faults will occur? Which page is at the end of the queue when this program runs to completion? (put your answer in the following blanks from left to right, answer only) A A

Database System Concepts
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
icon
Related questions
Question

Opearating system

 

LIMITIV L Frame 2 2 Pg fault Memory has 3 frames containing pages 0, 1, and 2, where O is the oldest page. RS is the page Referencing String for time t from 0 to 11. (1) Using optimal page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) (2) Using FIFO page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) (3) Using LRU page replace algorithm, how many page faults will occur? Which page is at the end of the queue when this program runs to completion? (put your answer in the following blanks from left to right, answer only)
Transcribed Image Text:LIMITIV L Frame 2 2 Pg fault Memory has 3 frames containing pages 0, 1, and 2, where O is the oldest page. RS is the page Referencing String for time t from 0 to 11. (1) Using optimal page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) (2) Using FIFO page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) (3) Using LRU page replace algorithm, how many page faults will occur? Which page is at the end of the queue when this program runs to completion? (put your answer in the following blanks from left to right, answer only)
H Time t RS 0 Frame 0 Frame 1 Frame 2 2 Pg fault O OHC (2) Leine I DU Q Search 1 1 3 2 1 3 1 4 2 5 3 160 7 4 8 1 9 0 10 11 2 0 Memory has 3 frames containing pages 0, 1, and 2, where O is the oldest page. RS is the page Referencing String for time t from 0 to 11. (1) Using optimal page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) (2) Using FIFO page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only)
Transcribed Image Text:H Time t RS 0 Frame 0 Frame 1 Frame 2 2 Pg fault O OHC (2) Leine I DU Q Search 1 1 3 2 1 3 1 4 2 5 3 160 7 4 8 1 9 0 10 11 2 0 Memory has 3 frames containing pages 0, 1, and 2, where O is the oldest page. RS is the page Referencing String for time t from 0 to 11. (1) Using optimal page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only) (2) Using FIFO page replace algorithm, how many page faults will occur? Which page is in page frame O when this program runs to completion? (put your answer in the following blanks from left to right, answer only)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Memory
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS