Deck 8: Understanding Process Scheduling in Operating Systems

Question 1

An I/O bound program will typically have

A)a few very short cpu bursts
B)many very short i/o bursts
C)many very short cpu bursts
D)a few very short i/o bursts

Answer 1

many very short cpu bursts

Question 2

A process is selected from the___________   queue by the___________  scheduler, to be executed.

A)blocked, short term
B)wait, long term
C)ready, short term
D)ready, long term

Answer 2

ready, short term

Question 3

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

Answer 3

when a process goes from the running state to the waiting state

Question 4

The switching of the CPU from one process or thread to another is called

A)process switch
B)task switch
C)context switch
D)all of the mentioned

Question 5

What is Dispatch latency?

A)the speed of dispatching a process from running to the ready state
B)the time of dispatching a process from running to ready state and keeping the cpu idle
C)the time to stop one process and start running another one
D)none of the mentioned

Question 6

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

Question 7

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

Question 8

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

Question 9

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

Question 10

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

Question 11

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

Question 12

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

Question 13

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

Question 14

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

Question 15

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

Question 16

Complex scheduling algorithms

A)are very appropriate for very large computers
B)use minimal resources
C)use many resources
D)all of the mentioned

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

Which of the following algorithms tends to minimize the process flow time?

A)first come first served
B)shortest job first
C)earliest deadline first
D)longest job first

Question 22

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

Question 23

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

Question 24

The real difficulty with SJF in short term scheduling is___________

A)it is too good an algorithm
B)knowing the length of the next cpu request
C)it is too complex to understand
D)none of the mentioned