The document discusses various scheduling algorithms used in operating systems including: - First Come First Serve (FCFS) scheduling which services processes in the order they arrive but can lead to long wait times. - Shortest Job First (SJF) scheduling which prioritizes the shortest processes first to minimize wait times. This can be preemptive or non-preemptive. - Priority scheduling which assigns priorities to processes and services the highest priority first, which can cause starvation of low priority processes. - Round Robin scheduling which allows fair sharing of the CPU by allocating a time quantum or slice to each process in a cyclic manner.

12. Short job first scheduling- Non-preemptive

13. Short job first scheduling- Preemptive

20. Round-Robin Scheduling

23. Round-Robin Scheduling

27. Multilevel Queue

29. Multilevel Feedback Queue

35. Symmetric Multithreading