Back to the 2022 paper
Similar questions
Operating SystemConsider the following CPU processes with arrival times 0 and CPU bursts (in milliseconds) as given below: | Process | Burst time | |---|---| | P1 | 24 | | P2 | 3 | | P3 | 3 | If the Round Robin Scheduling is used with time quantum of 4 milliseconds to schedule the processes. Draw the Gantt chart and calculate the average waiting time across all processes (in milliseconds).20227mOPERATING SYSTEMAssume the following workload in a system: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P0 | 1 | 3 | | P1 | 0 | 6 | | P2 | 3 | 2 | | P3 | 4 | 7 | | P4 | 2 | 8 | | P5 | 6 | 5 | Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum=3 : (i) Average Turn Around Time (ii) Average Waiting Time20247mOperating SystemConsider the following set of processes with the length of the CPU Burst given in milliseconds: | Process | Burst Time | Priority | | :--- | :--- | :--- | | A | 10 | 3 | | B | 1 | 1 | | C | 2 | 3 | | D | 1 | 4 | | E | 5 | 2 | The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of FCFS and SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20247mOPERATING SYSTEMThe CPU utilization when the system is ______ (i) timesharing (ii) thrashing (iii) multiprocessing (iv) None of the above20232m
PreviousAn airline reservation system, using a centralized database service, processes user requests concurrently. Is it preferable to use threads rather than processes in this system? Give reasons for your answer.NextClearly justify why deadlocks cannot arise in a bounded buffer producers-consumers system.
Student FinanceWeb Platform
Pocketly — Personal Finance for Students
Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.