6 votes 6 votes With Round-Robin CPU scheduling in a time shared system using very large time slices (quantas) degenerates into First-Come First served (FCFS) algorithm. using extremely small time slices improves performance using very small time slices degenerates into Last-In First-Out (LIFO) algorithm. using medium sized times slices leads to shortest Request time First (SRTF) algorithm Operating System isro2008 operating-system process-scheduling + – go_editor asked Jun 12, 2016 go_editor 3.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 14 votes 14 votes Answer : A Using very large time slices (quantas) degenerates into First-Come First served (FCFS) algorithm. And all the processes will be able to get completed very fast. shekhar chauhan answered Jun 12, 2016 • selected May 2, 2017 by srestha shekhar chauhan comment Share Follow See 1 comment See all 1 1 comment reply SABAREESH V commented Jul 23, 2022 reply Follow Share Degeneration means decline /not possible If we increase the time quantum of Round Robin Algorithm then the scheduling will acts like First come First serve (FCFS) How you should say it will degenerates FCFS The option A is wrong 0 votes 0 votes Please log in or register to add a comment.
6 votes 6 votes Ans A)using very large time slices (quantas) degenerates into First-Come First served (FCFS) algorithm srestha answered Jun 12, 2016 srestha comment Share Follow See 1 comment See all 1 1 comment reply teja1521 commented Jan 7, 2020 reply Follow Share Can you explain option B? 0 votes 0 votes Please log in or register to add a comment.
