WorksheetsOperating Systems
Total questions: 12
Worksheet time: 6mins
Round robin scheduling falls under the category of ____________
Non-preemptive scheduling
Preemptive scheduling
All of the mentioned
None of the mentioned
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
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
Complex scheduling algorithms ____________
are very appropriate for very large computers
use minimal resources
use many resources
all of the mentioned
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
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
What is Scheduling?
allowing a job to use the processor
making proper use of processor
all of the mentioned
none of the mentioned
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
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
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
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
Lengthened; Shortened
Shortened; Lengthened
Shortened; Shortened
Shortened; Unchanged
Which of the following statements are true? (GATE 2010)
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
I only
I and III only
II and III only
I, II and III
