5- Draw gantt chart and calculate the average time using the given table by priority algorithm, considering the heist priority is 1: Process Burst time P1 P2 P3 P4 P5 10 1 2 1 5 Priority 3 1 45 4 5 2

3.) The plan-view sketches of benchmark leveling run is shown below. Along each line representing a sight is the value of the rod reading for that sight. The numbering of the TPS shows the direction of the level run. Place the data in the form of the field notes table. Include arithmetic check. Determine the misclosure error in the survey. BM 14, 48.292 7.485 TP 1 2.641 10.260 3.982 1.485 8.643 TP 2 TP 3 9.829 2.247 7.642 8.636 BM 38

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?

With the table below, draw the Gantt chart and solve the scheduling criteria. Process Burst time (BT) PL Arrival Time (AT) A 8 8 5 B 4 4 0 C 3 5 3 D 6 3 12 E 4 10 8 HPL = 10

A mixed strategy for adjusting capacity is simpler and easier to implement than any pure strategy. Select one: O True O False

How would I fill out the Gant Chart using the Shortest Job First (SJF) operating system algorithm?

Given the following jobs/processes, job lengths, and arrival times, compute the completion time,turnaround time, and waiting time for each job in a table. Draw the Gantt chart and suggest anapplication for each job. (Consider 5 as a highest priority and 0 as a lowest priority).a. First Come First Serve (FCFS)b. Shortest Job First Scheduling (SJF) algorithm.c. Shortest Remaining time (SRT) algorithm.BN104 Operating System 4Prepared by: Archana Banepali Moderated by: Dr Rajan Kadel T1, 2023Question 4d. Non-preemptive priority scheduling algorithme. Pre-emptive priority Scheduling algorithmf. Round-Robin Scheduling algorithm (consider time slice is 4ms).Process Burst Time ArrivalTimePriorityP1 11 2 3P2 28 1 1P3 2 3 4P4 10 4 2P5 16 5 5Table: Processes with Arrival Time, Burst Time and Priority

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