Universal Worksheet for Scheduling Numericals
⚠️ Added for clarity (not directly from source)
- - Step 1: Build a process table with arrival, burst, and priority (if applicable).
- - Step 2: Decide selection rule based on algorithm (FCFS/SJF/SRTN/RR/Priority).
- - Step 3: Draw Gantt chart exactly in chronological order.
- - Step 4: Compute completion time (CT) from chart.
- - Step 5: TAT = CT - AT, WT = TAT - BT, Response = first start - AT.
- - Step 6: Double-check idle gaps and preemption moments before final averages.