Contents
Chapter 3 · SoftwarePractice
← Return to textbook

CONCEPT PRACTICE

First-come first-served scheduling

1 related published questions. Take them one at a time.

Filter questions
Question sources

1 of 1 questions match.

ITPEC Practice
0/1 answered

Question 1 of 1

0/1 answered

2024 Autumn · Subject A · Q15

Original exam question · Select the image to enlarge
Read the question as text

Determine waiting times under First-Come-First-Serve scheduling. In milliseconds, P1 arrives at 0 and needs 6 CPU time; P2 arrives at 2 and needs 4; P3 arrives at 4 and needs 9; P4 arrives at 5 and needs 7. Arrival means entry to the ready queue; waiting time is the interval before CPU execution begins. All choices give P1, P2, P3, P4 in that order.

The original image above preserves the complete exam wording and layout.

Choose your answer
Choose an option to check your answer.
1 / 1Back to lesson →

Source: 2024A_FE-A_Questions.pdf, PDF page 10. ID: 2024A-A-Q015. Explanation written for this textbook.

Original question · Q15
Determine waiting times under First-Come-First-Serve scheduling. In milliseconds, P1 arrives at 0 and needs 6 CPU time; P2 arrives at 2 and needs 4; P3 arrives at 4 and needs 9; P4 arrives at 5 and needs 7. Arrival means entry to the ready queue; waiting time is the interval before CPU execution begins. All choices give P1, P2, P3, P4 in that order.

Scroll horizontally to read the image at full size.