H447: Unit 2: Understanding Scheduling Algorithms

What is the primary function of scheduling in multitasking operating systems?

• To manage the computer's power consumption

• To prioritize user input over background tasks

• To ensure all tasks are executed in sequence

• To give the appearance of simultaneous task execution

How does the First Come First Serve algorithm determine the order of process execution?

• By the complexity of the process

• By the length of time the process will take

• By the order processes arrive in the queue

• By the priority assigned to each process

Why is the First Come First Serve algorithm considered non-preemptive?

• Because it schedules processes based on their arrival time without interruption

• Because it requires processes to complete before others can start

• Because it prioritizes shorter jobs over longer ones

• Because it allows processes to interrupt others

What is a key requirement for the Shortest Job First scheduling algorithm to function correctly?

• All processes must be independent of each other

• The exact execution time of each process must be known in advance

• Processes must arrive at the same time

• Processes must have similar resource requirements

What is a disadvantage of the Shortest Job First algorithm?

• It does not allow for multitasking

• It requires processes to have the same execution time

• It is too complex to implement in real systems

• It can lead to process starvation

In the Round Robin scheduling algorithm, what happens if a process does not complete within its time slice?

• It is terminated

• It rejoins the queue for another time slice

• It is given additional time immediately

• It is moved to a lower-priority queue

What is a major advantage of the Round Robin scheduling algorithm?

• It is simple to implement

• It minimizes process starvation

• It always selects the shortest job next

• It requires no knowledge of the process execution time

What is the role of time slices in the Round Robin algorithm?

• To measure the waiting time of processes

• To limit the execution time of each process

• To determine the priority of processes

• To calculate the total execution time of the system

What distinguishes the Shortest Remaining Time algorithm from Shortest Job First?

• It does not require knowledge of process duration

• It allows processes to be suspended for higher priority tasks

• It is non-preemptive

• It only schedules processes at system startup

Which scheduling algorithm is considered preemptive?

• Shortest Job First

• Round Robin

• Shortest Remaining Time

• First Come First Serve