Search Header Logo

OCR A level Scheduling Algorithms

Authored by Louise Lockwood

Computers

12th Grade

Used 34+ times

OCR A level Scheduling Algorithms
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

14 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the purpose of scheduling in an operating system?

To favor long jobs over short jobs

To provide security to the computer system

To maximize the use of the whole computer system

To prevent the system from failing if it is becoming overloaded

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which scheduling algorithm favors short jobs even more than Shortest Job First?

Multi-level feedback queues

Round Robin

Shortest time remaining

First come first served

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the purpose of a pre-emptive scheduler in operating system scheduling?

To decide that the job running should be made to stop to make way for another job

To make sure the processor time is used efficiently

To prevent the system from failing if it is becoming overloaded

To favor long jobs over short jobs

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which scheduling algorithm allows each job to be given a set amount of processor time?

Shortest time remaining

Shortest job first

Round Robin

First come first served

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the purpose of the multi-level feedback queues scheduling algorithm?

To maximize the use of the whole computer system

To prevent the system from failing if it is becoming overloaded

To make sure jobs are not spending too much time monopolizing the processor

To ensure all jobs are processed fairly

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the core software that allows the computer to run and manages hardware, user interface, software, and provides security?

Operating system

Interrupt

Processor

Scheduling

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which scheduling algorithm puts the first job to enter the ready queue as the first to enter the running state?

First come first served

Shortest job first

Shortest time remaining

Round Robin

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Microsoft

Continue with Microsoft

or continue with

Facebook

Facebook

Apple

Apple

Others

Others

Already have an account?