Question 11 : Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
1. Lengthened; Shortened
2. Shortened; Lengthened
3. Shortened; Shortened
4. Shortened; Unchanged
View Answer   Discuss with Members

Question 12 : Which of the following algorithms tends to minimize the process flow time ?
1. First come First served
2. Shortest Job First
3. Earliest Deadline First
4. Longest Job First
View Answer   Discuss with Members

Question 13 : Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
1. earliest due date
2. slack time remaining
3. first come, first served
4. critical ratio
View Answer   Discuss with Members

Question 14 : 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 ?
1. tQ = 15ms
2. tQ = 40ms
3. tQ = 45ms
4. tQ = 50ms
View Answer   Discuss with Members

Question 15 : Scheduling is :
1. allowing a job to use the processor
2. making proper use of processor
3. all of the mentioned
4. none of the mentioned
View Answer   Discuss with Members

Question 16 : The strategy of making processes that are logically runnable to be temporarily suspended is called :
1. Non preemptive scheduling
2. Preemptive scheduling
3. Shortest job first
4. First come First served
View Answer   Discuss with Members

Question 17 : The FIFO algorithm :
1. first executes the job that came in last in the queue
2. first executes the job that came in first in the queue
3. first executes the job that needs minimal processor
4. first executes the job that has maximum processor needs
View Answer   Discuss with Members

Question 18 : Complex scheduling algorithms :
1. are very appropriate for very large computers
2. use minimal resources
3. use many resources
4. all of the mentioned
View Answer   Discuss with Members

Question 19 : The portion of the process scheduler in an operating system that dispatches processes is concerned with :
1. assigning ready processes to CPU
2. assigning ready processes to waiting queue
3. assigning running processes to blocked queue
4. all of the mentioned
View Answer   Discuss with Members

Question 20 : With round robin scheduling algorithm in a time shared system,
1. using very large time slices converts it into First come First served scheduling algorithm
2. using very small time slices converts it into First come First served scheduling algorithm
3. using extremely small time slices increases performance
4. using very small time slices converts it into Shortest Job First algorithm
View Answer   Discuss with Members