(b) Analyze a system that is composed of the sets Process (P), Resource (R), and Edges (E) where: P = {P1, P2, P3, P4, P5, P6} R = {R1, R2, R3, R4} E = {P1>R1, R1→P2, R1 P4, R1>P5, P1>R2, P2 R2, R2 P3, R2→P6, P4>R2, P5>R2, R3>P2, R3>P3, R3->P6, P5→R3, P3>R4 and P6>R4} Assume R1 and R3 have three (3) instances each and R2 have two instances. Whereas R4 is the sum of the first and last digit of your roll number. R1, R2, R3, and R4 are non- preemptive and cannot be shared (i) Design a resource allocation graph and a wait-for-graph. (ii) Briefly explain whether a deadlock exists in the system? Note: For the value of R4, if your roll number is 2019-SE-336 then the instance value of R4= 3+6= 9.

(b) Analyze a system that is composed of the sets Process (P), Resource (R), and Edges (E) where: P = {P1, P2, P3, P4, P5, P6} R = {R1, R2, R3, R4} E = {P1>R1, R1→P2, R1 P4, R1>P5, P1>R2, P2 R2, R2 P3, R2→P6, P4>R2, P5>R2, R3>P2, R3>P3, R3->P6, P5→R3, P3>R4 and P6>R4} Assume R1 and R3 have three (3) instances each and R2 have two instances. Whereas R4 is the sum of the first and last digit of your roll number. R1, R2, R3, and R4 are non- preemptive and cannot be shared (i) Design a resource allocation graph and a wait-for-graph. (ii) Briefly explain whether a deadlock exists in the system? Note: For the value of R4, if your roll number is 2019-SE-336 then the instance value of R4= 3+6= 9.

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

Related questions

Q: P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The…

A: a) The resource allocation diagram is the picture of the system status at a certain time. The…

Q: P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The…

A: a) Basically, a resource allocation graph is a graph that is used to explain that what is the state…

Q: P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The…

A: Given: P is a set of processes. R is a set of resources. E is a set of request or assignment edges.…

Q: For the traversal log: {X, Y, Z, W, Y, A, B, C, D, Y, C, D, E, F, D, E, X, Y, A, B, M, N}, a. Find…

A: Given, The traversal log: {X, Y, Z, W, Y, A, B, C, D, Y, C, D, E, F, D, E, X, Y, A, B, M, N}

Q: For the traversal log: {X, Y, Z, W, Y, A, B, C, D, Y, C, D, E, F, D, E, X, Y, A, B, M, N}, a. Find…

A: For the traversal log:{X,Y,Z,W,Y,A,B,C,D,Y,C,D,E,F,D,E,X,Y,A,B,M,N} a. Find maximal forward…

Q: Draw the portion of the state space tree generated by LCBB for the following instances. n = 4, m =…

A: The Answer is in Below Steps

Q: Draw the portion of the state space tree generated by LCBB for the following instances. n = 4, m =…

A: A state-space tree is the tree of the development of the arrangement from fractional arrangement…

Q: given a coordinated chart G which can contain circles (edges from a vertex to itself). Multi-edges…

A: Here have to determine about coordinated chart problem statement.

Q: Consider the set of resources (R), processes (P), and set of edges V. Answer the questions below. P…

A: To detect cycle we need to draw the resource allocation graph. P1->R2 means P1 has requested one…

Q: In operating systems or database systems, multiple processes have to access shared resources…

A: Answer Bankers algorithm includes a Safety Algorithm / Deadlock Detection Algorithm The algorithm…

Q: You are given a tree with n vertices numbered 1,… ,n. A tree is an associated basic diagram without…

A: Here have to determine about the Range Diameter Sum programming problem statement.

Q: consider cells of a square network n×n as contiguous in the event that they have a typical side,…

A: Here have to determine about square network problem statement in python.

Q: Consider a state space where the start state is number 1 and each state k has two successors:…

A: STATE SPACE FOR STATES 1 TO 15: This is the state space for the states from 1 to 15.

Q: a) Given a depth-first search tree T, the set of edges in T are referred to as "tree edges" while…

A: The program is written in c. (i) The program to test the connectivity of a graph using depth first…

Q: Show that the property of being connected is an equivalence relation. That is, for any undirected…

A: Actually, The given information is: That is, for any undirected graph and any two vertices,v, and w,…

Q: Let G = (X ∪ Y, E) be a bipartite graph such that the vertices are partitioned into two groups X and…

A: Please see the next step for solution.

Q: characterize the distance between two volunteers I and j, dis(i,j) as the number of edges on the…

A: Here have to determine about portion of the volunteers programming problem statement.

Q: Let ƒ be an s,t-flow in an s, t-network D = (V, A) with capacities c : A → R>0; and assume that…

