1- First come first served (FCFS). 2- Shot job first(SJF) non- Preemptive. Draw the Gantt chart for the following task given in the table and find the average waiting time. اقل PROCESS BURST ARRIVAL TIME TIME P1 13 3-Shot job first(SJF) Preemptive. P2 19 4- Round Robin(RR) when quantum= 5MS. P3- 5 G LOOD. كل 5 يحول P4 10 tion for the P5 28 0 5469 с ٤ о

Eight batch jobs arrive almost at the same time in the following order: I₁, 2, ..., II8. The table below contains their running times and priorities: Job П1 П2 П3 П4 П П П П Running time (in min) 4 5 5 10 8 10 7 Priority 1 7 5 2 8 6 4 3 The highest priority is 1. For each of the following scheduling algorithms, determine the order of execution of processes and the mean process turnaround time: (a) priority scheduling; (b) first-come, first-served; (c) shortest job first. Scheduling is non-preemptive.

Utilise the FrequencyCounter instrument to use Stopwatch and StdDraw to create a plot with the number of get() or put() calls on the x-axis, the total running time on the y-axis, and a point representing the cumulative time after each call. Use SequentialSearchST and BinarySearchST to run your Tale of Two Cities programme, then compare the results. Note: Caching, which is outside the purview of this inquiry, may account for sharp leaps in the curve.

Consider the following task set. Task T T1 1 3 T2 2 4 T3 1 6 Using a timeline, show how a cyclic executive can be constructed for the task set. You may assume that the tasks can be arbitrarily “split up", but only at integer execution-time points. Thus, cach split-part of a task will have an integer execution time.

Given the following mix of tasks, task lengths, and arrival times, compute the response time for each task, along with the average response time for the FIFO, RR, and SJF algorithms. Assume a time slice of 20 milliseconds and that all times are in milliseconds. Task 0 1 2 3 4 Length 90 30 40 20 50 Arrival Time 0 15 15 80 85

Question p Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line