System Software

Question 1

What are the disadvantages of the Shortest Time Remaining algorithm?

Answer 1

• Requires knowing process burst times in advance
• High context‑switching overhead due to frequent pre‑emption

Question 2

What are the advantages of the Shortest Time Remaining scheduling algorithm?

Answer 2

• Ideal for jobs with short burst times
• Pre‑emptive, allowing the CPU to switch tasks for optimal performance

Question 3

What are the disadvantages of Shortest Job First?

Answer 3

• Requires knowing the burst time of processes in advance
• Long processes can starve if short processes keep arriving

Question 4

What are the advantages of Shortest Job First?

Answer 4

• Minimises waiting time
• Efficient and fast for short processes

Question 5

What are the disadvantages of Multi Level Feedback Queues?

Answer 5

• More complex than other scheduling algorithms
• Choosing correct parameters (e.g., number of queues, ageing rules) can be difficult

Question 6

What are the advantages of Multi‑Level Feedback Queues?

Answer 6

• Smaller tasks are prioritised
• Similar‑sized tasks are grouped together through multiple queues

Question 7

What are the disadvantages of First Come First Served scheduling?

Answer 7

• Poor performance if a long process arrives before shorter ones
• High‑priority tasks must wait their turn in the queue

Question 8

What are the advantages of First Come First Served?

Answer 8

• Simple and easy to understand
• Fair in the sense that processes are served in arrival order

Question 9

What are the disadvantages of Round Robin scheduling?

Answer 9

• Choosing the right time quantum is difficult
• Long processes may experience high turnaround and waiting times

Question 10

What are the advantages of the Round Robin scheduling algorithm?

Answer 10

• All processes get a fair share of the CPU
• Good for time‑sharing systems
• Predictable because every process receives equal time

Question 11

What type of scheduling algorithm is Shortest Remaining Time?

Answer 11

A pre‑emptive version of Shortest Job First that always selects the process with the shortest remaining burst time.

Question 12

How does Shortest Remaining Time prioritise processes?

Answer 12

Processes with the shortest remaining time to complete are given the highest priority.

Question 13

How does time slicing work in Shortest Remaining Time?

Answer 13

A time quantum is set; if a process doesn’t finish within that quantum, it is re‑queued for further processing.

Question 14

What happens before each new scheduling cycle?

Answer 14

All processes are inspected and reordered based on their remaining burst time.

Question 15

Why is Shortest Remaining Time considered efficient?

Answer 15

It minimises average waiting time by always choosing the process closest to completion.

Question 16

What is a drawback of Shortest Remaining Time?

Answer 16

Long processes may suffer starvation if short processes keep arriving.