CPU Scheduling  Routines CIE A2

CPU Scheduling Routines CIE A2

12th Grade

21 Qs

quiz-placeholder

Similar activities

Operating Systems (OCR A level)

Operating Systems (OCR A level)

12th Grade

19 Qs

OS

OS

12th Grade

20 Qs

recap 12 miscellaneous H446 computer science

recap 12 miscellaneous H446 computer science

12th Grade

17 Qs

Computer Science Quiz1

Computer Science Quiz1

9th - 12th Grade

20 Qs

Y13-DNA OS and scheduling Algorithms

Y13-DNA OS and scheduling Algorithms

12th Grade

20 Qs

Week 5

Week 5

12th Grade

21 Qs

16.1 Purposes of an Operating System (OS) Cambridge iA 9618

16.1 Purposes of an Operating System (OS) Cambridge iA 9618

12th Grade

20 Qs

Operating Systems

Operating Systems

KG - University

20 Qs

CPU Scheduling  Routines CIE A2

CPU Scheduling Routines CIE A2

Assessment

Quiz

Computers

12th Grade

Hard

Created by

Andrew Duckworth

FREE Resource

21 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:

job queue

ready queue

execution queue

process queue

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following state transitions is not possible ?

A. blocked to running

B. ready to running

C. blocked to ready

D. running to blocked

3.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

A Process waiting to be assigned to a processor is considered to be in _____ state

waiting

ready

terminated

running

4.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

What are the names of the three process states used in the 9618 CIE A level syllabus

Running

Waiting

Ready

Suspended

Blocked

5.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Which of these are part of the process control block (PCB )?

current process state

register values

process ID

scheduling method

Remaining CPU processing time

6.

DRAG AND DROP QUESTION

1 min • 1 pt

Which scheduling method is being described here: Jobs are sorted in the ready queue according to the estimated processor time needed​ (a)  

shortest job first
first come first served
shortest remaining time
round robin
multi-level feedback queues

7.

DRAG AND DROP QUESTION

1 min • 1 pt

Which scheduling method is being described here: The first job to enter the queue is the first to the running state​ ​ ​ (a)  

shortest remaining time
round robin
multi-level feedback queues
shortest job first
first come first served

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?