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
Correct Answer:
Verified
Q9: Scheduling is done so as to
A)increase the
Q10: What is Waiting time?
A)the total time in
Q11: Scheduling is done so as to
A)increase the
Q12: What is Response time?
A)the total time taken
Q13: Round robin scheduling falls under the category
Q15: The portion of the process scheduler in
Q16: Complex scheduling algorithms
A)are very appropriate for very
Q17: What is FIFO algorithm?
A)first executes the job
Q18: The strategy of making processes that are
Q19: What is Scheduling?
A)allowing a job to use
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents