Back to the 2025 paper
Similar questions
Operating SystemDescribe the fundamental role of "Process Scheduling" in a multiprogramming operating system. Identify and explain at least three scheduling criteria.20247mOperating SystemWhich scheduling policy is most suitable for a time shared operating system: (i) Shortest job first (ii) Round Robin (iii) FCFS (iv) Elevator20222mOperating SystemDescribe the objectives of process scheduling. Explain the roles of long-term, medium-term, and short-term schedulers.20257mOPERATING 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 first202214m
PreviousDefine threads and explain their various states. Compare user-level threads with kernel-level threads.NextConsider a system with five processes P0 through P4 and four resources type A, B, C and D. Using the Banker's algorithm answer that the system is in a safe state? | Process | Allocation (A B C D) | Max (A B C D) | Available (A B C D) | | :--- | :---: | :---: | :---: | | P0 | 0 0 1 2 | 0 0 1 2 | 1 5 2 0 | | P1 | 1 0 0 0 | 1 7 5 0 | | | P2 | 1 3 5 4 | 2 3 5 6 | | | P3 | 0 6 3 2 | 0 6 5 2 | | | P4 | 0 0 1 4 | 0 6 5 6 | |