Consider a computer system with the following allocation status for four non-sharable resources, A, B, C, D at a certain time:Allocation MaxAvailableАВCDАВCDАВCDPO 010185322301P1 30203220P2 30216022At this instant, PO requests (0, 2, 0, 1). The Operating System applies Banker's Algorithm to decide whether or not to grant this request.Mark all the correct statements below based on this scenario:Need (1) = 0200The system is currently deadlocked.First row of Allocation matrix becomes 0302.Granting this request brings the system to a safe state.Available vector becomes 2100.Need (0) = 8230Need (2) = 3001

Let's calculate the need of each process. Need = maximum - allocation The need matrix A B C D…

Answered: Consider a computer system with the…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Answer the following questions using the Banker’s algorithm:a. What is the content of the matrix Needb. Is the system in a safe state? Explainc. If a request from process P1 arrives for (0,4,2,0), can the request be grantedimmediately? Explain
Question 3 In the homework we saw Turing machines for AND, OR, NOT. Here's the definition for XOR. qo O B q1 q1 BR q2 q0 1 B q3 q3 BR q4 q4 0 1 q5 94 1 0 q6 Trace the machine's execution on input 11 by showing the successive configurations. List one configuration per line with a single space separating each part of the configuration. Recall that the parts of the configuration are in the following order: current-state current-head tape-to-left tape-to- right. Use "e" for e and use it only in the "tape-to-left" or "tape-to-right" positions when there is nothing but blanks in those directions. Otherwise list all characters explicitly (and use B for a blank character when needed). initially q0 1 e 1 Step 1 Step 2 Step 3
For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?
Consider a computer system which has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in any way that is, two in one shot or one by one. The system always satisfies a request for a resource if enough resources are available. If the processes don't request any other kind of resource, show that the system never deadlocks?
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 4T1 2 1 0 2 4 2 3 2T2 2 4 1 3 2 5 3 3T3 4 1 1 0 6 3 3 2T4 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 anorder in which the threads may complete. If a request from thread T4 arrives for (2, 2, 2, 4), can the request begranted immediately? If a request from thread T2 arrives for (0, 1, 1, 0), can the request begranted immediately? If a request from thread T3 arrives for (2, 2, 1, 2), can the request begranted immediately? Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB…
Given a set of jobs {J1, ... , Jn}, each job Ji = < ti, wi > has a required processing time ti and aweight wi. Design an efficient algorithm (pseudo code) to minimize the weighted sum of overallcompletion times ∑ni=1wiCi, where Ci is the completion time of job i. What is the time complexityof your algorithm? Note: You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct;
Consider the following snapshot of a system: Answer the following questions using the banker’s algorithm: a. What is the content of the matrix Need?b. Is the system in a safe state?c. If a request from process P1 arrives for (0, 4, 2, 0), can the request be granted immediately?
Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
Consider the following snapshot of a system: Allocation Мах АВCD АВCD Po P1 P2 P3 P4 3014 5117 2210 3211 3121 3321 0510 4612 4212 6325 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. а. Available 3D (0, 3, 0, 1) b. Available = (1, 0, 0, 2) If a request from process P3 arrives for (3, 0, 2, 0), can the request be granted immediately?
Consider the following snapshot of a system: Allocation Маx Available ABCD ABCD ABCD PO 2001 4212 3321 P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 a. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Ý, and Z to three processes PO, P1, and P2. The table given below presents the current system state. There are 3 instances of type X, 2 instances of type Y and 2 instances of type Z still available. The system is currently in a safe state. Answer the following questions! Allocation Max X Y z X Y PO 0 1 8 4 3 (a) If PO requests 2 instances of Z during the P1 3 2 current state, can it be granted? Explain! (b) If P1 requests 2 instances of X during the P2 2 1 1 3 3 3 current state, can it be granted? Explain! CO

SEE MORE QUESTIONS

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS