FCFS (First Come First Served) in Operating Systems - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to identify the scheduling algorithm that executes processes in the order they arrive.

Operating Systems

algorithm = "[1]"

Drag options to blanks, or click blank then click option'

ARound Robin

BShortest Job First

CFCFS

DPriority Scheduling

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing FCFS with Round Robin or Priority Scheduling.

Choosing an algorithm that does not follow arrival order.

FCFS stands for First Come First Served, which means processes are executed in the order they arrive.

2fill in blank

medium

Complete the code to calculate the waiting time for the first process in FCFS scheduling.

Operating Systems

waiting_time[0] = [1]

Drag options to blanks, or click blank then click option'

Aarrival_time[0]

Bburst_time[0]

Ccompletion_time[0]

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Setting waiting time equal to burst time or arrival time.

Confusing waiting time with completion time.

The first process in FCFS does not wait, so its waiting time is zero.

3fill in blank

hard

Fix the error in the code to compute the waiting time for process i in FCFS scheduling.

Operating Systems

waiting_time[i] = completion_time[i-1] [1] arrival_time[i]

Drag options to blanks, or click blank then click option'

A-

B/

C*

D+

Attempts:

3 left

💡 Hint

Common Mistakes

Using addition instead of subtraction.

Using multiplication or division which are incorrect here.

Waiting time is calculated by subtracting the arrival time of the current process from the completion time of the previous process.

4fill in blank

hard

Fill both blanks to compute the completion time for process i in FCFS scheduling.

Operating Systems

completion_time[i] = completion_time[i-1] [1] burst_time[i] [2] 0

Drag options to blanks, or click blank then click option'

A+

B-

Cif

D*

Attempts:

3 left

💡 Hint

Common Mistakes

Using subtraction instead of addition.

Not using a condition to handle the first process.

The completion time is the sum of the previous completion time and the current burst time if the previous completion time is greater than zero.

5fill in blank

hard

Fill all three blanks to create a dictionary comprehension that maps each process to its waiting time if waiting time is positive.

Operating Systems

waiting_times = [1]: [2] for [3] in processes if waiting_time[process] > 0

Drag options to blanks, or click blank then click option'

Aprocess

Bwaiting_time[process]

Cprocesses

Dwaiting_time

Attempts:

3 left

💡 Hint

Common Mistakes

Using incorrect variable names.

Not filtering processes with positive waiting time.

This dictionary comprehension creates a mapping from each process to its waiting time, but only includes processes with positive waiting times.