Linux uses a time-sharing algorithm

Solution

- Time-sharing algorithm: Linux's scheduler does involve time-sharing, where processes are allocated time slices (time quanta) of the CPU. - Preemptive scheduling: Linux's scheduler is preemptive, meaning it can interrupt a process and switch to another process after a certain time slice or due to priority changes. - Tasks where absolute priorities are more important than fairness: While Linux does support real-time scheduling for tasks that require strict priority handling, the general-purpose scheduler (CFS) focuses on fairness.