Operating Systems Concepts - Engineering

Q1:

Round-robin scheduling

A allows interactive tasks quicker access to the processor

B is quite complex to implement

C gives each task the same chance at the processor

D allows processor-bound tasks more time in the processor

E None of the above

ANS:C - gives each task the same chance at the processor

Its ann algorithm assigns a time slot to each processes. Each process is assigned the processor only during that time Slice.