1. Consider the stride scheduling algorithm. Assume there are 3 processes A, B, C with CPU shares %30, %30, %40 and initial pass values 0, 1, 2, respectively. Assume that processes do not perform any I/O operations. First, determine the stride values for these 3 processes. Then, provide the execution sequence of these jobs as a table. In the table, there are 4 columns. The first 3 columns correspond to pass values of A, B and C, respectively. The last column shows the decision of the stride scheduler at this point. Populate this table with 10 rows showing the first 10 decisions of the stride scheduler.

Stride values:

A

B

C

Who runs?