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.

 91. If the quantum time of round robin algorithm is very large, then it is equivalent to: a. First in first out b. Shortest Job Next c. Lottery scheduling d. None of the above

 92. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero? a. This algorithm is equivalent to the first-come-first-serve algorithm b. This algorithm is equivalent to the round-robin algorithm c. This algorithm is equivalent to the shortest-job-first algorithm d. This algorithm is equivalent to the shortest-remaining-time-first algorithm

 93. Consider the 3 processes, P1, P2 and P3 shown in the table.Process Arrival time Time Units Required P1 0 5 P2 1 7 P3 3 4The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are a. FCFS: P1, P2, P3 RR2: P1, P2, P3 b. FCFS: P1, P3, P2 RR2: P1, P3, P2 c. FCFS: P1, P2, P3 RR2: P1, P3, P2 d. FCFS: P1, P3, P2 RR2: P1, P2, P3

 94. Consider the following table of arrival time and burst time for three processes P0, P1 and P2.Process Arrival time Burst TimeP0 : 0 ms 9 msP1 : 1 ms 4 msP2 : 2 ms 9 msThe pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes? a. 5.0 ms b. 4.33 ms c. 6.33 d. 7.33

 95. Which of the following statements are true?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. 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

 96. Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2. Group I Group II(P) Gang Scheduling (1) Guaranteed Scheduling(Q) Rate Monotonic Scheduling (2) Real-time Scheduling(R) Fair Share Scheduling (3) Thread Scheduling a. P – 3 Q – 2 R – 1 b. P – 1 Q – 2 R – 3 c. P – 2 Q – 3 R – 1 d. P – 1 Q – 3 R – 2

 97. An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:Process Execution time Arrival timeP1 : 20 0P2 : 25 15P3 : 10 30P4 : 15 45What is the total waiting time for process P2? a. 5 b. 15 c. 40 d. 55