ÔN TẬP CÁC BÀI TOÁN TRONG HỆ ĐIỀU HÀNH

Using FCFS (First Come First Served) algorithm, find the average waiting time for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

• 2,1

• 3

• 5

• 4,5

Using FCFS (First Come First Served) algorithm, find the order of execution for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

• B, D, A, C

• B, A, C, D

• B, C, A, D

• B, A, D, C

Using SJF (non-preemptive) algorithm, find the average waiting time for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

• 3,5

• 2,5

• 2

• 4

Using SJF (non-preemptive) algorithm, find the order of execution for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

• B, A, C, D

• B, D, A, C

• B, A, D, C

• B, C, A, D

Using SRTF algorithm, find the average waiting time for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

• 1

• 1,5

• 2,5

• 2

Using SRTF algorithm, find the order of execution for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1; D : 4 : 3.

• B, D, A, C, D

• B, A, B, C, A

• B, C, A, D, B

• B, A, D, C, B

Using RR (Round-Robin) algorithm with time quantum: 3, find the average waiting time for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1.

• 2,333

• 1,333

• 5,333

• 4,333

Using RR (Round-Robin) algorithm with time quantum: 3, find the order of execution for the following processes with the given data in the order Process : Arrival Time : Burst Time respectively A : 2 : 2; B : 0 : 6; C : 7 : 1.

• B, A, D, C

• B, C, A, D

• B, A, B, C

• B, C, D, A

Using Priority (non-preemptive) algorithm, find the average waiting time for the following processes with the given data in the order Process : Burst Time : Priority (0 is the highest priority) respectively A : 2 : 2; B : 3 : 6; C : 7 : 1; D : 4 : 3.

• 7,25

• 8,25

• 9

• 8

Using Priority (non-preemptive) algorithm, find the order of execution for the following processes with the given data in the order Process : Burst Time : Priority (0 is the highest priority) respectively A : 2 : 2; B : 3 : 6; C : 7 : 1; D : 4 : 3.

• C, D, B, C

• C, B, A, D

• C, B, D, A

• C, A, D, B