Question

In: Electrical Engineering

Part 1: Solve the operation 75.38-18.62 in binary using two's complement. Use 6 bits for the...

Part 1: Solve the operation 75.38-18.62 in binary using two's complement. Use 6 bits for the fractionary part.

Part 2:Convert the result to a decimal, and explain how much is the absolute error obtained in the operation.

(Provide Step by Step process of problem solving in each part.)

Solutions

Expert Solution


Related Solutions

(a) Do operation 75.38 - 18.62 in binary using two's complement. Use for the fractional part...
(a) Do operation 75.38 - 18.62 in binary using two's complement. Use for the fractional part 6 bits (b) Convert the resulting expression to decimal, and say how much is the absolute error obtained in the operation.
PROBLEM 2 (a) Do operation 75.38 - 18.62 in binary using two's complement. Use for the...
PROBLEM 2 (a) Do operation 75.38 - 18.62 in binary using two's complement. Use for the 6 bit fractional part (b) Convert the resulting expression to decimal, and say how much is the absolute error obtained in the operation
Show decimal values below in two complement binary notation with 6 bits. a) 18 b) -12
Show decimal values below in two complement binary notation with 6 bits. a) 18 b) -12
Find the solution of the following operation for binary numbers 11011.111- * 100101.01 using2'complement
Find the solution of the following operation for binary numbers 11011.111- * 100101.01 using2'complement
1. Obtain the 1’s complement, 2’s complement and sign magnitude system representation in 7 bits for...
1. Obtain the 1’s complement, 2’s complement and sign magnitude system representation in 7 bits for the following decimal numbers: a) 1510 b) -2110 c) 3510 d) -2710 2. Use 1’s and 2’s complement system to perform the following calculations and mention if there will be overflow or not: a) 1100 – 0101 b) 1010 + 0100 c) 01100 + 00111
Complete the matrix below (use 4 bits) Signed Integer Signed Magnitude 1’s Complement 2’s Complement Excess-7...
Complete the matrix below (use 4 bits) Signed Integer Signed Magnitude 1’s Complement 2’s Complement Excess-7 5 -3
Complete the matrix below (use 4 bits) Signed Integer Signed Magnitude 1’s Complement 2’s Complement Excess-7...
Complete the matrix below (use 4 bits) Signed Integer Signed Magnitude 1’s Complement 2’s Complement Excess-7 5 -3
1-How is -89 represented using 8-bit two's compliment? (The answer should be 8 binary digits). 2-What...
1-How is -89 represented using 8-bit two's compliment? (The answer should be 8 binary digits). 2-What is 10101100 - 00100100 using 2's compliment arithmetic? (The answer should be 8 binary digits) 3-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 15, a normalized mantissa of 8 bits, and a single sign bit for the number):Show how the computer would...
using 8 bits and 2s complement integer arithmetic, show how a processor would calculate 63 -...
using 8 bits and 2s complement integer arithmetic, show how a processor would calculate 63 - 17
(6) Define a binary operation ∗ on the set G = R^2 by (x, y) ∗...
(6) Define a binary operation ∗ on the set G = R^2 by (x, y) ∗ (x', y') = (x + x', y + y'e^x) (a) Show that (G, ∗) is a group. Specifically, prove that the associative law holds, find the identity e, and find the inverse of (x, y) ∈ G. (b) Show that the group G is not abelian. (c). Show that the set H= (x*x=e) is a subgroup of G.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT