Learning Outcomes:

Problem No$\mathrm{.}1$: Consider a system that predicts the length of the

next CPU burst using exponential averaging. The system keeps a

record of the actual CPU bursts and uses the formula:

$n+1=*tn+(1-)*n$

Given the following sequence of actual CPU burst times $($in

milliseconds$)$: $8,5,7,3,$ and the initial prediction $0$ is $6ms.$ Assume

the weighting factor $$ is $0\mathrm{.}5.$

Calculate the predicted CPU burst time after the first actual burst

$($i$.$e$.,$ for $2).$

Calculate the predicted CPU burst time after all the given actual

bursts $($i$.$e$.,$ for $5).$

Explain the impact of setting $$ to $0$ and to $1$ in terms of the

system's responsiveness to recent CPU burst times versus its

stability.

Using the expanded formula:

$n+1=*tn+(1-)**tn-1+$dots$+(1-)j**tn-j+$dots$+$

$(1-)n+1*0$