Answer:
Explanation:
Keep in mind a lossy algorithm will lose information while a lossless algorithm maintains all your original information.
Therefore:
A. False, a lossy algorithm will not allow perfect reconstruction.
B. True, if you don't care about keeping all your information it's easier to compress.
C. False, you can use a lossless algorithm for anything.
D. False, the point of lossless is that you keep all information.
Answer:
let cookieNumber = Math.floor(Math.random() * 10)
switch (cookieNumber) {
case 1:
document.write('Fortune 1')
break;
case 2:
document.write('Fortune 2')
break;
case 3:
document.write('Fortune 3')
break;
case 4:
document.write('Fortune 4')
break;
case 5:
document.write('Fortune 5')
break;
case 6:
document.write('Fortune 6')
break;
case 7:
document.write('Fortune 7')
break;
case 8:
document.write('Fortune 8')
break;
case 9:
document.write('Fortune 9')
break;
case 10:
document.write('Fortune 10')
Explanation:
The cookieNumber is generated using Math.random(), which is rounded to a whole number using Math.floor(). Then, a switch block is used to display a different fortune depending on the value of cookieNumber.
Answer:
The blank space around the edges of a sheet of paper — as with the page of a book — that surrounds the text is called the margin.
Answer:
a) Speedup gain is 1.428 times.
b) Speedup gain is 1.81 times.
Explanation:
in order to calculate the speedup again of an application that has a 60 percent parallel component using Anklahls Law is speedup which state that:
Where S is the portion of the application that must be performed serially, and N is the number of processing cores.
(a) For N = 2 processing cores, and a 60%, then S = 40% or 0.4
Thus, the speedup is:
Speedup gain is 1.428 times.
(b) For N = 4 processing cores and a 60%, then S = 40% or 0.4
Thus, the speedup is:
Speedup gain is 1.81 times.
Italics
Italics
Italics
Italics
