Deterministic CPU Scheduling Algorithm Model: 71 Practice MCQs with Answers and Explanation

Q1. What is the broader class of evaluation methods that uses algorithms and workloads to produce performance numbers?

A.Deterministic modeling

B.Analytic evaluation ✅

C.Simulation

D.Queueing theory

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Analytic evaluation is the broader class of evaluation methods. It uses a given algorithm and system workload to produce a formula or number to evaluate the performance of the algorithm for that workload. Deterministic modeling is one specific type of analytic evaluation.

Q2. What type of analytic evaluation takes a predetermined workload and defines the performance of each algorithm?

A.Queueing theory

B.Simulation

C.Deterministic modeling ✅

D.Statistical analysis

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Deterministic modeling is a type of analytic evaluation that takes a particular predetermined workload and defines the performance of each algorithm for that workload. It provides exact numbers based on the given inputs.

Q3. In deterministic modeling, what is the typical arrival time for all processes in the workload examples?

A.They arrive at different times

B.They all arrive at time 0 ✅

C.They arrive in random order

D.They arrive after the first process completes

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: In the deterministic modeling examples provided, all five processes arrive at time 0 in the given order. This simplifies the analysis and allows direct calculation of waiting times for different scheduling algorithms.

Q4. What is the average waiting time for the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds

B.23 milliseconds

C.28 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: The FCFS algorithm gives waiting times of 0, 10, 39, 42, and 49 milliseconds for P1, P2, P3, P4, and P5 respectively. The average is (0 + 10 + 39 + 42 + 49)/5 = 28 milliseconds.

Q5. What is the average waiting time for the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.10 milliseconds

B.13 milliseconds ✅

C.23 milliseconds

D.28 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: The SJF algorithm gives waiting times of 10, 32, 0, 3, and 20 milliseconds for P1, P2, P3, P4, and P5 respectively. The average is (10 + 32 + 0 + 3 + 20)/5 = 13 milliseconds.

Q6. What is the average waiting time for the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds

B.23 milliseconds ✅

C.28 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: The RR algorithm gives waiting times of 0, 32, 20, 23, and 40 milliseconds for P1, P2, P3, P4, and P5 respectively. The average is (0 + 32 + 20 + 23 + 40)/5 = 23 milliseconds.

Q7. Which scheduling algorithm gives the minimum average waiting time for the workload P1(10), P2(29), P3(3), P4(7), P5(12)?

A.FCFS

B.SJF ✅

C.RR

D.All give the same average

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: The SJF algorithm gives an average waiting time of 13 milliseconds, which is less than FCFS (28ms) and RR (23ms). SJF minimizes the average waiting time when all processes arrive at time 0.

Q8. What is the waiting time for process P1 under the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds ✅

B.10 milliseconds

C.39 milliseconds

D.42 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: Under FCFS, P1 runs first and starts at time 0. Its waiting time is 0 milliseconds. It completes at time 10, and the next process P2 begins at that time.

Q9. What is the waiting time for process P2 under the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.10 milliseconds ✅

C.39 milliseconds

D.42 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under FCFS, P1 runs first for 10ms, so P2 starts at time 10. Its waiting time is 10 milliseconds. P2 then runs for 29ms, completing at time 39.

Q10. What is the waiting time for process P3 under the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.10 milliseconds

C.39 milliseconds ✅

D.42 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under FCFS, P1 runs for 10ms and P2 runs for 29ms, so P3 starts at time 39. Its waiting time is 39 milliseconds. P3 then runs for 3ms, completing at time 42.

Q11. What is the waiting time for process P4 under the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.10 milliseconds

C.39 milliseconds

D.42 milliseconds ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: Under FCFS, P1, P2, and P3 run for 10, 29, and 3ms respectively, so P4 starts at time 42. Its waiting time is 42 milliseconds. P4 then runs for 7ms, completing at time 49.

Q12. What is the waiting time for process P5 under the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.10 milliseconds

B.20 milliseconds

C.39 milliseconds

D.49 milliseconds ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: Under FCFS, the first four processes run for 10+29+3+7=49ms, so P5 starts at time 49. Its waiting time is 49 milliseconds. P5 then runs for 12ms, completing at time 61.

