- ๐ญ Iโm currently pursuing my bachelor's in Computer Scinece and Engineering!
- ๐ฑ Iโm currently learning everything ๐คฃ
- ๐ฏ Iโm looking to collaborate with other content creators
- ๐ฅ 2020 Goals: Become a good software developer.
- โก Fun fact: I love to play badminton & writing blogs.
shadabkhansir / operating-system-simulation-based-assignment Goto Github PK
View Code? Open in Web Editor NEWConsider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as : Priority = 1+ Waiting time / Estimated run time Using the data given below compute the waiting time and turnaround time for each process and average waiting time and average turnaround time.