Question

A system that can run multiple concurrent jobs on a single cpu have a process of choosing which taskhast to run when, and how to break them up, called "scheduling". the round-robin policy forscheduling runs each job for a fixed amount of time before switching to the next job. the waiting timefora job is the total time that it spends waiting to be run. each job arrives at particular time forscheduling and certain time to run, when a new job arrives, it is scheduled after existing jobs alreadywaiting for cpu timegiven list of job submission, calculate the average waiting time for all jobs using round-robin policy.the input to the function waitingtimerobin consist of two integer arrays containing job arrival and runtimes, an integer n representing number of jobs and am integer q representing the fixed amount oftime used by round-robin policy. the list of job arrival time and run time sorted in ascending order byarrival time. for jobs arriving at same time, process them in the order they a

Answer 1

what is your company name