Q13. What is the completion time for P5 under the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.49 milliseconds

B.61 milliseconds ✅

C.39 milliseconds

D.42 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under FCFS, the execution order is P1, P2, P3, P4, P5. The completion time is the sum of all burst times: 10+29+3+7+12=61 milliseconds. P5 completes at time 61, which is the final completion time.

Q14. What is the waiting time for process P3 under the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds ✅

B.3 milliseconds

C.10 milliseconds

D.20 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: Under SJF, P3 has the shortest burst (3ms) and runs first. Its waiting time is 0 milliseconds. It starts at time 0 and completes at time 3.

Q15. What is the waiting time for process P4 under the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.3 milliseconds ✅

C.10 milliseconds

D.20 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under SJF, P3 runs first (3ms), then P4 runs next (7ms). P4 starts at time 3, so its waiting time is 3 milliseconds. It completes at time 10.

Q16. What is the waiting time for process P1 under the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.3 milliseconds

C.10 milliseconds ✅

D.20 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under SJF, the execution order is P3(3), P4(7), P1(10), P5(12), P2(29). P1 starts after P3 and P4 complete (3+7=10ms), so its waiting time is 10 milliseconds.

Q17. What is the waiting time for process P5 under the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.10 milliseconds

B.20 milliseconds ✅

C.32 milliseconds

D.49 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under SJF, the execution order is P3(3), P4(7), P1(10), P5(12), P2(29). P5 starts after P3, P4, and P1 complete (3+7+10=20ms), so its waiting time is 20 milliseconds.

Q18. What is the waiting time for process P2 under the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.10 milliseconds

B.20 milliseconds

C.32 milliseconds ✅

D.49 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under SJF, the execution order is P3(3), P4(7), P1(10), P5(12), P2(29). P2 starts after all other processes complete (3+7+10+12=32ms), so its waiting time is 32 milliseconds.

Q19. What is the waiting time for process P5 under the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.20 milliseconds

C.23 milliseconds

D.40 milliseconds ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: Under RR with quantum=10ms, P5 completes in the second round. It waits through the first round (10+10+3+7=30ms) and then part of the second round until it gets CPU time at time 40, so its waiting time is 40 milliseconds.

Q20. What is the waiting time for process P2 under the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.10 milliseconds

B.20 milliseconds

C.23 milliseconds

D.32 milliseconds ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: Under RR with quantum=10ms, P2 runs for 10ms in the first round, then waits. It gets CPU again at time 40 and runs for 10ms, then waits. It completes at time 61, with total waiting time of 32 milliseconds.

Q21. What is the waiting time for process P4 under the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.20 milliseconds

C.23 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, P4 runs at time 23 in the first round and completes at time 30. Its waiting time before its first execution is 23 milliseconds (time spent waiting from time 0 to 23).

Q22. What is the waiting time for process P3 under the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds

B.20 milliseconds ✅

C.23 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under RR with quantum=10ms, P3 runs at time 20 in the first round and completes at time 23. Its waiting time is 20 milliseconds (time spent waiting from time 0 to 20).

Q23. What is the waiting time for process P1 under the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.0 milliseconds ✅

B.20 milliseconds

C.23 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: Under RR with quantum=10ms, P1 runs first at time 0 and completes its entire burst of 10ms in its first time quantum. Its waiting time is 0 milliseconds.

Q24. What is the average waiting time for the FCFS algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds

B.23 milliseconds

C.28 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: The FCFS algorithm gives waiting times of 0, 10, 39, 42, and 49 milliseconds for P1 through P5 respectively. The average is (0 + 10 + 39 + 42 + 49)/5 = 140/5 = 28 milliseconds.

Q25. What is the average waiting time for the SJF algorithm with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds ✅

B.23 milliseconds

C.28 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: The SJF algorithm gives waiting times of 10, 32, 0, 3, and 20 milliseconds for P1 through P5 respectively. The average is (10 + 32 + 0 + 3 + 20)/5 = 65/5 = 13 milliseconds.

Q26. What is the average waiting time for the RR algorithm with quantum=10ms for processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds

B.23 milliseconds ✅

