i. Consider the free memory layout shown below (the blocks are ordered from top to bottom). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of sizes 187KB, 329KB, 486KB, 407KB and 285KB. 445K 250K 395K 600K 290K 325K 355K a. Draw one memory layout for the Best-fit and Worst-fit. b. Which algorithm makes the efficient use of the memory? Why c. Is there any kind of fragmentation? ii. Given the following stream of page references by an application, calculate the number of page faults the application would incur with the following page replacement algorithms. Assume that all pages are initially free. Reference Stream: D A B FA E A E F DAB C A C F B AFDA BF A E Pages = 4 a. LRU page replacement. b. OPT page replacement.

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

Detailed Answer plzz

i.
Consider the free memory layout shown below (the blocks are ordered from top to
bottom). Draw to what the free memory layouts would be after satisfying requests for (in
order) memory blocks of sizes 187KB, 329KB, 486KB, 407KB and 285KB.
445K
250K
395K
600K
290K
325K
355K
a. Draw one memory layout for the Best-fit and Worst-fit.
b. Which algorithm makes the efficient use of the memory? Why
C.
Is there any kind of fragmentation?
ii.
Given the following stream of page references by an application, calculate the number of
page faults the application would incur with the following page replacement algorithms.
Assume that all pages are initially free.
Reference Stream: D AB FAE A E FDABCAC F BAFDA BF A E
Pages = 4
a. LRU page replacement.
b. OPT page replacement.
Transcribed Image Text:i. Consider the free memory layout shown below (the blocks are ordered from top to bottom). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of sizes 187KB, 329KB, 486KB, 407KB and 285KB. 445K 250K 395K 600K 290K 325K 355K a. Draw one memory layout for the Best-fit and Worst-fit. b. Which algorithm makes the efficient use of the memory? Why C. Is there any kind of fragmentation? ii. Given the following stream of page references by an application, calculate the number of page faults the application would incur with the following page replacement algorithms. Assume that all pages are initially free. Reference Stream: D AB FAE A E FDABCAC F BAFDA BF A E Pages = 4 a. LRU page replacement. b. OPT page replacement.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Arrays
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