Back to the 2022 paper
Similar questions
OPERATING SYSTEMFive batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6 and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 7, 9 and 4, respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the waiting time for each process and the average waiting for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound: (a) Priority scheduling (b) FCFS (run in order 15, 9, 3, 6 and 12) (c) Shortest job first202214mOperating SystemDiscuss multiprocessor scheduling and real-time scheduling techniques.20257mOperating SystemDescribe the fundamental role of "Process Scheduling" in a multiprogramming operating system. Identify and explain at least three scheduling criteria.20247mProfessional Skill DevelopmentChoose the correct option / answer the following: Time management is best defined as: (i) Completing tasks as fast as possible (ii) Delegating all tasks to others (iii) Prioritizing and scheduling tasks efficiently (iv) Doing multiple tasks simultaneously20242m