C.28 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: The RR algorithm gives waiting times of 0, 32, 20, 23, and 40 milliseconds for P1 through P5 respectively. The average is (0 + 32 + 20 + 23 + 40)/5 = 115/5 = 23 milliseconds.

Q27. Which scheduling algorithm gives the minimum average waiting time for the given workload?

A.FCFS

B.SJF ✅

C.RR

D.All give the same average

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: SJF gives the minimum average waiting time of 13 milliseconds for the workload P1(10), P2(29), P3(3), P4(7), P5(12). FCFS gives 28ms and RR gives 23ms. SJF is optimal for this workload when all processes arrive at time 0.

Q28. What is the average waiting time for SJF in the example with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds ✅

B.23 milliseconds

C.28 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: The SJF algorithm gives an average waiting time of 13 milliseconds. This is the minimum among the three algorithms and demonstrates SJF's optimality when all processes are available at time 0.

Q29. What is the average waiting time for RR in the example with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds

B.23 milliseconds ✅

C.28 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: The RR algorithm with quantum=10ms gives an average waiting time of 23 milliseconds. This is an intermediate value between FCFS (28ms) and SJF (13ms).

Q30. What is the average waiting time for FCFS in the example with processes P1(10), P2(29), P3(3), P4(7), P5(12)?

A.13 milliseconds

B.23 milliseconds

C.28 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: The FCFS algorithm gives an average waiting time of 28 milliseconds. This is the highest among the three algorithms for this particular workload.

Q31. What is the main advantage of deterministic modeling?

A.It can model any real-world scenario

B.It is simple and fast, giving exact numbers ✅

C.It does not require any input data

D.It works for all types of workloads

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Deterministic modeling is simple and fast. It gives exact numbers, allowing direct comparison of algorithms for a given workload. However, it requires exact input numbers and its answers apply only to those specific cases.

Q32. What is the main limitation of deterministic modeling?

A.It is too complex to implement

B.It requires exact input numbers and answers apply only to specific cases ✅

C.It cannot be used for comparing algorithms

D.It requires a quantum value

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The main limitation of deterministic modeling is that it requires exact numbers for input, and its answers apply only to those specific cases. It cannot be generalized to other workloads without additional analysis.

Q33. What is the primary use of deterministic modeling?

A.To predict system performance for all workloads

B.To describe scheduling algorithms and provide examples ✅

C.To design new scheduling algorithms

D.To evaluate real-time systems

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The primary uses of deterministic modeling are in describing scheduling algorithms and providing examples. It is also useful when running the same program repeatedly and measuring its processing requirements exactly.

Q34. What can deterministic modeling be used for when running the same program repeatedly?

A.To predict future program behavior

B.To select a scheduling algorithm ✅

C.To design new hardware

D.To improve program execution speed

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: In cases where we are running the same program over and over and can measure the program's processing requirements exactly, deterministic modeling can be used to select a scheduling algorithm. The exact requirements allow precise calculation of performance.

Q35. What is the execution order of processes under the FCFS algorithm for the given workload?

A.P1, P2, P3, P4, P5 ✅

B.P3, P4, P1, P5, P2

C.P1, P2, P3, P5, P4

D.P3, P4, P5, P1, P2

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: Under FCFS, processes execute in the order they arrive. Since all processes arrive at time 0 in the order P1, P2, P3, P4, P5, the execution order is P1, P2, P3, P4, P5. This is the simplest scheduling algorithm.

Q36. What is the execution order of processes under the SJF algorithm for the given workload?

A.P1, P2, P3, P4, P5

B.P3, P4, P1, P5, P2 ✅

C.P1, P2, P3, P5, P4

D.P3, P4, P5, P1, P2

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under SJF, processes execute in order of shortest burst time. The burst times are P1=10, P2=29, P3=3, P4=7, P5=12. The execution order is P3(3), P4(7), P1(10), P5(12), P2(29).

Q37. What is the completion time for process P1 under the SJF algorithm for the given workload?

A.3 milliseconds

B.10 milliseconds ✅

C.13 milliseconds

D.20 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under SJF, the execution order is P3(3), P4(7), P1(10), P5(12), P2(29). P1 starts after P3 and P4 complete (3+7=10ms). P1's burst is 10ms, so it completes at time 20ms. Its waiting time is 10ms.

