12 13 14 1.6 17 Calculate A + B, A — B, A x B, and A + B for the following pairs of binary numbers. (a) 10101, 1011 (e) 1101011, L010 (b) 1011010, 101111 (f) 1010101, 101010 fc) 101, 1011 (g) 10000, 1001 (d) 10110110, O1011011 (h) 1011.0101, 110.11 Calculate A+B, A — B, Ax B, and A= B for the following pairs of octal numbers. (a) 372,156 (¢) 1000, 777 (b) 704, 230 (d) 423,651 Calculate A + B, A — B, A x B,and A = B for the following pairs of hexadec- i bers. i) 30K 2B (©) 9A5, DIT (b) FFFF, 1000 (d) 372, 156 Convert each of the following decimal numbers to binary, octal, and hexadecim: numbers. @) 27 @ 065 tb) 915 (&) 174.25 (©) 0.375 () 250.8 Convert each of the following binary numbers to octal, hexadecimal, and decimi numbers using the most appropriate conversion method, (a) 1101 (@) 0.01101 (b) 101110 (e) 10101.11 (©) 0.101 (D 10110110.001 Convert each of the following octal numbers to binary, hexadecimal, and decima using the most appropriate conversion method. (a) 65 (d) 2000 (b) 371 {e) WI11L (c) 240.51 (177777 Convert each of the following hexadecimal numbers to binary, octal, and decima using the most appropriate conversion method. (a) 4F (a) 2000 (b) ABC (e) 2014 (©) F8.A7 () 3D65E1.8 Find the two's complement of each of the following binary numbers assuming n=B. (a) 101010 @) wait (b) 1101011 (e) 10000000 © 0 (© 11000 9 Find the one’s complement of each of the following binary numbers assuming n=8. (a) 110101 (4) 10000000 (b) 1010011 (©) 100001 ©o () ona 10 Calculate A + B, A — B,-A + B, and —A — B for each of the following pairs of numbers assuming a two's complement number system and n = 8. Check your results by decimal arithmetic. Explain any unusual results, (a) 1010101, 1010 (©) 11101010, 101111 (b) 1101011, 0101010 (4) 10000000, 01111111 ‘Il Repeat Problem 1.10 for the following numbers using a one’s complement number system. (a) 101011, 1101 (©) 1010101, 0101010 (b) 10111010, 11010 (4) 10000000, 01111111 1.12 Show how a 16-bit computer using a two's complement number system would perform the following computations. (a) (16850), + (2925)\_ = (ig (b) (16850) y — (2925), = yo fe) (2925), — (16850), = (D5 (d) (2925), — (16850), = Cj, 1.13 Encode each of the following numbers in BCD and in excess-3 codes. (a) 39 (ce) 94704 (b) 1950 (dy 625 1.16 How many bit errors can be detected in a two-out-of-five code? How many errors, if any, can be corrected in a two-out-of-ti code? Prove your answers: mathematically.1.19 1.20 Let 10111001 be an error word trom Hamming code 2. Determine the correct code word by computing the difference and distance between the error word and each valid code word. Develop a syndrome table for Hamming code 2 that covers the error-free case. all single errors, and all double errors. Is there a simple characterization of the double-error syndromes? Are there any erfor patterns of three or more errors that the code can detect?”