A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

71. Round robin scheduling falls under the category of :
a. Non preemptive scheduling
b. Preemptive scheduling
c. Both of the above
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Preemptive scheduling

72. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).using very large time slices converts it into First come First served scheduling algorithm

73. 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 these
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).assigning ready processes to CPU

74. Complex scheduling algorithms :
a. are very appropriate for very large computers
b. use minimal resources
c. use many resources
d. All of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).are very appropriate for very large computers

75. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).first executes the job that came in first in the queue

76. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Preemptive scheduling

77. CPU Scheduling is :
a. allowing a job to use the processor
b. making proper use of processor
c. Both a and b
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Both a and b

78. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).tQ = 15ms

79. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Shortest Job First

80. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).I, II and III

Page 8 of 14