Complex scheduling algorithms ____________

• A. Are very appropriate for very large computers
• B. Use minimal resources
• C. Use many resources
• D. All of the mentioned

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

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

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

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

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

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

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

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

• A. I only
• B. I and iii only
• C. Ii and iii only
• D. I, ii and iii

Concurrent access to shared data may result in ____________

• A. Data consistency
• B. Data insecurity
• C. Data inconsistency
• D. None of the mentioned