1. Solve the following processes in table, by using Shortest Job First (non-preemptive method) and calculate average waiting time. Process Burst Time P1 P2 P3 P4 P5 5 4 8 9 3 نیا

If a sporadic implicit deadline task set is schedulable under RM, will it be schedulable under RM after enlarging one of the deadlines (now it becomes an arbitrary deadline task set)? Note that we are still following the original RM priority order (not DM). What if we follow DM order?

Edward is working in fortune 100 company and he is assigned a task to calculate the theoretical cycle time of the enquiry process that is recently implemented in their company. Given rework probability is 0.2. Help Edward in finding the overall cycle time. response approved Register ministerial inquiry Investigate ministerial Prepare miništerial response Review ministerial response Inquiry Ministerial inquiry receivéd Ministerial correspondence addressed response not approved Cycle time Processing time 2 days Task Register ministerial enquiry 30 min Investigate ministerial enquiry 8 days Prepare ministerial response Review ministerial response 12 h 4 days 4 days 4 h 2h

A school schedules classes. After students request courses, a programme will identify the best schedule for everyone.   The school believes it cannot quickly discover the best schedule. Instead, they employ a simpler technique that generates a good but non-optimal schedule faster.   This choice illustrates which principle?