Consider $$n$$ processes sharing the $$CPU$$ in a round-robin fashion. Assuming that each process switch takes $$s$$ seconds, what must be the quantum size $$q$$ such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the $$CPU$$ at least every $$t$$ seconds?

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?

When the result of a computation depends on the speed of the processes involved there is said to be

What is the result of the following program?

program side-effect (input, output);
var x, result: integer:
fucntion f (var x:integer):integer;
begin
    x:x+1;f:=x;
end
begin
    x:=5
    result:=f(x)*f(x)
    writeln(result)
end