Answer:
None of those answers is correct because E[1101] is index out of range.
Answer: d. the time quantum should be as small as possible.
Explanation: Round robin is a CPU scheduling algorithm. If the time quantum is extremely small, number of context switches is very high, round robin scheduling will be same as processor sharing algorithm. Then the algorithm is good. Very large time quantum will make response time of processes too much which may not be tolerated in interactive environment.
Answer:
i not know mainframe computer there is many use of computer
This is honestly an answer you can give. What would you name a business if you made one?
