Operating System Set 8
On This Page
This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 8
Q1 | An I/O bound program will typically have
- a few very short cpu bursts
- many very short i/o bursts
- many very short cpu bursts
- a few very short i/o bursts
Q2 | A process is selected from the queue by the scheduler, to be executed.
- blocked, short term
- wait, long term
- ready, short term
- ready, long term
Q3 | In the following cases non – preemptive scheduling occurs?
- when a process switches from the running state to the ready state
- when a process goes from the running state to the waiting state
- when a process switches from the waiting state to the ready state
- all of the mentioned
Q4 | The switching of the CPU from one process or thread to another is called
- process switch
- task switch
- context switch
- all of the mentioned
Q5 | What is Dispatch latency?
- the speed of dispatching a process from running to the ready state
- the time of dispatching a process from running to ready state and keeping the cpu idle
- the time to stop one process and start running another one
- none of the mentioned
Q6 | Scheduling is done so as to
- increase cpu utilization
- decrease cpu utilization
- keep the cpu more idle
- none of the mentioned
Q7 | Scheduling is done so as to
- increase the throughput
- decrease the throughput
- increase the duration of a specific amount of work
- none of the mentioned
Q8 | What is Turnaround time?
- the total waiting time for a process to finish execution
- the total time spent in the ready queue
- the total time spent in the running queue
- the total time from the completion till the submission of a process
Q9 | Scheduling is done so as to
- increase the turnaround time
- decrease the turnaround time
- keep the turnaround time same
- there is no relation between scheduling and turnaround time
Q10 | What is Waiting time?
- the total time in the blocked and waiting queues
- the total time spent in the ready queue
- the total time spent in the running queue
- the total time from the completion till the submission of a process
Q11 | Scheduling is done so as to
- increase the waiting time
- keep the waiting time the same
- decrease the waiting time
- none of the mentioned
Q12 | What is Response time?
- the total time taken from the submission time till the completion time
- the total time taken from the submission time till the first response is produced
- the total time taken from submission time till the response is output
- none of the mentioned
Q13 | Round robin scheduling falls under the category of
- non-preemptive scheduling
- preemptive scheduling
- all of the mentioned
- none of the mentioned
Q14 | With round robin scheduling algorithm in a time shared system
- using very large time slices converts it into first come first served scheduling algorithm
- using very small time slices converts it into first come first served scheduling algorithm
- using extremely small time slices increases performance
- using very small time slices converts it into shortest job first algorithm
Q15 | The portion of the process scheduler in an operating system that dispatches processes is concerned with
- assigning ready processes to cpu
- assigning ready processes to waiting queue
- assigning running processes to blocked queue
- all of the mentioned
Q16 | Complex scheduling algorithms
- are very appropriate for very large computers
- use minimal resources
- use many resources
- all of the mentioned
Q17 | What is FIFO algorithm?
- first executes the job that came in last in the queue
- first executes the job that came in first in the queue
- first executes the job that needs minimal processor
- first executes the job that has maximum processor needs
Q18 | The strategy of making processes that are logically runnable to be temporarily suspended is called
- non preemptive scheduling
- preemptive scheduling
- shortest job first
- first come first served
Q19 | What is Scheduling?
- allowing a job to use the processor
- making proper use of processor
- all of the mentioned
- none of the mentioned
Q20 | 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
Q21 | Orders are processed in the sequence they arrive if rule sequences the jobs.
- earliest due date
- slack time remaining
- first come, first served
- critical ratio
Q22 | Which of the following algorithms tends to minimize the process flow time?
- first come first served
- shortest job first
- earliest deadline first
- longest job first
Q23 | Under multiprogramming, turnaround time for short jobs is usually and that for long jobs is slightly
- lengthened; shortened
- shortened; lengthened
- shortened; shortened
- shortened; unchanged
Q24 | Which is the most optimal scheduling algorithm?
- fcfs – first come first served
- sjf – shortest job first
- rr – round robin
- none of the mentioned
Q25 | The real difficulty with SJF in short term scheduling is
- it is too good an algorithm
- knowing the length of the next cpu request
- it is too complex to understand
- none of the mentioned