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.
In what topic ?? Please explain more
Answer:
it is i got in troble for playing it so much lol
Explanation:
sorry for the spelling
This question has a ton of answers to it but, here are some basic ideas to help you out
- Cars 1900's vs today
- Computers 1980's vs today
- Guns 1800's vs today
- Televisions 1900's vs today
- Telescopes/Microscopes
Answer: Yes
Explanation: Greedy algorithm is the algorithm that gives the solution to the problem on the basis of the piece by piece or step by step architecture. the next step of the solution is based on the aim of solving problem optimally.But the steps chosen can be correct or incorrect.
Non-deterministic nature is the feature that determines that the steps that is being chosen is not the most optimal one and no high surety is present.Thus, this nature is present in the greedy algorithm and it has non-deterministic nature.
