OS CPU Scheduling
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
tQ = 15ms
tQ = 40ms
tQ = 45ms
tQ = 50ms
tQ = 15ms
Related posts
Scheduling is done so as to ____________A. increase CPU utilization
B. decrease CPU utilization
C. keep the CPU more idle
D. none of the mentioned
In multilevel feedback scheduling algorithm ____________
A. a process can move to a different classified ready queue
B. classification of ready queue is permanent
C. processes are not classified into groups
D. none of the mentioned
What is FIFO algorithm?
A. first executes the job that came in last in the queue
B. first executes the job that came in first in the queue
C. first executes the job that needs minimal processor
D. first executes the job that has maximum processor needs
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
A. Lengthened; Shortened
B. Shortened; Lengthened
C. Shortened; Shortened
D. Shortened; Unchanged
In the following cases non โ preemptive scheduling occurs?
A. When a process switches from the running state to the ready state
B. When a process goes from the running state to the waiting state
C. When a process switches from the waiting state to the ready state
D. All of the mentioned
Which is the most optimal scheduling algorithm?
A. FCFS โ First come First served
B. SJF โ Shortest Job First
C. RR โ Round Robin
D. None of the mentioned
The interval from the time of submission of a process to the time of completion is termed as ____________
A. waiting time
B. turnaround time
C. response time
D. throughput
Leave a Reply