Top 550+ Solved Operating System (OS) MCQ Questions Answer
Q. Scheduling is done so as to
a. increase the throughput
b. decrease the throughput
c. increase the duration of a specific amount of work
d. none of the mentioned
Q. What is Turnaround time?
a. the total waiting time for a process to finish execution
b. the total time spent in the ready queue
c. the total time spent in the running queue
d. the total time from the completion till the submission of a process
Q. Scheduling is done so as to
a. increase the turnaround time
b. decrease the turnaround time
c. keep the turnaround time same
d. there is no relation between scheduling and turnaround time
Q. What is Waiting time?
a. the total time in the blocked and waiting queues
b. the total time spent in the ready queue
c. the total time spent in the running queue
d. the total time from the completion till the submission of a process
Q. Scheduling is done so as to
a. increase the waiting time
b. keep the waiting time the same
c. decrease the waiting time
d. none of the mentioned
Q. What is Response time?
a. the total time taken from the submission time till the completion time
b. the total time taken from the submission time till the first response is produced
c. the total time taken from submission time till the response is output
d. none of the mentioned
Q. Round robin scheduling falls under the category of
a. non-preemptive scheduling
b. preemptive scheduling
c. all of the mentioned
d. none of the mentioned
Q. With round robin scheduling algorithm in a time shared system
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
Q. The portion of the process scheduler in an operating system that dispatches processes is concerned with
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
Q. Complex scheduling algorithms
a. are very appropriate for very large computers
b. use minimal resources
c. use many resources
d. all of the mentioned
Q. 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
Q. The strategy of making processes that are logically runnable to be temporarily suspended is called
a. non preemptive scheduling
b. preemptive scheduling
c. shortest job first
d. first come first served
Q. What is Scheduling?
a. allowing a job to use the processor
b. making proper use of processor
c. all of the mentioned
d. none of the mentioned
Q. 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?
a. tq = 15ms
b. tq = 40ms
c. tq = 45ms
d. tq = 50ms
Q. Orders are processed in the sequence they arrive if rule sequences the jobs.
a. earliest due date
b. slack time remaining
c. first come, first served
d. critical ratio