A. Assigning ready processes to cpu B. Assigning ready processes to waiting queue C. Assigning running processes to blocked queue D. All of the mentioned
A. Using very large time slices converts it into first come first served scheduling algorithm B. Using very small time slices converts it into first come first served scheduling algorithm C. Using extremely small time slices increases performance D. Using very small time slices converts it into shortest job first 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
