An i/o-bound program is one that, if run alone, would spend more time waiting for i/o than using the processor. a processor-bound program is the opposite. suppose a short-term scheduling algorithm favors those programs that have used little processor time in the recent past. explain why this algorithm favors i/o-bound programs and yet does not permanently deny processor time to processor-bound programs.

Answer with Explanation:

An I/O-bound the programs that are used relatively a little processor times and are favored by an algorithm. However, if the processor bound process is denied the processor time for the sufficiently long periods of times, the same algorithms will be granted a processor to the process and it has not use the processors at all in recent pasts. Therefore, the processor bound process will not be the permanently denied to access.

well cos like a ds it doesn't really die out, unlike for example, fifa, they always come out with a new version, so lets say your fifa 18 is charging you to update the teams and stuff, so, if messi were to go to real madrid (never gonna happen) it would switch messi to the other team, until the owners of fifa come out with fifa 19, then the game would eventually stop updating, and back to the ds, it doesn't really stop working after sometime because there's lots of things that it could be used for, and idk if u know what i'm saying, but long story short, samsung, represents the ds, if they still work, and people love them but not the new version, the old version still works, so they don't really force people to buy new phones, get me?