0 votes 0 votes closed as a duplicate of: ISRO2015-33 Suppose a system contains 'n' processes and system uses the round robin algorithm for cpu scheduling then which data structure is best suited for ready queue of these process 1.stack 2.queue 3.circular queue 4.tree Kanchan kumari asked May 16, 2018 • closed May 16, 2018 by Soumya29 Kanchan kumari 367 views comment Share Follow See all 3 Comments See all 3 3 Comments reply Prateek Raghuvanshi commented May 16, 2018 i edited by Prateek Raghuvanshi May 16, 2018 reply Follow Share I think circular queue will be the answer. 0 votes 0 votes Kanchan kumari commented May 17, 2018 reply Follow Share Please explain how will be circular queue? 0 votes 0 votes Prateek Raghuvanshi commented May 17, 2018 reply Follow Share In round robin all process are executed on the basis of given time quantum ,so processes can't be executed at once (preemption due to time quantum).assume there are 4 processes and time quantum is 2 sec and all have burst time more than 2 sec .now acc. to arrival time first process will be executed for its time quantum 2 sec ,and for remaining burst time ,you have to keep this process somewhere .because this process executed first ,second time it should be run first ,for that queue data structure is best ,first in first out .circular queue is best for this ,because we don't want overflow of queue. Hope u understand...let me know 0 votes 0 votes Please log in or register to add a comment.