3.Round-Robin (RR): Designed for time-sharing systems, this algorithm assigns a fixed time slice (or quantum) to each process in the ready queue, rotating through them in round-robin order. RR is particularly effective in providing a fair share of CPU time to all processes, reducing response time for interactive tasks