Allocation Matrix A   R1 R2 R3 P1 2 2 0 P2 3 2 0 P3 1 1 3 P4 0 0 2

3

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…

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…

Draw an ERD for the following scenario: A department employs many employees, but each employee is employed by one department. Each employee has the following characteristics: emp_Num, emp_FName, empLName, empAdress. Each department has a code and a name. Some employees, known as “rovers,” are not assigned to any department. A division operates many departments, but each department is operated by one division. Each division has a code and a name. An employee may be assigned many projects, and a project may have many employees assigned to it. Each project has a code and a name. An assignment is characterized by a date and number of hours.   A project must have at least one employee assigned to it. One of the employees manages each department, and each department is managed by only one employee. One of the employees runs each division, and each division is run by only one employee.

Consider a point to point link 50 km in length. At what bandwidth (Kilo Bytes/second), would propagation delay (at a speed 2 x 108  meters/second) equal transmit delay for 100 byte packets?

Given a system of 4 processes with a set of constraints described by the following precedence relation: › : {(P1, P3), (P1, P4), (P2, P4)} The processes access memory locations according to the table attached. Answer the following questions about the system (you are not required to draw any graphs): 1. Is the system determinate for all interpretations of its processes? Explain why. 2. Is the process pair (P3, P4) mutually non-interfering (MNI)? Explain why. 3. If the process pair (P3, P4) is not MNI, what modifications are necessary to guarantee that the system is determinate for all interpretations?

Create an ER Diagram for the following scenario. Please state any assumptions you have madein your answer.A university offers a Mathematics program. This program can offer any amount ofcourses in a semester. Each course has a roster limit, location and time slot. A studentcan be registered for any number of courses in a semester but to register for a coursethey must have a valid student ID and address. Each course is assigned a singleprofessor. Only on completion of a course, a student receives a final grade for thatcourse.