Consider a system with 14 dedicated devices of the same type. all jobs currently running on this system require a maximum of five devices to complete their execution but they each run for long periods of time with just three devices and request the remaining two only at the very end of the run. assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: no job will be started unless all the required drives have been allocated to it for the entire duration of its run. using banker's algorithm,
a. what is the maximum number of jobs that can be in progress at once? explain your answer.
b. what are the minimum and maximum number of devices that may be idle as a result of this policy? under what circumstances would an additional job be started?

How can a broadcast station be received through cable and satellite systems?

Which factor is the most important when choosing a website host? whether customers will make secure transactions the number of email accounts provided the purpose of the website the quality of the host control panel

Jason, samantha, ravi, sheila, and ankit are preparing for an upcoming marathon. each day of the week, they run a certain number of miles and write them into a notebook. at the end of the week, they would like to know the number of miles run each day, the total miles for the week, and average miles run each day. write a program to them analyze their data. your program must contain parallel arrays: an array to store the names of the runners and a two-dimensional array of five rows and seven columns to store the number of miles run by each runner each day. furthermore, your program must contain at least the following functions: a function to read and store the runners’ names and the numbers of miles run each day; a function to find the total miles run by each runner and the average number of miles run each day; and a function to output the results. (you may assume that the input data is stored in a file and each line of data is in the following form: runnername milesday1 milesday2 milesday3 milesday4 milesday5 milesday6 milesday7.)