Waiting Time is calculated as (i) Turnaround Time - Burst Time (ii) Tu — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2024 paper

Module 2: Processes

20242m

Waiting Time is calculated as
(i) Turnaround Time - Burst Time
(ii) Turnaround Time - Arrival Time
(iii) Completion Time - Arrival Time
(iv) Completion Time - Burst Time

Search Google Ask AI

Similar questions

Operating SystemInterval between the time of submission and first response to the job is called: (i) waiting time (ii) turnaround time (iii) throughput (iv) response time20222m OPERATING SYSTEMConsider the following process: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P1 | 0.0 | 7 | | P2 | 2.0 | 4 | | P3 | 4.0 | 1 | | P4 | 5.0 | 4 | Considering non-preemptive and preemptive SJF algorithm, find out average waiting time and average turnaround time in both cases.201914m Operating SystemConsider the following process : | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P1 | 0.0 | 7 | | P2 | 2.0 | 4 | | P3 | 4.0 | 1 | | P4 | 5.0 | 4 | Considering non-preemptive and preemptive SJF algorithm, find out average waiting time and average turnaround time in both cases.201914m 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).20227m

PreviousThe Trap mode bit changes from 0 to 1 when mode switches to ______ mode. (i) Kernel, User (ii) User, User (iii) Kernel, Kernel (iv) User, Kernel NextDefine Thread? List some of the benefits of multithreading. Demonstrate the three methods to implement Threads.