Which of the following CPU scheduling algorithms is/are supported by LINUX…

Answer: Preemptive priority scheduling and time sharing CPU scheduling

Why this is correct:

• Preemptive priority scheduling: Linux provides POSIX real-time policies (SCHED_FIFO and SCHED_RR) that implement preemptive, priority-based scheduling for time-critical tasks.

• Time-sharing scheduling: Normal (non-real-time) processes are scheduled by the Completely Fair Scheduler (CFS, typically SCHED_OTHER), which implements time-sharing and fair CPU distribution.

• Interaction: Real-time priority policies take precedence over time-sharing tasks, so Linux supports both approaches concurrently.

• Why the other statements are wrong or incomplete:

• The claim of 'Non-preemptive priority scheduling' is incorrect for standard Linux: the kernel scheduling policies used for real-time tasks are preemptive.

• The claims 'Time sharing scheduling only' and 'Priority scheduling only' are incomplete because Linux implements both time-sharing for regular processes and preemptive priority scheduling for real-time processes.