Embed presentation
Download to read offline























The document discusses the Shortest Job First (SJF) scheduling algorithm, both in its preemptive and non-preemptive forms. It outlines various examples and instances of non-preemptive SJF. The presentation concludes with a note inviting questions from the audience.






















