A. Time sharing systems
B. Multiprogramming systems
C. Multiprocessor systems
D. Operating systems

A. It is too good an algorithm
B. Knowing the length of the next cpu request
C. It is too complex to understand
D. None of the mentioned

A. The waiting time for process p1 is 3ms
B. The waiting time for process p1 is 0ms
C. The waiting time for process p1 is 16ms
D. The waiting time for process p1 is 9ms

A. Fast sjf scheduling
B. Edf scheduling €? earliest deadline first
C. Hrrn scheduling €? highest response ratio next
D. Srtn scheduling €? shortest remaining time next

A. The predicted next cpu burst
B. The inverse of the predicted next cpu burst
C. The current cpu burst
D. Anything the user wants

A. It schedules in a very complex manner
B. Its scheduling takes up a lot of time
C. It can lead to some low priority process waiting indefinitely for the cpu
D. None of the mentioned

A. Keeping track of cache contents
B. Keeping track of what pages are currently residing in memory
C. Keeping track of how many times a given page is referenced
D. Increasing the priority of jobs to ensure termination in a finite time

A. Starvation
B. Wait queue
C. Ready queue
D. Aging

A. I only
B. I and iii only
C. Ii and iii only
D. I, ii and iii

A. Fcfs
B. Sjf
C. Round €? robin
D. Priority