Process Control Block and Scheduling in Operating Systems

Which scheduling algorithm involves giving each process a 'slice' of time with the CPU before being preempted?

In which scheduling algorithm does the process with the shortest processing time get executed next?

Which type of scheduling is characterized by no timer interrupts and is not ideal for time sharing?

Which scheduling policy benefits CPU-bound processes but impacts I/O-bound processes due to waiting time?

Which scheduling mode allows interrupts based on a clock/timer?

In which scheduling algorithm is the next process to be executed the one that has been waiting the longest in the ready state?

Which scheduling policy might change to FCFS if the time slice is much larger than the response time for most processes?

'Shortest Process Next' is a scheduling policy that focuses on which characteristic of processes?

'Round Robin' is particularly effective for which type of systems?

'Non-preemptive' scheduling mode is considered less suitable for what type of system?