Q38. What is the completion time for process P2 under the SJF algorithm for the given workload?

A.32 milliseconds

B.52 milliseconds

C.61 milliseconds ✅

D.29 milliseconds

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Under SJF, P2 has the longest burst (29ms) and runs last. The total execution time before P2 is 3+7+10+12=32ms. P2 runs for 29ms, so it completes at time 61ms. Its waiting time is 32ms.

Q39. What is the completion time for process P3 under the SJF algorithm for the given workload?

A.3 milliseconds ✅

B.10 milliseconds

C.13 milliseconds

D.20 milliseconds

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: Under SJF, P3 has the shortest burst (3ms) and runs first. It starts at time 0 and completes at time 3ms. Its waiting time is 0ms.

Q40. What is the completion time for process P4 under the SJF algorithm for the given workload?

A.3 milliseconds

B.10 milliseconds ✅

C.13 milliseconds

D.20 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under SJF, P3 runs first (3ms), then P4 runs next. P4 has a burst of 7ms, so it completes at time 3+7=10ms. Its waiting time is 3ms.

Q41. What is the completion time for process P5 under the SJF algorithm for the given workload?

A.10 milliseconds

B.20 milliseconds ✅

C.32 milliseconds

D.61 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under SJF, the execution order is P3(3), P4(7), P1(10), P5(12), P2(29). P5 starts after P3, P4, and P1 complete (3+7+10=20ms). P5's burst is 12ms, so it completes at time 32ms. Its waiting time is 20ms.

Q42. What is the waiting time for process P2 under the RR algorithm with quantum=10ms for the given workload?

A.10 milliseconds

B.20 milliseconds

C.32 milliseconds ✅

D.40 milliseconds

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, P2 runs for 10ms in the first round (time 10-20), then waits. It runs again at time 40-50, and finally at time 52-61 to complete its remaining 9ms. The total waiting time is 32ms (10ms before first run + 20ms between runs + 2ms in final round).

Q43. What is the completion time for process P2 under the RR algorithm with quantum=10ms for the given workload?

A.50 milliseconds

B.52 milliseconds

C.61 milliseconds ✅

D.62 milliseconds

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, P2 runs at time 10-20 (10ms), time 40-50 (10ms), and finally time 52-61 (9ms remaining). It completes at time 61ms, which is also the final completion time for all processes.

Q44. What is the completion time for process P5 under the RR algorithm with quantum=10ms for the given workload?

A.30 milliseconds

B.40 milliseconds

C.50 milliseconds

D.52 milliseconds ✅

💡 Difficulty: medium | ✅ Correct: D

📖 Explanation: Under RR with quantum=10ms, P5 runs at time 30-40 (10ms of its 12ms burst), then at time 50-52 (remaining 2ms). It completes at time 52ms.

Q45. What is the completion time for process P4 under the RR algorithm with quantum=10ms for the given workload?

A.20 milliseconds

B.23 milliseconds

C.30 milliseconds ✅

D.40 milliseconds

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, P4 runs at time 23-30 (7ms burst), completing its entire burst in one time slice. It completes at time 30ms.

Q46. What is the completion time for process P3 under the RR algorithm with quantum=10ms for the given workload?

A.20 milliseconds

B.23 milliseconds ✅

C.30 milliseconds

D.40 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under RR with quantum=10ms, P3 runs at time 20-23 (3ms burst), completing its entire burst in one time slice. It completes at time 23ms.

Q47. What is the completion time for process P1 under the RR algorithm with quantum=10ms for the given workload?

A.10 milliseconds ✅

B.20 milliseconds

C.23 milliseconds

D.30 milliseconds

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: Under RR with quantum=10ms, P1 runs at time 0-10 (10ms burst), completing its entire burst in its first time quantum. It completes at time 10ms.

Q48. What is the execution order of processes under the RR algorithm with quantum=10ms for the given workload?

A.P1, P2, P3, P4, P5, P2, P5, P2

B.P1, P2, P3, P4, P5, P2, P5

C.P1, P2, P3, P4, P5, P2, P5, P2 ✅

