1. The feedback algorithm favored short processes without having service time estimates. How is it able to do that?

2. Use the following table of processes and perform the scheduling algorithms below. Show each one as shown in the book/slides, where there is a graphical view of how the jobs run, as well as a table showing the Finish Time, Tr, and Tr/Ts of each one.

Process Arrival Time Service Time

A 0 3

B 1 4

C 3 5

D 5 2

E 7 3

a) RR (quantum=1)

b) Feedback (use 3 queues, quantum=1 for each queue)