Operating systems Practice Quiz 3

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

A. Assigning ready processes to CPU

Scheduling is : A. allowing a job to use the processor B. making proper use of processor C. all of the mentioned D. none of the mentioned

A. allowing a job to use the processor

Complex scheduling algorithms: A. are very appropriate for very large computers B. use minimal resources C. use many resources D. all of the mentioned

A. are very appropriate for very large computers

An SJF algorithm is simply a priority algorithm where the priority is: A. the predicted next CPU burst B. the inverse of the predicted next CPU burst C. the current CPU burst D. anything the user wants

A. the predicted next CPU burst

With round robin schedulign 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

A. using very large time slices converts it into First come First served scheduling algorithm

The 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

B. First executes the job that came in first in the queue

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

B. Preemptive scheduling

Which of the following scheduling algorithms gives minimum average waiting time? A. FCFS B. SJF C. Round - robin D. Priority

B. SJF

The most optimal scheduling algorithm is: A. FCFS - First come First served B. SJF - Shortest Job First C. RR - Round Robin D. None of the mentioned

B. SJF - Shortest Job First

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

B. knowing the length of the next CPU request

The FCFS algorithm is particularly troublesome for ____________ A. time sharing systems B. multiprogramming systems C. multiprocessor systems D. operating systems

B. multiprogramming systems

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

C. first come, first served

One of the disadvantages of the priority scheduling algorithm is that: A. it schedules in a very complex manner B. its scheduling takes up a lot of time C. it can lead to some low priority process waiting indefinitely for the CPU D. none of the mentioned

C. it can lead to some low priority process waiting indefinitely for the CPU

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 timesharing 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

C. tQ = 45ms

A solution to the problem of indefinite blockage of low - priority processes is: A. Starvation B. Wait queue C. Ready queue D. Aging

D. Aging

Which of the following statements are true? I. Shortest remaining time first scheduling may cause starvation. II. Preemptive scheduling may cause starvation. III. Round robin is better than FCFS in terms of response time A. I only B. I and III only C. II and III only D. I, II and III

D. I, II and III

Preemptive Shortest Job First scheduling is sometimes called: A. Fast SJF scheduling B. EDF scheduling - Earliest Deadline First C. HRRN scheduling - Highest Response Ratio Next D. SRTN scheduling - Shortest Remaining Time Next

D. SRTN scheduling - Shortest Remaining Time Next

Which of the following statements are true? i) Shortest remaining time first scheduling may cause starvation. ii) Preemptive scheduling may cause starvation. iii) Round robin is better than FCFS in terms of response time. A. i only B. i and iii only C. ii and iii only D. i, ii and iii

D. i, ii and iii

'Aging' is: A. keeping track of cache contents B. keeping track of what pages are currently residing in memory C. keeping track of how many times a given page is referenced D. increasing the priority of jobs to ensure termination in a finite time

D. increasing the priority of jobs to ensure termination in a finite time