Scheduling (OCR A-Level Computer Science): Quizzes

📚Quizzes
Scheduling
Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

12 questions from this quiz

Show

What is the primary reason the CPU requires scheduling algorithms in a multitasking environment?

CPU can only execute one task at a time

In Round Robin scheduling, what happens to a task that doesn't finish within its time slice?

It moves to the back of the queue

What is a key drawback when the time slice in Round Robin scheduling is too short?

Causes frequent context switching

Which scheduling algorithm is most suitable for interactive or time-shared systems?

Round Robin

What problem does the convoy effect describe in FCFS scheduling?

Short task stuck behind long one

What type of system is FCFS scheduling best suited for?

Batch processing systems

In Multi-Level Feedback Queue, where does a task start and how does it move?

High priority, moves down if not finished

What is the main drawback of Multi-Level Feedback Queue scheduling?

Complex and high management overhead

What does Shortest Job First (SJF) scheduling minimise?

Average waiting time

What is the key difference between SJF and SRT scheduling algorithms?

SJF is non-preemptive, SRT preemptive

When does process starvation occur in SJF and SRT algorithms?

When short tasks keep arriving

What is the fixed time allocation given to each task in Round Robin called?

Quantum

Join 100,000+ A-Level students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.