scheduling algorithms

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the...

A uni-processor computer system only has two processes, both of which alternate $$10$$ $$ms$$ $$CPU$$ bursts with $$90$$ $$ms$$ $${\rm I}/O$$ bursts. Both the processes were create...

Which of the following scheduling algorithms is non-preemptive?

Which of the following scheduling algorithms is non-preemptive?

Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will...

Four jobs are waiting to be run. Their expected run times are $$6, 3, 5$$ and $$x$$. $${\rm I}$$n what order should they be run to minimize the average response time?