Perform the following multiplications: a. (x^3 + x^2 + x + 1) * (x^2 + 1)...
Perform the following multiplications:
a. (x^3 + x^2 + x + 1) * (x^2 + 1) in GF(2^4) using (x^4 +
x^3 + 1) as modulus
b. (10101) by (10000) in GF(2^5) using (x^5 + x^2+ 1) as
modulus
Homework Answers
Add Answer to:
Perform the following multiplications:
a. (x^3 + x^2 + x + 1) * (x^2 + 1)...
a) Perform the following matrix multiplications. You do not need to show your work. 1 [...
a) Perform the following matrix multiplications. You do not need to show your work. 1 [ 2 -4 -1 3 1 -5 -1 6 2 3 2 - 2 -1 1 -3 -4 1 0 -7 1 ii) 3 -4 -9 7 2 5
2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...
2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x 1011 3. Perform the following binary divisions, assuming unsigned integers: B. 10000001 / 101 C. 1001010010 / 1011 4. Assume we are using the simple model for floating-point representation as given in the text (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 16, a normalized mantissa of 8 bits, and single sign bit for the number ):...
Compute each of the following matrix multiplications or say why it is impossible. 1 2[2 3 1-3 4 0 4 1 3 -1 6 (iii) [0-3...
Compute each of the following matrix multiplications or say why it is impossible. 1 2[2 3 1-3 4 0 4 1 3 -1 6 (iii) [0-33][2 33] 0 4 34 1 2
Compute each of the following matrix multiplications or say why it is impossible. 1 2[2 3 1-3 4 0 4 1 3 -1 6 (iii) [0-33][2 33] 0 4 34 1 2
Perform the following binary multiplications using 7-bit signed numbers in two's complement format. Convert them to...
Perform the following binary multiplications using 7-bit signed numbers in two's complement format. Convert them to decimal, and verify the correct result of the operation.
Consider the problem of computing the power function pow(n,x) = n^x using only multiplications. The first...
Consider the problem of computing the power function pow(n,x) = n^x using only multiplications. The first approach is to perform x multiplications ($n \cdot n \cdot n \cdot \ldots \cdot n$, x times). Find a better, recursive algorithm to solve this problem (by better, we mean one that uses fewer than $x$ multiplications). Write down the pseudocode for this new function, and then analyze the runtime of that recursive program by first writing out the recurrence relation $T(n, x)$ that...
Consider the problem of computing the power function pow(n,x) = n^x using only multiplications. The first approach is to...
Consider the problem of computing the power function pow(n,x) = n^x using only multiplications. The first approach is to perform x multiplications ($n \cdot n \cdot n \cdot \ldots \cdot n$, x times). Find a better, recursive algorithm to solve this problem (by better, we mean one that uses fewer than $x$ multiplications). Write down the pseudocode for this new function, and then analyze the runtime of that recursive program by first writing out the recurrence relation $T(n, x)$ that...
Write a program that asks a user to enter a number and the number of multiplications...
Write a program that asks a user to enter a number and the number of multiplications of that number to display Remember to use String.format() for this exercise. Enter a number: 2 Enter the multiplications: 10 2 x 1 = 2 2 x 2 = 4 2 x 3 = 6 2 x 4 = 8 2 x 5 = 10 2 x 6 = 12 2 x 7 = 14 2 x 8 = 16 2 x 9 =...
(Basic) We would like to minimize the number of (scalar) multiplications used to compute the product...
(Basic) We would like to minimize the number of (scalar)
multiplications used to compute the product of four matrices,
A1A2A3A4, where the matrices have dimensions 3 × 2, 2 × 4, 4 × 3, 3
× 3, respectively. Recall that we defined m[i, j] to the be the
minimum number of multiplications needed to compute the product
AiAi+1 · · · Aj . Fill out the DP table completely. In other words,
compute m[1, 1], m[2, 2], m[3, 3], m[4,...
1）Find the square of a complex number z=a+ib using only two real number multiplications plus as ...
1）Find the square of a complex number z=a+ib using only two real number multiplications plus as many additions and subtractions as you wish. 2）Multiply two complex numbers z1=a+ib and z2=c+id using only 3 real number multiplications. 3）Compute (a+ib)2(c+id)2 using only 5 real number multiplications.
4. [16 marks total (6 marks each)] Do a worst-case analysis for the following algorithm segments, counting the number of multiplications which occur. I have marked the lines with the multiplications...
4. [16 marks total (6 marks each)] Do a worst-case analysis for the following algorithm segments, counting the number of multiplications which occur. I have marked the lines with the multiplications you are to count with ). For all of these algorithms, use n as your fixed input size (even though n doesn't really represent the "size" of the input). Be sure to include an explanation with your answers to obtain full marks. (a) t-10; for (i-1;in-H) t-5*t; (b) (For...
a) Perform the following matrix multiplications. You do not need to show your work. 1 [ 2 -4 -1 3 1 -5 -1 6 2 3 2 - 2 -1 1 -3 -4 1 0 -7 1 ii) 3 -4 -9 7 2 5
Compute each of the following matrix multiplications or say why it is impossible. 1 2[2 3 1-3 4 0 4 1 3 -1 6 (iii) [0-33][2 33] 0 4 34 1 2
Compute each of the following matrix multiplications or say why it is impossible. 1 2[2 3 1-3 4 0 4 1 3 -1 6 (iii) [0-33][2 33] 0 4 34 1 2
Perform the following binary multiplications using 7-bit signed numbers in two's complement format. Convert them to decimal, and verify the correct result of the operation.
(Basic) We would like to minimize the number of (scalar)
multiplications used to compute the product of four matrices,
A1A2A3A4, where the matrices have dimensions 3 × 2, 2 × 4, 4 × 3, 3
× 3, respectively. Recall that we defined m[i, j] to the be the
minimum number of multiplications needed to compute the product
AiAi+1 · · · Aj . Fill out the DP table completely. In other words,
compute m[1, 1], m[2, 2], m[3, 3], m[4,...
4. [16 marks total (6 marks each)] Do a worst-case analysis for the following algorithm segments, counting the number of multiplications which occur. I have marked the lines with the multiplications you are to count with ). For all of these algorithms, use n as your fixed input size (even though n doesn't really represent the "size" of the input). Be sure to include an explanation with your answers to obtain full marks. (a) t-10; for (i-1;in-H) t-5*t; (b) (For...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 11 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 11 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 11 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 11 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 11 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 11 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 11 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 11 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 11 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 11 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 11 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 11 months ago