21. What is AA BA in 8-bit unsigned representation? [all numbers are given in hex] a. Overflow b. 10 1A C. d. A1 22. Wh...
101b= 2610, what is b? How the following numbers will be represented in 4-bit (a) sign-magnitude (b) two’s complement and (c) unsigned representations. Indicate if not possible. 2, 5, 7, 8 How the following negative numbers will be represented in 4-bit (a) sign-magnitude and b) two’s complement representations. Indicate if not possible. -2, -5, -7, -8 Consider the following java program snippet (hint: byte is represented as 8-bit 2’s complement number in java- run the program in java to check it). What will be printed? Explain....
CruzlD: @ucsc.odu Arithmetic and Logical Operations 19. Which of these 8-bit two's complement computations has carry out but no overflow? Select two answers: 1 1 011001 10 0 111 1 110 O A. averflas 1IIOOIOO O B. 1 0000000 has 11 1 1 111 1 co has c.o 1110i no dverfle + 0100 1101 1 1 01 011 O D. overluw + 0101 1 1 0 1 E 1 1 10 1 0 + 11 1 1 1000 20. Using...
ints) The following questions pertain to machine numbers (a) (2 points) For an 8-bit unsigned integer, what is the decimal equivalent of 10010101? (b) (3 points) For an S-bit signed integer, what is the decimal equivalent for the 2's compliment of 11010101? (c) (5 points) Consider an 8-bit floating point number like the one in Homework A2 (one sign bit, three exponent bits, and four assignable mantissa bits), what is the floating point number that associates with 01101 1001? ints)...
HW3: Problem 1: (first, study the example-1 in page-6) A computer uses 8-bit for FLP (1 bit for sign, 4 bit for exponent with excess-7 rep. (see table below), rest for magnitude). Assume 0000 and 1111 in exponent field are reserved for denormalization. 6 Decimal 0 Unsigned 0000 Excess-7 Reserved used as -6 in unnormalized 1 0001 -6 2 0010 -5 3 0011 -4 4 0100 -3 5 0101 -2 0110 -1 7 0111 0 9 Decimal 8 Unsigned 1000...
6. Convert .3710 to a binary fraction of 10 binary digits. 7. Use two's compliment arithmetic to perform the following 8 bit binary operations. a. 0010 1110 + 0001 1011 b. 0101 1101 – 0011 1010 c. 1011 1000 – 1000 1011 d. 1000 1100 – 1111 0111 8. Convert 150.8476562510 to IEEE Floating Point Standard. 9. Simplify the following Boolean expressions. a. xy + xy + xz b. (w + x)(x + y)(w + x + y + z)...
Given the following 16 bit numbers: A.) 0x8FFF B.) 0x1000 C.) Ox00FO D.) 0x0888 E.) 0xC000 F) 0x9000 . If the numbers are unsigned integers rank them from smallest to larest )rank them from smallest to largest 10. If the above number are signed integers (2's complement 11Acomputer has a 16 bit address field,is byte addressable, the word length is also 16 bits, 32 lines of direct mapped cache and each line of cache holds 8 bytes. A.) How many...