Quiz 4

Question 1

T/F: CPU scheduling decisions will take place when a new process is created

Answer 1

False

Question 2

When the current process runs until it uses up its entire time quantum, it will switch to state

Answer 2

ready

Question 3

What should the value of alpha be so that each prediction is based solely on the last observations

Answer 3

1

Question 4

T/F: If processes have exactly the same total CPU time requirement, then SJF and SRT could lead to starvation.

Answer 4

False

Question 5

4 Processes, P1-P4, each of length 4, execute under RR.

The time slice is 1 time unit.

P1 will terminate at the time

Answer 5

13

Question 6

When time quantum in RR is very large, RR approaches to

Answer 6

FIFO

Question 7

T/F: Multilevel scheduling is prone to starvation

Answer 7

False

Question 8

T/F: In multi-level feedback queue, if priority(A) > Priority(B) then process B will run.

Answer 8

False

Question 9

T/F: In priority-based scheduling, if high-priority processes use up a lot of CPU time, lower priority processes may starve and be postponed indefinitely.

Answer 9

True

Question 10

what is the ‘waiting time’ of a process defined as

Answer 10

the total time spent in the ready queue

Question 11

Which of the following statements are true?
1. Shortest remaining time first scheduling may cause starvation
2. Preemptive scheduling may cause starvation
3. Round robin is better than FCFS in terms of response time

Answer 11

1,2,3