It's b. Windows follow this Operation. On Fri, Dec 7, 2012 at 4:21 AM, manish <narayan.shiv...@gmail.com> wrote:
> Four processes of 1gb,1.2gb,2gb,2gb are there and RAM available is 2gb. > We have a > time shared system. Which of the following is the most appropriate > scheduling algorithm? > a. all processes are loaded sequentially 1 by 1 > b. load one process at a time and execute processes in RR fashion > c. load 1gb, 1,2gb first then processes 3 and 4 follow > d. All processes can be loaded together and CPU time shared among them > > -- > > > --
