Answered: Consider the following snapshot of a…

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

Related questions

Question

100%

Consider the following snapshot of a system:

Allocation Max Available
A B C D A B C D A B C D

T0                3 1 4 1              6 4 7 3              2 2 2 4
T1                2 1 0 2              4 2 3 2
T2               2 4 1 3              2 5 3 3
T3                4 1 1 0              6 3 3 2
T4                2 2 2 1             5 6 7 5

Answer the following questions using the banker’s algorithm:

Illustrate that the system is in a safe state by demonstrating an
order in which the threads may complete.

If a request from thread T4 arrives for (2, 2, 2, 4), can the request be
granted immediately?

If a request from thread T2 arrives for (0, 1, 1, 0), can the request be
granted immediately?

If a request from thread T3 arrives for (2, 2, 1, 2), can the request be
granted immediately?

Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB,

and 185 MB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 200 MB, 15 MB, 185 MB, 75 MB, 175 MB, and 80 MB (in order)? Indicate which—if any—requests cannot be satisfied. Comment on how efficiently each of the algorithms manages memory.

Compare the memory organization schemes of contiguous memory allocation and paging with respect to the following issues:

External fragmentation
Internal fragmentation
Ability to share code across processes

Apply the (1) FIFO, (2) LRU, and (3) optimal (OPT) replacement algorithms for the following page-reference strings:

2, 6, 9, 2, 4, 2, 1, 7, 3, 0, 5, 2, 1, 2, 9, 5, 7, 3, 8, 5

0, 6, 3, 0, 2, 6, 3, 5, 2, 4, 1, 3, 0, 6, 1, 4, 2, 3, 5, 7

3, 1, 4, 2, 5, 4, 1, 3, 5, 2, 0, 1, 1, 0, 2, 3, 4, 5, 0, 1

4, 2, 1, 7, 9, 8, 3, 5, 2, 6, 8, 1, 0, 7, 2, 4, 1, 3, 5, 8

0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 0, 1, 2, 3, 4, 4, 3, 2, 1, 0

Indicate the number of page faults for each algorithm assuming demand paging with three frames.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions