Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Please check the image and provide solution, thank you. Identify the (three) dif

ID: 3550034 • Letter: P

Question

Please check the image and provide solution, thank you.

Identify the (three) different levels of scheduling and explain their function in 1-2 sentences Which of the following scheduling algorithms could result in starvabon? Justify your answer First-Come First-Served (FCFS) Shortest Job First (SJF) (non-preemptive) Shortest Remaining Time First (SRTF) (preemptive) Round Robin (RR) Priority From the scheduling algorithms mentioned above, which one is depicted in Figure 1? Assume that P6 is the only task that completes I/O and gets added to the end of the queue. Justify your answer If you had to minimize average response time, which preemptive scheduling algorithm would you choose and why? What if you had to choose from non-preemptive ones? Explain the difference between throughput and turnaround time. Use your explanation and/or an example scenario to answer the following question: Will a scheduling algorithm that maximizes throughput always minimize turnaround time? Consider N processes sharing the CPU in a round-robin fashion (N>=2). Assume that each context switch takes S msec and that each time quantum is Q ms. For simplicity, assume that processes never block on any event and simply switch between the CPU and the ready queue. What is the maximum consecutive period of time any process remains in the ready queue (i.e.. the max waiting time) expressed in terms of N, S, and O? Now let N=3 and Q=10ms, with process Pi requiring Ti ms of CPU process time, where i=0,1,2. Given that T1 =6ms, T2=9ms, and T3=12ms, what is the average waiting time?

Explanation / Answer

fcfs is the best


2nd priority and preamption is the 2nd best schedu;lling