000I1001 (y)53. Add the following BCD numbers:(a) 1000 + 0110(b) 0111 + 0101(c) 1001 + 1000(e) 00100101 + 00100111(g) 10011000 + 10010111(d) 1001 + 0111(f) 01010001 + 01011000(h) 010101100001 + 01110000100054. Convert cach pair of decimal numbers to BCD, and add as indicated:(a) 4 - 3(b) 5 + 2(d) 17 + 12ie) 28 - 23 (f) 65 + 58(g) 113 + 101 (h) 295 – 157

We are going to add BCD numbers. If sum of two digit of BCD numbers are invalid( more than 9) then…

53. Add the following BCD numbers: (a) 1000 + 0110 (b) 0111 + 0101 (c) 1001 + 1000 (e) 00100101 + 00100111 (g) 10011000 + 10010111 (d) 1001 + 0111 (h) 010101100001 + 011100001000 54. Convert each pair of decimal numbers to BCD, and add as indicated: (d) 17 12 (g) 113 + 101 (h) 295 157 (a) 4 - 3 (b) 5 2 re) 28 - 23 (f) 65 + 58

53. Add the following BCD numbers: (a) 1000 + 0110 (b) 0111 + 0101 (c) 1001 + 1000 (e) 00100101 + 00100111 (g) 10011000 + 10010111 (d) 1001 + 0111 (h) 010101100001 + 011100001000 54. Convert each pair of decimal numbers to BCD, and add as indicated: (d) 17 12 (g) 113 + 101 (h) 295 157 (a) 4 - 3 (b) 5 2 re) 28 - 23 (f) 65 + 58

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Add the following BCD numbers:(a) 1000 + 0110 (b) 0111 + 0101(c) 1001 + 1000 (d) 1001 + 0111(e) 00100101 + 00100111 (f) 01010001 + 01011000(g) 10011000 + 10010111 (h) 010101100001 + 011100001000
427 in BCD is converted to pure binary integer what is its binary value (a) 010000100111 (b) 10000100111 (c) 110101011 (d) 111001000010
Convert each of the BCD numbers to decimal:(a) 10000000 (b) 001000110111(c) 001101000110 (d) 010000100001(e) 011101010100 (f) 100000000000(g) 100101111000 (h) 0001011010000011(i) 1001000000011000 (j) 0110011001100111
Convert each binary number to octal:(a) 100 (b) 110 (c) 1100(d) 1111 (e) 11001 (f) 11110(g) 110011 (h) 101010 (i) 10101111
Obtain the 1’s and 2’s complements of the following binary numbers: (a) 00010000 (d) 10101010 (b) 00000000 (e) 10000101 (c) 11011010 (f) 11111111 Represent the unsigned decimal numbers 791 and 658 in BCD, and then show the steps necessary to form their sum. Express the following numbers in decimal: (a) (10110.0101) 2 (b) (16.5) 16 (c) (26.24) 8 (d) (DADA.B) 16 (e) (1010.1101) 2 Add and multiply the following numbers without converting them to decimal. (a)Binary numbers 1011 and 101. (b)Hexadecimal numbers 2E and 34.
8- Convert to octal and then to decimal: (a) (10111011.1): (b) (1101101.011):
prt d Give (in decimal) the quantity represented by each of the following IEEE 754 single precision floating point values. (a)10111111100000000000000000000000 (b)00000000000000000000000000000000 (c)01111111111111111111111111111111 (d)11000001110110000000000000000000
Convert the following Hexa value (ABC)16 to Binary a. 101010111101 b. 101010111110 c. 101010111111 d. 101010111100
Add the two BCD numbers: 1001 + 0100 = ? * 00101011 01010000 O 00010011 10101111
Convert each decimal number to hexadecimal:(a) 10 (b) 15 (c) 32 (d) 54(e) 365 (f) 3652 (g) 7825 (h) 8925
Given two decimal numbers 694 and 835. Their sum in BCD is 00111111001001 01011111001001 0001010100101001 none of these The result of subtracting 654253758 from 740152368 is 6367641 6267641 6267541 O 6367541 The Boolean expression (X+Y+Z)' = X'Y'Z' is an example of which Law/Theorem? Idempotent Law Commutative Law DeMorgan's Theorem O Involution Law
Use direct subtraction on the following binary numbers:(a) 10 - 1 (b) 100 - 11 (c) 110 - 100(d) 1111 - 11 (e) 1101 - 101 (f) 110000 - 1111