D.P1, P2, P3, P4, P5, P2

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, the execution order is: P1(10), P2(10), P3(3), P4(7), P5(10), P2(10), P5(2), P2(9). The sequence is P1, P2, P3, P4, P5, P2, P5, P2.

Q49. What can be proved from deterministic modeling examples?

A.That FCFS always gives the minimum waiting time

B.That SJF always gives the minimum waiting time when all processes arrive at time 0 ✅

C.That RR always gives the minimum waiting time

D.That all algorithms give the same waiting time

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: From deterministic modeling examples, it can be shown that for the environment described (all processes and their times available at time 0), the SJF policy will always result in the minimum waiting time. This is a proven property of SJF scheduling.

Q50. What is the main use of deterministic modeling?

A.To design new scheduling algorithms

B.To provide exact numbers for comparing algorithms for specific cases ✅

C.To model real-time systems

D.To predict random workloads

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Deterministic modeling is used to provide exact numbers for comparing scheduling algorithms for specific, predetermined workloads. It is useful for understanding algorithm behavior and for cases where exact processing requirements are known.

Q51. What is the main disadvantage of deterministic modeling?

A.It is too complex to use

B.It provides approximate results

C.It requires exact input numbers and applies only to specific cases ✅

D.It cannot compare different algorithms

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: The main disadvantage of deterministic modeling is that it requires exact input numbers and its answers apply only to the specific cases analyzed. It cannot be generalized to other workloads without additional analysis.

Q52. What is the relationship between deterministic modeling and analytic evaluation?

A.Deterministic modeling is a type of analytic evaluation ✅

B.Analytic evaluation is a type of deterministic modeling

C.They are unrelated

D.They are the same thing

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Deterministic modeling is one type of analytic evaluation. Analytic evaluation is the broader class that uses algorithms and workloads to produce performance numbers. Deterministic modeling is a specific approach within this class that uses predetermined workloads.

Q53. What is the completion time for all processes under the FCFS algorithm for the given workload?

A.49 milliseconds

B.61 milliseconds ✅

C.32 milliseconds

D.52 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under FCFS, the total completion time is the sum of all burst times: 10+29+3+7+12=61 milliseconds. The final process (P5) completes at time 61ms.

Q54. What is the completion time for all processes under the SJF algorithm for the given workload?

A.32 milliseconds

B.52 milliseconds

C.61 milliseconds ✅

D.62 milliseconds

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Under SJF, the total completion time is also the sum of all burst times: 10+29+3+7+12=61 milliseconds. The final process (P2) completes at time 61ms. SJF minimizes waiting time but not completion time.

Q55. What is the completion time for all processes under the RR algorithm for the given workload?

A.52 milliseconds

B.61 milliseconds ✅

C.62 milliseconds

D.71 milliseconds

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Under RR with quantum=10ms, the total completion time is 61 milliseconds. The final process (P2) completes at time 61ms. RR gives an intermediate average waiting time.

Q56. What is the waiting time for process P1 under the FCFS algorithm for the given workload?

A.0 milliseconds ✅

B.10 milliseconds

C.39 milliseconds

D.42 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: Under FCFS, P1 runs first and starts at time 0. Its waiting time is 0 milliseconds. This is the ideal waiting time for the first process under FCFS.

Q57. What is the waiting time for process P2 under the SJF algorithm for the given workload?

A.10 milliseconds

B.20 milliseconds

C.32 milliseconds ✅

D.49 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under SJF, P2 has the longest burst (29ms) and runs last. Its waiting time is 32 milliseconds (the total time of all other processes: 3+7+10+12=32ms).

Q58. What is the waiting time for process P4 under the SJF algorithm for the given workload?

A.0 milliseconds

B.3 milliseconds ✅

C.10 milliseconds

D.20 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under SJF, P4 runs second after P3. Its waiting time is 3 milliseconds (the burst time of P3). It starts at time 3 and completes at time 10.

Q59. What is the waiting time for process P3 under the FCFS algorithm for the given workload?

A.0 milliseconds

B.10 milliseconds

C.39 milliseconds ✅

D.42 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under FCFS, P3 runs third after P1 and P2. Its waiting time is 10+29=39 milliseconds. It starts at time 39 and completes at time 42.

