Operating System Scheduling Quiz

In Priority-Based Scheduling, how are tasks prioritized?

• Based on their execution time

• Based on their arrival time

• Based on their resource needs

• Given its significance

What is the main idea behind Shortest Remaining Time (SRT) scheduling?

• Prioritize the process with the SJF

• Prioritize the nearly completed task.

• Prioritize processes based on their arrival time

• Prioritize processes based on time

What is the purpose of the Banker's Algorithm in computing systems?

• Prioritize tasks based on their importance

• Allocate resources and avoid deadlock

• Execute processes in the order they arrive

• Ensure mutual exclusion among processes

Which algorithm divides the ready queue into separate queues based on specific properties of processes?

• First Come First Serve (FCFS)

• Multiple-Level Scheduling

• Shortest Remaining Time (SRT)

• Multiple-Based Scheduling

How does Shortest Job First (SJF) scheduling algorithm prioritize tasks?

• Based on their arrival time

• Based on their resource needs

• Based on their execution time

• Based on their importance

What is the main characteristic of Round-Robin Scheduling?

• Prioritizes task that are equal

• Prevents each task from executing equally

• Fairness

• Allows tasks to run indefinitely

What concept does the Banker's Algorithm help to avoid in operating systems?

• Deadlock

• Starvation

• Preemption

• Circular wait

Which algorithm means that tasks are executed in the order they arrive or request the CPU?

• First in, firs out

• First Come First Serve (FCFS)

• Shortest Job First (SJF)

• Round-Robin Scheduling

Which algorithm prioritizes tasks based on their shortest execution time in active state?

• Shortest remaining time

  ( SRT)

• Shortest Job First (SJF)

• Multiple-Level Queues Scheduling

• Priority-Based Scheduling

Which part of Coffman’s condition is illustrated

• Mutual Exclusion

• Circular wait

• No preemption

• Hold and Wait