Part 14 - Shortest Job First(SJF) Scheduling Algorithm

Part-1: Introduction to Operating system: Part-2: What is Operating system and Goals of OS Part-3: Dual Mode Operation. Part-4: Loader and Linker Part-5: Types of loaders: Compile and Go loader Part-6: Types of Loaders: Simple Loader or General Loader Part-7: Types of loaders: Absolute Loader and Bootstrap Loader Part-8: Types of loaders: Relocatable/Relative/Reallocation loader Part-9: Introduction to process management Part-10: Differences between process and program Part-11: Process State Diagram Part-12: CPU Scheduling and Scheduling Criteria's Part-13: First Come First Serve scheduling algorithm Questions answered in this video are: 1) non-preemptive scheduling algorithm 2) preemptive scheduling algorithm 3) gantt chart 4) arrival time 5) how to write gantt chart for the given problem 6) non-preemptive shortest job first scheduling algorithm 7) preemptive shortest job first scheduling algorithm 8) how to calculate average turnaround time 9) how to calculate throughput 10) how to calculate average waiting time 11) shortest remaining time first scheduling algorithm 12) how to calculat response time 13) problems on non-preemptive shortest job first scheduling algorithm 14) problems on preemptive shortest job first scheduling algorithm