The document requests the creation of two Gantt charts illustrating process execution using preemptive Shortest Job First (SJF) and preemptive priority scheduling. It also asks for the calculation of the average waiting time using the preemptive SJF algorithm while noting that if burst times are equal, the preemptive priority algorithm should be used.

1. Operating Systems Design:
Please answer this question correctly in handwriting
Draw two different Gantt chart illustrating the execution of these processes using - Preemptive
SJF - Preemptive Priority Find out the average waiting time using preemptive SJF algorithm. If
burst times are equal for multiple processes then use the preemptive priority algorithm.