192 44 A precedence graph is a directed, acyclic graph. Nodes represent tasks, and arcs indicate the order in which tasks are to be accomplished. In particular, a task can execute as soon as all its predecessors have been completed. Assume that the tasks are processes and that each process has the following outline: Chapter 4 Semaphores process T { wait for predecessors, if any; body of the task; signal successors, if any; } (a) Using semaphores, show how to synchronize five processes whose permissi- ble execution order is specified by the following precedence graph: T₁ T₂ T3 T4) T5 Minimize the number of semaphores that you use, and do not impose constraints not specified in the graph. For example, T2 and T3 can execute concurrently after T1 completes.

192 44 A precedence graph is a directed, acyclic graph. Nodes represent tasks, and arcs indicate the order in which tasks are to be accomplished. In particular, a task can execute as soon as all its predecessors have been completed. Assume that the tasks are processes and that each process has the following outline: Chapter 4 Semaphores process T { wait for predecessors, if any; body of the task; signal successors, if any; } (a) Using semaphores, show how to synchronize five processes whose permissi- ble execution order is specified by the following precedence graph: T₁ T₂ T3 T4) T5 Minimize the number of semaphores that you use, and do not impose constraints not specified in the graph. For example, T2 and T3 can execute concurrently after T1 completes.

Fundamentals of Information Systems

8th Edition

ISBN:9781305082168

Author:Ralph Stair, George Reynolds

Publisher:Ralph Stair, George Reynolds

Chapter3: Database Systems And Applications

Section: Chapter Questions

Problem 2.1DQ

See similar textbooks

Similar questions

1. Write a program (WAP) to create an undirected graph using adjacency matrix representation.Number of nodes and edges should be taken from the user. After creating the graph, performfollowing operations: (i) Search a node. Take the node number from the user. If the node is found then print its associatededges.(ii) Insert a node in the graph.(iii) Insert an edge in the graph. Take the node numbers from the user between which the edge is tobe inserted.(iv) Delete a node from the graph. Take the node number to be deleted from the user.(v) Apply DFS on the graph and print the graph traversal.(vi) Apply BFS on the graph and print the graph traversal.2. Solve the above problem using adjacency list representation.
92. An edge from process Pi to Pj in a wait for graph indicates that : a. Pi is waiting for Pj to release a resource that Pi needs b. Pj is waiting for Pi to release a resource that Pj needs c. Pi is waiting for Pj to leave the system d. Pj is waiting for Pi to leave the system
unique please Your task for this assignment is to identify a spanning tree in one connected undirected weighted graph using C++. Implement a spanning tree algorithm using C++. A spanning tree is a subset of the edges of a connected undirected weighted graph that connects all the vertices together, without any cycles. The program is interactive. Graph edges with respective weights (i.e., v1 v2 w) are entered at the command line and results are displayed on the console. Each input transaction represents an undirected edge of a connected weighted graph. The edge consists of two unequal non-negative integers in the range 0 to 9 representing graph vertices that the edge connects. Each edge has an assigned weight. The edge weight is a positive integer in the range 1 to 99. The three integers on each input transaction are separated by space. An input transaction containing the string “end-of-file” signals the end of the graph edge input. After the edge information is read, the process…
When iterating over a hierarchical data structure, such as a tree,Group of answer choices 1. Iterating must be done recursively and it must start at the root, visiting each node once. 2. Iterating must start at the children, and must be done with recursion. 3. Iterating starts at the root but can continue depth first or breadth first, and must be done recursively. 4. Iterating must start at the root and it must traverse nodes exactly once.
3. Assume a graph G = (V, E) represents a computer network where the vertices represent computers and the edges represent point-to-point network connections between the computers. Assume each edge (u, v) of G is associated with a real number f(u,v) between 0 and 1 which represents the probability that the corresponding network connection is faulty. Assume these probabilities are independent. a. Propose an algorithm that finds a path between two given vertices u and v with the smallest probability of being faulty (a path is faulty if at least one of its edges is faulty). b. Analyze the complexity of your algorithm.
Create an algorithm from the description below and give the outputs for it. 1. Make a list of all possible time slots for each course based on faculty availability and available classrooms. 2. Make a graph G = (V, E), where V is the set of nodes representing courses, faculty, and classrooms, and E is the set of edges representing scheduling conflicts. 3. For each course node, add edges to all nodes representing courses that conflict with the course in terms of faculty availability and classroom availability. 4. Apply a graph coloring algorithm to G to find a valid schedule for all courses. 5. Check that the schedule satisfies the constraints: . Room capacity: Ensure that each course is scheduled in a feasible capacity room. . Faculty workload: Ensure that each faculty member is not scheduled for more courses than their workload limit. . Student scheduling conflicts: Ensure that no two courses are scheduled at the same time for students with a scheduling conflict. 6. If the schedule is…
Find the lowest common ancestor (LCA) of v and w given a DAG and two vertices, v and w. The LCA of v and w is a v and w ancestor who has no v and w ancestors who are also ancestors of v and w. Finding the degree of inbreeding in a pedigree graph and other applications involving genealogical data analysis and multiple inheritance in computer languages both benefit from computing the LCA. Hint: In a DAG, define the height of a vertex as the distance along the longest path from a root to the vertex. The tallest vertex among those that are both v and w's ancestors is an LCA of v and w.
For each of the following applications, mention the data structure (list, stack, queue, tree, heap, graph) that will be most suitable to use. (Justify your answer) i). For implementing a priority queue in the operating system, where the highest priority item will be served by the microprocessor. ii). For simulating a social network such as Facebook and Twitter. iii). For implementing Breadth First Search in a graph.
91. The wait-for graph is a deadlock detection algorithm that is applicable when : a. all resources have a single instance b. all resources have multiple instances c. all resources have a single 7 multiple instance d. all of the mentioned
Design and implement a backtracking algorithm that checks to see if two simple graphs are isomorphic. The algorithm must print “not isomorphic”, if the two graphs are not isomorphic. The algorithm must print “isomorphic” and the orderings of the vertices for which their adjacency matrices are equal, if the graphs are isomorphic. Test your implemented algorithm with the three test cases in Project3_TestCases.
Use the PERT diagram shown to the right to answer the following questions. Assume that time is measured in days.a. Find a critical path for task G.b. Find a critical path for task H.c. Find a critical path for the vertex "End."d. On what day will task F begin?e. On what day will task G begin?f. How many days are required to complete this project?
Write a program (WAP) to create an undirected graph using adjacency matrix representation.Number of nodes and edges should be taken from the user. After creating the graph, performfollowing operations: (i) Search a node. Take the node number from the user. If the node is found then print its associatededges.(ii) Insert a node in the graph.(iii) Insert an edge in the graph. Take the node numbers from the user between which the edge is tobe inserted.(iv) Delete a node from the graph. Take the node number to be deleted from the user.(v) Apply DFS on the graph and print the graph traversal.(vi) Apply BFS on the graph and print the graph traversal.Solve the above problem using adjacency list representation.