MCQOPTIONS
Saved Bookmarks
| 1. |
Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processes |
| A. | stack |
| B. | queue |
| C. | circular queue |
| D. | tree |
| Answer» D. tree | |