A system uses 3 page frames for storing process pages in main memory is available. It uses the Least Recently Used (LRU) page replacement policy. What is the miss ratio and hit ratio that will occur while processing the page reference string given below: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2, 6, 7, J1, J2, J3 Where J1, J2 and J3 are the last three digits of your ID. For example, if a student has ID 171-15-12345, then Jl-3, J2-1 and J3=5 Now, Also compare it with the optimal page replacement algorithm.
A system uses 3 page frames for storing process pages in main memory is available. It uses the Least Recently Used (LRU) page replacement policy. What is the miss ratio and hit ratio that will occur while processing the page reference string given below: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2, 6, 7, J1, J2, J3 Where J1, J2 and J3 are the last three digits of your ID. For example, if a student has ID 171-15-12345, then Jl-3, J2-1 and J3=5 Now, Also compare it with the optimal page replacement algorithm.
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
Related questions
Question
100%
Answer 3 a Only!
Last 4 digit of my student id is 1889
![for (0, 0, 1 and 1) resources and another request from P4 for (1, 1, 1 and 1)
resources. Can these requests be granted immediately ensuring the system is
safe? If ves, show the safe sequence. If no, explain it.
Suppose IMB memory is partitioned into some fixed sized blocks each block having a
size of 128KB. The list of request orders is: 50k, 150k, 90k, 130k, 70k, 80k, 120k, 180k,
and 60k. Do you think it is possible for an operating system to serve all the requests by
implementing the memory allocation algorithms? Justify your answer.
2 a.
b.
What will be the dynamic memory allocation in the worst fit manner using the following
information?
Block
В101
B102
В 103
B104
B105
Size
105K
80K
208K
50K
160K
Processes
Size
Turnaround
P1
65K
2
P2
170K
3
P3
200K
P4
90K
2
P5
35K
X+1
P6
100K
X+2
Неге X %3D Your ID%2
3 a.
A system uses 3 page frames for storing process pages in main memory is available. It
uses the Least Recently Used (LRU) page replacement policy. What is the miss ratio and
hit ratio that will occur while processing the page reference string given below:
4, 7, 6, 1, 7, 6, 1, 2, 7, 2, 6, 7, J1, J2, J3
Where J1, J2 and J3 are the last three digits of your ID. For example, if a student has
ID 171-15-12345, then J1=3, J2=4 and J3=5
Now, Also compare it with the optimal page replacement algorithm.
b.
Explain Belady's anomaly using the given string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
2
C.
Suppose a disk drive has 2000 tracks (0-1999) and the disk queue having I/O requests in
the following order as follows:
100, 250, 1500, 750, 950, 200, 1450, 850, 150.1850, 550, 1100, 1720, 90, 310, 280.
350, 480, 1375, 1530, 1780, 1890, 1410, 270, 170
Current position of the Read Write head is 400 and assume that previous request was the
last three digits of your id [Sample: Id 172-15-12345; previous request 345].
Which algorithm/algorithms will perform better for the systems that place a hcavy load
on the disk? Explain your answer. Now calculate the seek distance for your chosen
algorithm.
Best of Luck O](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F08b4673f-b3a1-41bb-b872-13b99a087562%2F798dda5b-bc33-4028-b174-651111efc500%2Flxo19_processed.jpeg&w=3840&q=75)
Transcribed Image Text:for (0, 0, 1 and 1) resources and another request from P4 for (1, 1, 1 and 1)
resources. Can these requests be granted immediately ensuring the system is
safe? If ves, show the safe sequence. If no, explain it.
Suppose IMB memory is partitioned into some fixed sized blocks each block having a
size of 128KB. The list of request orders is: 50k, 150k, 90k, 130k, 70k, 80k, 120k, 180k,
and 60k. Do you think it is possible for an operating system to serve all the requests by
implementing the memory allocation algorithms? Justify your answer.
2 a.
b.
What will be the dynamic memory allocation in the worst fit manner using the following
information?
Block
В101
B102
В 103
B104
B105
Size
105K
80K
208K
50K
160K
Processes
Size
Turnaround
P1
65K
2
P2
170K
3
P3
200K
P4
90K
2
P5
35K
X+1
P6
100K
X+2
Неге X %3D Your ID%2
3 a.
A system uses 3 page frames for storing process pages in main memory is available. It
uses the Least Recently Used (LRU) page replacement policy. What is the miss ratio and
hit ratio that will occur while processing the page reference string given below:
4, 7, 6, 1, 7, 6, 1, 2, 7, 2, 6, 7, J1, J2, J3
Where J1, J2 and J3 are the last three digits of your ID. For example, if a student has
ID 171-15-12345, then J1=3, J2=4 and J3=5
Now, Also compare it with the optimal page replacement algorithm.
b.
Explain Belady's anomaly using the given string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
2
C.
Suppose a disk drive has 2000 tracks (0-1999) and the disk queue having I/O requests in
the following order as follows:
100, 250, 1500, 750, 950, 200, 1450, 850, 150.1850, 550, 1100, 1720, 90, 310, 280.
350, 480, 1375, 1530, 1780, 1890, 1410, 270, 170
Current position of the Read Write head is 400 and assume that previous request was the
last three digits of your id [Sample: Id 172-15-12345; previous request 345].
Which algorithm/algorithms will perform better for the systems that place a hcavy load
on the disk? Explain your answer. Now calculate the seek distance for your chosen
algorithm.
Best of Luck O
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education