Answer:
29
Explanation:
for n=28:
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 28*28 + 28/2 = 798
Algorithm 2 performs f(n) = 12*28 + 500 = 836
for n=29
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 29*29 + 29/2 = 855.5
Algorithm 2 performs f(n) = 12*29 + 500 = 848
so, for n=29, algorithm 2 will be faster than algorithm 1
I think only II contains an error.
Tricky because, syntactically, all three are correct I.M.O.
However, if the goal is to iterate as many times as lotNumLength, then statement II loops one time too many. This is known as an off-by-one error.
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:
The internet is a vast network that connects computers, cellular devices, and cable together from all over the world. There is wireless internet (Wi-Fi) which doesn’t use lines/cables to connect to devices. Cellular technology provides wireless internet access through cellphones. Finally there is satellite which travels an enormous distance from Earth to a satellite.
E-mail administrators may make use of Circular Logging which overwrites a log file when it reaches a specified size or at the end of a specified time frame.Circular logging<span> is a method or feature used to conserve hard disk space by overwriting individual log files, thus keeping the transactional log to a minimum.</span>
