You are organizing a big dinner party for your company retreat. To increase social interaction among the various departments in your company, you would like to set up a seating arrangement so that no two members of the same departments are at the same table. Show how to formulate the problem of finding a seating arrangement that meets this objective as a maximum flow problem. Assume that the company has n departments, and the ith department has mi members. Also assume that t tables are available and the jth table has a seating capacity of cj. Provide a step by step algorithm for this problem for maximizing the flow and analyze its running time.

Please give me step by step answers

Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non- preemptive Process Arrival Times Execution Times Service Times sequence Wait Times calculations PO 0 12 P1 21 9 P2 41 6 P3 6 3 Total wait time = ? Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6 respectively. Also, the execution times are changed to 12, 9, 6, and 3. You will be asked to fill table 1 with the numbers like the service times (when is each process serviced), the sequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total wait time. Note for FCFS, it is 1, 2, 3, 4 for P0, P1, P2, and P3; • for the SJN or Shortest Job Next with non-preemptive, PO is #1, P1 may not be #2; for SRT, or shortest remaining time, the preemptive version of SJN, PO is #1, but after 2 time units when P1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 later…

To avoid a standstill, what conditions must be met?

In the code below, three processes are competing for six resources labeled A to F. a. Using a resource allocation graph, show the possibility of a deadlock in this implementation. b. Modify the order of some of the get requests to prevent the possibility of You cannot move requests across procedures, only change the order inside each procedure. Use a resource allocation graph to justify you answer. any deadlock. Void Po () { While (true) { get(A); get(B); get(C); //critical region: //use A, B, C release(A); release(B); release(C); } Void Po () { While (true) { get(D); get(E); get(B); //critical region: //use D, E, B release(D); release(E); release(B); } } Void Po () { While (true) { get(C); get(F); get(D); //critical region: //use C, F, D release(C); release(F); release(D); } }

Consider a single-server queueing system with arrival and service details as: Interarrival times 3 2 6 2 45 Service times 2 5 5845 Prepare simulation table using Event Scheduling / Time Advance Algorithm for the given data. Stop simulation when the clock reaches 20. In the simulation table, include the following: 1) B: Cumulative Busy Time 2) MQ: Cumulative Maximum number of Customers in Queue 3) F: Cumulative number of Customers who spent more than 3 minutes in the system. 1

Credit Scoring

A transaction database contains ten transactions shown below and minimum_support = 30%. Using A-priori, find all frequent itemsets that contain item i. How many frequent itemsets that contain i do we have? TID Items bought { s, u, s, a, n} { s, a, r, a} { s, a, m} 1 2 3 {r, i, c, h, a, r, d} {e,r, i, c} {n, i, c, k} {p, a, t, r, i, c, k} {e, m, i, 1, y} {c,h, a, r, l, e, s} 6. 7 8 9. 10 [lidal

Draw an ERD for the following situation. Each sales representative writes many invoices. Each invoice is written by one sales representative. Each sales representative is assigned to one department. Each department has many sales representatives. Each customer can generate many invoices. Each invoice is generated by one customer

Please answer question b and show all the work.