Do not share as this will be treated as plagiarism by Blended Learning Center Answer all of the questions. a. "If the resource allocation graph contains cycle/cycles, then the system may or may not be in a deadlocked state." Is this statement true? Explain your answer with a 1 proper example. b. Suppose a system uses Bankers algorithm to avoid deadlock. Consider there are six processes in the system. They need four types of resources: P, Q, R, and S. They have some resources and need more resources to complete their task. The system has 4 instances of resource P, 2 instances of resource Q, 1 instance of resource R and 4 instances of resource S initially available. In the Allocation and Max matrix the value for P, Q. R and S of process Ps will be the last four digits of your own DIU ID. 1 For example, if a student has ID 171-15-12345, then the value for P=2, Q=3, R=4 and S=5 of process P, for Allocation and Max Matrix. Now see the following snapshot and give the answer of the following questions. Process Allocation Proce Маximum es Sses R Q R. 2 2 2 PO 1 PO 3 3 P1 1 3 P1 5 3. P2 2 2 1 3 P2 6 P3 P3 2 2 P4 1 1 1 P4 3 2 2 3 P5 P5 Find out the content of the Need of each process. Find out the safe sequence for the above scenario. Find out the total number of instances of the resource type P, Q, Rand S. 1. I. II. IV. Suppose two requests from two processes come. One request from process P3 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 yes, show the safe sequence. If no, explain it. 2 Suppose IMB memory is partitioned into some fixed sized blocks each block having a 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. b. What will be the dynamic memory allocation in the worst fit manner using the following information? Block BI01 B102 B103 B104 B105 Size 105K 80K 208K 50K 160K Processes Size Turnaround P1 65K 2 P2 170K 3 P3 200K 2 P4 90K 2 P5 35K X+1 ...

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
Answer 1 b only Last 4 digit of my student id is 1889
Do not share as this will be treated as plagiarism by Blended Learning Center
Answer all of the questions.
1
"If the resource allocation graph contains cycle/cycles, then the system may or
a.
may not be in a deadlocked state." Is this statement true? Explain your answer with a
proper example.
b.
Suppose a system uses Bankers algorithm to avoid deadlock. Consider there are six
processes in the system. They need four types of resources: P, Q, R, and S. They have
some resources and need more resources to complete their task. The system has 4
instances of resource P, 2 instances of resource Q, 1 instance of resource R and 4
instances of resource S initially available. In the Allocation and Max matrix the value for
P, Q. R and S of process Ps will be the last four digits of your own DIU ID.
1
For example, if a student has ID 171-15-12345, then the value for P=2, Q=3, R=4 and
S=5 of process Ps for Allocation and Max Matrix.
Now see the following snapshot and give the answer of the following questions.
|Рrосess
Allocation
Ргосe
Мaximum
es
sses
R
S
P.
R
S
PO
1
1
2
РО
3
3
2
2
P1
1
3
2
P1
5
4
1
3
P2
2
3
1
P2
6
3
4
4
P3
2
2
P3
2
2
1
Р4
1
1
1
1
P4
3
2
2
3
P5
P5
1.
Find out the content of the Need of each process.
П.
Find out the safe sequence for the above scenario.
Find out the total number of instances of the resource type P, Q, R and S.
II.
IV.
Suppose two requests from two processes come. One request from process P3
for (0, 0, 1 and 1) resources and another request from P4 for (1, 1, 1 and 1)
resources. Can these requests be granted immedlately ensuring the system Is
safe? If yes, show the safe sequence. If no, explain it.
Suppose 1MB 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,
2
a.
and 60k. Do you think it is possible for an operating syslem to serve all the requests by
implementing the memory allocation algorithms? Justify your answer.
b.
What will be the dynamic memory allocation in the worst fit manner using the following
information?
Block
B101
B102
B103
B104
В105
Size
105K
80K
208K
50K
160K
Processes
Size
Turnaround
P1
65K
2
P2
170K
3
P3
200K
2
P4
90K
2
P5
35K
X+1
P6
100K
X+2
Transcribed Image Text:Do not share as this will be treated as plagiarism by Blended Learning Center Answer all of the questions. 1 "If the resource allocation graph contains cycle/cycles, then the system may or a. may not be in a deadlocked state." Is this statement true? Explain your answer with a proper example. b. Suppose a system uses Bankers algorithm to avoid deadlock. Consider there are six processes in the system. They need four types of resources: P, Q, R, and S. They have some resources and need more resources to complete their task. The system has 4 instances of resource P, 2 instances of resource Q, 1 instance of resource R and 4 instances of resource S initially available. In the Allocation and Max matrix the value for P, Q. R and S of process Ps will be the last four digits of your own DIU ID. 1 For example, if a student has ID 171-15-12345, then the value for P=2, Q=3, R=4 and S=5 of process Ps for Allocation and Max Matrix. Now see the following snapshot and give the answer of the following questions. |Рrосess Allocation Ргосe Мaximum es sses R S P. R S PO 1 1 2 РО 3 3 2 2 P1 1 3 2 P1 5 4 1 3 P2 2 3 1 P2 6 3 4 4 P3 2 2 P3 2 2 1 Р4 1 1 1 1 P4 3 2 2 3 P5 P5 1. Find out the content of the Need of each process. П. Find out the safe sequence for the above scenario. Find out the total number of instances of the resource type P, Q, R and S. II. IV. Suppose two requests from two processes come. One request from process P3 for (0, 0, 1 and 1) resources and another request from P4 for (1, 1, 1 and 1) resources. Can these requests be granted immedlately ensuring the system Is safe? If yes, show the safe sequence. If no, explain it. Suppose 1MB 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, 2 a. and 60k. Do you think it is possible for an operating syslem to serve all the requests by implementing the memory allocation algorithms? Justify your answer. b. What will be the dynamic memory allocation in the worst fit manner using the following information? Block B101 B102 B103 B104 В105 Size 105K 80K 208K 50K 160K Processes Size Turnaround P1 65K 2 P2 170K 3 P3 200K 2 P4 90K 2 P5 35K X+1 P6 100K X+2
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Public key encryption
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