Operating System Test 1 Computer Subject
Operating System Test 1 Computer Subject
Question 41
Medium term scheduling is performed _____?
Medium-term scheduling brings processes back from waiting to ready state.
Not clear enough?
Question 42
_____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.
SJF uses exponential averaging to predict CPU bursts.
Not clear enough?
Question 43
Assume there are 4 processes in the system running or ready to run. If round robin scheduling algorithm with a time quantum of 15 ms is used, then a waiting process will not wait more than ______?
With 4 processes and 15 ms time quantum, maximum wait is 45 ms.
Not clear enough?
Question 44
In which of the following scheduling algorithms, starvation is possible?
Starvation can occur in multi-level queue scheduling due to priority-based execution.
Not clear enough?
Question 45
In operating system, each process has its own _____?
Processes maintain their own files, address space, and signal handlers.
Not clear enough?
Question 46
The SJF algorithm executes first the job _____?
Shortest Job First prioritizes the job with the least processor needs.
Not clear enough?
Question 47
The _____ scheduling algorithm is designed especially for time sharing systems.
Round Robin scheduling is best suited for time sharing systems.
Not clear enough?
Question 48
Which of the following scheduling algorithms must be non-preemptive?
FCFS scheduling is strictly non-preemptive.
Not clear enough?
Question 49
_____ takes a particular predetermined workload and defines the performance of each method for that workload.
Deterministic modeling evaluates scheduling performance for a fixed workload.
Not clear enough?
Question 50
What is the ready state of a process?
Ready state means the process is prepared to run once scheduled.
