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:
A. the museum can choose a heuristic approach which will achieve a lossless compression, but they cannot be sure that it is the most efficient compression for each image
C. algorithms for lossless compression exist, so the museum can use those to compress the image
Explanation:
Answer:5 i think im not sure though
Explanation:
