4. Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 9, 13, 2, and 7 resources, respectively. There are no current outstanding queued unsatisfied requests. PID 10 11 12 13 14 Table 1: Allocation R1 R2 R3 1 5 0 0 0 2 0 1 0 4 1 2 3 0 1 R4 2 0 1 1 3 PID 10 11 12 13 14 Table 2: Max Need R1 R2 R3 R4 3 7 1 2 1 3 2002 5 3 coco co 3 4 3 2 1 0 2 WANIN 1 2 4 3 Is the system currently in a safe or unsafe state? If safe, provide the process execution order.

4. Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 9, 13, 2, and 7 resources, respectively. There are no current outstanding queued unsatisfied requests. PID 10 11 12 13 14 Table 1: Allocation R1 R2 R3 1 5 0 0 0 2 0 1 0 4 1 2 3 0 1 R4 2 0 1 1 3 PID 10 11 12 13 14 Table 2: Max Need R1 R2 R3 R4 3 7 1 2 1 3 2002 5 3 coco co 3 4 3 2 1 0 2 WANIN 1 2 4 3 Is the system currently in a safe or unsafe state? If safe, provide the process execution order.

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

Deadlock detection and recovery: Select all of the following statements that are true. A wait-for graph can be constructed from a resource allocation graph by eliminating the resources and collapsing the associated edges. A forced termination of one process to recover from a deadlock never has any side effects on other processes running in the system. In order for a process to be able to return to a previous state, at least one checkpoint of a safe process state is needed. Deadlock detection must be carried out after every resource allocation which cannot be immediately granted. At the start of the banker's algorithm, "Work" refers to the actually available system resources. One sign of a deadlock is that many processes are waiting, although the CPU is not busy.
This quesiton are for another page I will linked them.
Consider a file system that uses indexed allocation with a maximum of one index node per file. Suppose the index node occupies 4096 bytes, that each block pointer occupies 4 bytes. Ignore the metadata associated with the file that is usually contained in the index node. How large should a block be (in bytes) so that this scheme is able to completely access files on a 1 GB file system?
Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)
a. b. C. d. e. f. After many insertions and deletions of items to a circular queue; the final status looks like the figure given below: myFront = 4 and myBack = 2 1 myBack 0 X P A D 3 How many items are in the circular queue? What are the items? (Write characters) What is the front item (letter) in the queue? What is the rear item (letter) in the queue? If 'F' is inserted in the existing queue; what will be the value of myBack and myFront? myFront = and myBack = If the front item is removed; myBack? myFront = myFront what will be the value of myFront and and myBack =
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer thread do {…produce next item…wait(empty); wait(mutex);…add the item to buffer…signal(mutex); signal(full);} while (1);//Consumer thread do {wait(full) wait(mutex);…remove next item from buffer…signal(mutex); signal(empty);…consume the item } while (1);
Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among processes and uses a linked list to keep track of free spaces (hereafter referred to as the free list) in the memory at any given time. Assume that there are 6 processes and assume that their memory size requirements (in bytes) are as given below: Р1: 500, Р2: 600, Р3: 1300, Р4: 2000, Р5: 100, Р6: 200 Assume that the initial state of the free list is as shown below (BA is the base address and Sz is the size of each free space): ВА: 0; Sz: 1100 — ВА: 1200; Sz: 600 > BА: 2000; Sz: 1800> ВА: 6000%; Sz 400
2 Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 11, 13, 7, and 9 resources, respectively. There are no current outstanding queued unsatisfied requests. Table 1: Allocation Table 2: Max R3 R4 PID R.1 R2 R3 R4 PID R1 10 4 11 3 12 1 215 2 1 3 10 13 0 5 0 14 1 3012 4 11 12 012 1 13 1 14 231323 75524 R2 5 5 432300 36373 8 Is the system currently in a safe or unsafe state? If safe, provide the process execution order. If unsafe explain your answer.
correct answer is 13. Can you explain by sperately please?
Concurrent Processes / Monitors select which is true options: a CV (condition variable) queues in a monitor store suspended processes waiting on the corresponding condition. b The "Signal and Wait" approach (Hoare semantics) leads to more efficient implementation and reduces the number of context switches. c Two or more processes can be active in the same monitor simultaneously. d When the "Signal and Continue"-approach (Mesa semantics) is applied, the signaling process P continues executing. e The monitor-based solution to the Dining-Philosophers problem discussed in class is restricted to 5 philosophers.