Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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?

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?

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
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:

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

 

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

 

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

 

  1. 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:

 

  1. External fragmentation
  2. Internal fragmentation
  3. 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

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Encryption and decryption
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
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

Expert Answers to Latest Homework Questions

Q: A continuous flow calorimeter was used to obtain the calorific value of a sample of fuel and the…
Q: Sketch and explain a PV Diagram and a Temperature Entropy Diagram for a 4 stroke diesel engine
Q: A three-phase transmission line supplies power to three loads at a voltage 408 Vrms (line to line).…
Q: answer the fallowing Brake Specific Fuel Consumption - 0.3 kg/kwh, Mechanical Efficiency- 90%…
Q: A homeware company has been approached to manufacture a cake tin in the shape of a "ghost" from the…
Q: Can you help me to solve the question?
Q: Define sinc(x) = sin(x)/x, except with the singularity removed.  Differentiate sinc(x) once and…
Q: Use Taylor Series to derive the entries to the pentadiagonal and heptadiagonal (septadiagonal?)…
Q: Show that the function f(x) = sin(x)/x has a removable singularity.  What are the left and right…
Q: 1.5. Run Programs 1 and 2 with esin(x) replaced by (a) esin² (x) and (b) esin(x)| sin(x)|| and with…
Q: 1.6. By manipulating Taylor series, determine the constant C for an error expansion of (1.3) of the…
Q: 1.3. The dots of Output 2 lie in pairs. Why? What property of esin(x) gives rise to this behavior?
Q: 1.4. Run Program 1 to N = 216 instead of 212. What happens to the plot of error vs. N? Why? Use the…
Q: Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user…
Q: #include <linux/module.h> #include <linux/kernel.h> // part 2 #include…
Q: 2. UNIX Shell and History Feature [20 points] This question consists of designing a C program to…
Q: The following data were taken during a one-hour trial run on a single cylinder, single acting,…
Q: List at least five Operating Systems you know. What is the difference between the kernel mode and…
Q: Question#2: Design and implement a Java program using Abstract Factory and Singleton design…
Q: In the GoF book, List interface is defined as follows: interface List { int count(); //return the…
Q: General accounting