Quiz 4 Flashcards

1
Q

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

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

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

A

ready

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

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

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

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

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

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

The time slice is 1 time unit.

P1 will terminate at the time

A

13

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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

A

FIFO

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

T/F: Multilevel scheduling is prone to starvation

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

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

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

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

A

the total time spent in the ready queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

1,2,3

How well did you know this?
1
Not at all
2
3
4
5
Perfectly