Machanz.. one of my friend wants his project done ASAP... podi sup ekak oona..
cn u giv d solution for the below problem...
Prob 1
round robin is an algorithm which is used to pass the controller with pre allocated time quanta in some rational order in a cyclic model .A simple way to tink of is that it is about "taking turns"until we complete all the given tasks
A computer operates on a time quantam of 4 and uses round robin scheduling.write a program that will accpet a list of tasks and their burst times and output the order in which the tasks will be executed.
Prob 2
a computer operates an a FIFO basis .write a programe which will accept a list of jobs and their burst times and output their waiting times.use an abstract data type that is not an array
simulation procedure:-
step 1 ;key-in the job size{in-returns of unit time}in to the job queue.
step 2 ;simulate how the CPU PROVIDES THE SERVICES TO THE JOBS WAITING IN THE JOB QUEUE.
cn u giv d solution for the below problem...
Prob 1
round robin is an algorithm which is used to pass the controller with pre allocated time quanta in some rational order in a cyclic model .A simple way to tink of is that it is about "taking turns"until we complete all the given tasks
A computer operates on a time quantam of 4 and uses round robin scheduling.write a program that will accpet a list of tasks and their burst times and output the order in which the tasks will be executed.
Prob 2
a computer operates an a FIFO basis .write a programe which will accept a list of jobs and their burst times and output their waiting times.use an abstract data type that is not an array
simulation procedure:-
step 1 ;key-in the job size{in-returns of unit time}in to the job queue.
step 2 ;simulate how the CPU PROVIDES THE SERVICES TO THE JOBS WAITING IN THE JOB QUEUE.
Last edited:
i did that .. PM me 