Q60. What is the waiting time for process P5 under the SJF algorithm for the given workload?

A.10 milliseconds

B.20 milliseconds ✅

C.32 milliseconds

D.40 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under SJF, P5 runs fourth after P3, P4, and P1. Its waiting time is 3+7+10=20 milliseconds. It starts at time 20 and completes at time 32.

Q61. What is the waiting time for process P2 under the FCFS algorithm for the given workload?

A.0 milliseconds

B.10 milliseconds ✅

C.39 milliseconds

D.42 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under FCFS, P2 runs second after P1. Its waiting time is 10 milliseconds (the burst time of P1). It starts at time 10 and completes at time 39.

Q62. What is the waiting time for process P3 under the RR algorithm with quantum=10ms for the given workload?

A.10 milliseconds

B.20 milliseconds ✅

C.23 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Under RR with quantum=10ms, P3 runs at time 20 in the first round. Its waiting time is 20 milliseconds (time spent waiting from time 0 to 20). It completes at time 23.

Q63. What is the waiting time for process P4 under the RR algorithm with quantum=10ms for the given workload?

A.10 milliseconds

B.20 milliseconds

C.23 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, P4 runs at time 23 in the first round. Its waiting time is 23 milliseconds (time spent waiting from time 0 to 23). It completes at time 30.

Q64. What is the waiting time for process P1 under the SJF algorithm for the given workload?

A.0 milliseconds

B.3 milliseconds

C.10 milliseconds ✅

D.20 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under SJF, P1 runs third after P3 and P4. Its waiting time is 3+7=10 milliseconds. It starts at time 10 and completes at time 20.

Q65. What is the waiting time for process P5 under the RR algorithm with quantum=10ms for the given workload?

A.20 milliseconds

B.23 milliseconds

C.40 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Under RR with quantum=10ms, P5 completes in the second round. Its waiting time is 40 milliseconds (time spent waiting from time 0 to its first execution at time 30, plus the time between its first and second execution).

Q66. What is the waiting time for process P2 under the RR algorithm with quantum=10ms for the given workload?

A.10 milliseconds

B.20 milliseconds

C.23 milliseconds

D.32 milliseconds ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: Under RR with quantum=10ms, P2 has waiting time of 32 milliseconds. This is the total time it spends waiting while other processes run: 10ms before its first run, 20ms between its first and second runs, and 2ms in the final round.

Q67. What is the main purpose of deterministic modeling?

A.To provide exact comparison of scheduling algorithms for specific workloads ✅

B.To design new operating systems

C.To model random arrivals

D.To predict future system behavior

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: The main purpose of deterministic modeling is to provide exact comparison of scheduling algorithms for specific, predetermined workloads. It allows direct calculation of performance metrics like waiting time for each algorithm.

Q68. What is the total burst time for all processes in the given workload?

A.32 milliseconds

B.49 milliseconds

C.61 milliseconds ✅

D.71 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: The total burst time for all processes is the sum: 10+29+3+7+12=61 milliseconds. This represents the total CPU time required to execute all processes.

Q69. What is the minimum average waiting time among the three algorithms for the given workload?

A.13 milliseconds ✅

B.23 milliseconds

C.28 milliseconds

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: The minimum average waiting time is 13 milliseconds, achieved by the SJF algorithm. This is less than RR (23ms) and FCFS (28ms).

Q70. What is the maximum average waiting time among the three algorithms for the given workload?

A.13 milliseconds

B.23 milliseconds

C.28 milliseconds ✅

D.32 milliseconds

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: The maximum average waiting time is 28 milliseconds, achieved by the FCFS algorithm. This is greater than RR (23ms) and SJF (13ms).

Q71. What does deterministic modeling require for input?

A.Only the number of processes

B.Only the scheduling algorithm

C.Exact numbers for the workload ✅

D.Only the time quantum

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Deterministic modeling requires exact numbers for input, including the burst times of all processes and their arrival times. This allows precise calculation of performance metrics for the given algorithms.

📝 Deterministic CPU Scheduling Algorithm Model (71 MCQs)

What is Deterministic CPU Scheduling Algorithm Model?

📝 All Deterministic CPU Scheduling Algorithm Model MCQs

🔗 Related Topics (MCQs)