A: Given Maximum flow problem and asked to Explain f(a,b)=c(a,b)

Q: a) Given a depth-first search tree T, the set of edges in T are referred to as "tree edges" while…

A: The program is written in c.

Q: 8. В 11 Suppose Dijkstra's algorithm is being run from vertex A and vertices A and C are in the…

A: 1. Suppose Dijkstra's algorithm is being run from vertex A and Vertices A and C are in the shortest…

Q: Draw the portion of the state space tree generated by LCBB for the Knapsack instance n = 5, (p,, P2…

A: The Answer is in below step

Q: We say a graph G = (V, E) has a k-coloring for some positive integer k if we can assign k different…

A: Answer: Graph Colouring: Let G be graph and m be a given positive number. With m colours we have…

Q: Q. For a given graph G = (V,E), a subset SCVIS called an independent set if (u,v) E E for every pair…

Q: a) Given a depth-first search tree T, the set of edges in T are referred to as "tree edges" while…

A: #include<stdio.h>void DFS(int);int G[10][10],visited[10],num; //num is no of vertices and…

Q: framework of size n×m, with the end goal that every cell of it contains either 0 or 1, is considered…

A: Here have to determine about c++ code for square matrices problem statement.

Q: In breadth-first and depth-first search, an undiscovered node is marked discovered when it is first…

A: Actually, graph is a non linear data structure which consist of edges and nodes.

Q: Let A and B each be sets of N labeled vertices, and consider bipartite graphs between A and B. 1.…

A: Let A and B each be sets of N labeled vertices, and consider bipartite graphs between A and B. 1.…

Q: Let U = {a1, a2, a3, ... , an, b1, b2, b3, ..., bm, C1, C2, C3, .. Cx} be a set roster of elements…

A: - The questions are to:: examine the provided sets operations over [A] ∩ [B] , [B] ∩ [A] and [A] ∩…

Q: Consider the following adjacency-lists representation of a graph with 8 vertices and 10 edges: A: B:…

A: Breadth First Search (BFS) is the search algorithm in which we check for the adjacent or neighbor…

Q: Give the internal vertices of the ff. rooted tree: a b. k 1 тп O e, f, I, m, n O e, g, i, k, I, m,…

A: The answer is given below:-

Q: Consider the reduction from 3-CNF-SAT to CLIQUE. For the formula ϕ = (x2 ˅ x3 ˅ x4) ˄ (x1 ˅ ¬x2 ˅…

A: The vertices for all 4 clauses and all the edges between the vertices of clause C1 = (x2 ˅ x3 ˅ x4)…

Q: Consider the reduction from 3-CNF-SAT to CLIQUE. For the formula ϕ = (x2 ˅ x3 ˅ x4) ˄ (x1 ˅ ¬x2 ˅…

A: 3-CNF-SAT is the special case satisfiability problem where the formulas are with Boolean variable or…

Q: (a) Recall that the path graph on n vertices has vertex set V = {1,.., n} and edge set E = {{i,i+1}…

A: According to the information given:- We have to recall that path graph on n vertices has vertex set…

Q: Consider the relation R defined on the set Z x Z: R = {((a,b),(c,d)) | a = c (mod 4) a b = d (mod…

A: given that

Q: For the following directed graph, let E = {I,J,K,L,M} and let V = {a,b, c, d}. %3D a d M b K For…

A: Given graph contains, 5 edges= {I, J, K, L, M} 4 vertices= {a, b, c, d} Indegree of the vertex is,…

Q: Show an example of a subgraph, spanning subgraph, induced subgraph of the complete graph. V =…

A: Graph is a pair of vertex and edge, Where Vertex will be represented by V, and the edges will be…

Q: Consider the Byzantine Generals problem in distributed systems with the nodes a, b, c and d. Write…

A: Practical Byzantine Fault Tolerance (pBFT) pBFT was designed to work efficiently in asynchronous(no…

Q: 6.Implement and simplify f (A, B, C, D) = Σ(1,3,5,8,9,11,13,15) using K-map?

A: Given, A, B, C, D are the inputs, and f (A, B, C, D) is the output. Truth Table: A B C D f (A, B,…

Q: We can define a directed graph by ordering its nodes and arcs. First consider a TXT file in which…

A: Given: We can define a directed graph by ordering its nodes and arcs. First consider a TXT file in…

Q: We can define a directed graph by ordering its nodes and arcs. First consider a TXT file in which…

A: from collections import defaultdict class Graph(): def__init__(self,vertices): self.graph =…

Q: We can define a directed graph by ordering its nodes and arcs. First consider a TXT file in which…

A: Given: We can define a directed graph by ordering its nodes and arcs. First consider a TXT file in…