Scribd Logo
Upload

Welcome to Scribd!

  • Alagar Nolwinjan BSA 1B GEC MATH

    Uploaded by

    Vhia Rashelle Galzote
    16 views8 pages
    The document provides examples of adding and subtracting binary numbers. For each problem, it shows the binary representations of the numbers, performs the operation, and writes the result in binary. For addition, it finds the sum of the binary digits in each place value position. For subtraction, it performs subtraction by borrowing from the left when needed and writes the result in binary. In two cases, subtraction is not possible as the first number is larger than the second.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides examples of adding and subtracting binary numbers. For each problem, it shows the binary representations of the numbers, performs the operation, and writes the result in binary. For addition, it finds the sum of the binary digits in each place value position. For subtraction, it performs subtraction by borrowing from the left when needed and writes the result in binary. In two cases, subtraction is not possible as the first number is larger than the second.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    16 views8 pages

    Alagar Nolwinjan BSA 1B GEC MATH

    Uploaded by

    Vhia Rashelle Galzote
    The document provides examples of adding and subtracting binary numbers. For each problem, it shows the binary representations of the numbers, performs the operation, and writes the result in binary. For addition, it finds the sum of the binary digits in each place value position. For subtraction, it performs subtraction by borrowing from the left when needed and writes the result in binary. In two cases, subtraction is not possible as the first number is larger than the second.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 8

    Alagar, Nolwinjan T.

    BSA 1B
    GEC-MATH

    Operations of Binary Numbers


    Exercise 3.1 - C
    Find the sum of the following binary numbers.
    1. 1011012 and 1011102

    1 1 1
    1 0 1 1 0 1
    1 0 1 1 1 0
    1 0 1 1 0 1 1

    1011012 = 1(32) + 0(16) + 1(8) + 1(4) + 0(2) + 1(1) = 45


    1011102 = 1(32) + 0(16) + 1(8) + 1(4) + 1(2) + 0(1) = 46
    10110112 = 1(64) + 0(32) + 1(16) + 1(8) + 0(4) + 1(2) + 1(1) = 91

    2. 10111012 and 11111102

    1 1 1 1 1
    1 0 1 1 1 0 1
    1 1 1 1 1 1 0
    1 1 0 1 1 0 1 1

    10111012 = 1(64) + 0(32) + 1(16) + 1(8) + 1(4) + 0(2) + 1(1) = 93


    11111102 = 1(64) + 1(32) + 1(16) + 1(8) + 1(4) + 1(2) + 0(1) = 126
    110110112 = 1(128) + 1(64) + 0(32) + 1(16) + 1(8) + 0(4) + 1(2) + 1(1) = 219
    3. 1000012 and 1100102

    1
    1 0 0 0 0 1
    1 1 0 0 1 0
    1 0 1 0 0 1 1

    1000012 = 1(32) + 0(16) + 0(8) + 0(4) + 0(2) + 1(1) = 33


    1100102 = 1(32) + 1(16) + 0(8) + 0(4) + 1(2) + 0(1) = 50
    10100112 = 1(64) + 0(32) + 1(16) + 0(8) + 0(4) + 1(2) + 1(1) = 83

    4. 11100012 and 11110102

    1 1 1
    1 1 1 0 0 0 1
    1 1 1 1 0 1 0
    1 1 1 0 1 0 1 1

    11100012 = 1(64) + 1(32) + 1(16) + 0(8) + 0(4) + 0(2) + 1(1) = 113


    11110102 = 1(64) + 1(32) + 1(16) + 1(8) + 0(4) + 1(2) + 0(1) = 122
    111010112 = 1(128) + 1(64) + 1(32) + 0(16) + 1(8) + 0(4) + 1(2) + 1(1) = 235

    5. 11000012 and 11001102

    1 1
    1 1 0 0 0 0 1
    1 1 0 0 1 1 0
    1 1 0 0 0 1 1 1

    11000012 = 1(64) + 1(32) + 0(16) + 0(8) + 0(4) + 0(2) + 1(1) = 97


    11001102 = 1(64) + 1(32) + 0(16) + 0(8) + 1(4) + 1(2) + 0(1) = 102
    110001112 = 1(128) + 1(64) + 0(32) + 0(16) + 0(8) + 1(4) + 1(2) + 1(1) = 199
    6. 10110012 and 10111102

    1 1 1
    1 0 1 1 0 0 1
    1 0 1 1 1 1 0
    1 0 1 1 0 1 1 1

    10110012 = 1(64) + 0(32) + 1(16) + 1(8) + 0(4) + 0(2) + 1(1) = 89


    10111102 = 1(64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 0(1) = 94
    101101112 = 1(128) + 0(64) + 1(32) + 1(16) + 0(8) + 1(4) + 1(2) + 1(1) = 183

    7. 10010012 and 10011102

    1 1
    1 0 0 1 0 0 1
    1 0 0 1 1 1 0
    1 0 0 1 0 1 1 1

    10010012 = 1(64) + 0(32) + 0(16) + 1(8) + 0(4) + 0(2) + 1(1) = 73


    10011102 = 1(64) + 0(32) + 0(16) + 1(8) + 1(4) + 1(2) + 0(1) = 78
    100101112 = 1(128) + 0(64) + 0(32) + 1(16) + 0(8) + 1(4) + 1(2) + 1(1) = 151

    8. 111100012 and 100011102

    1
    1 1 1 1 0 0 0 1
    1 0 0 0 1 1 1 0
    1 0 1 1 1 1 1 1 1

    111100012 = 1(128) + 1(64) + 1(32) + 1(16) + 0(8) + 0(4) + 0(2) + 1(1) = 241
    100011102 = 1(128) + 0(64) + 0(32) + 0(16) + 1(8) + 1(4) + 1(2) + 0(1) = 142
    1011111112 = 1(256) + 0(128) + 1(64) + 1(32) + 1(16) + 1(8) + 1(4) + 1(2) + 1(1) = 383
    9. 100010012 and 110000102

    1
    1 0 0 0 1 0 0 1
    1 1 0 0 0 0 1 0
    1 0 1 0 0 1 0 1 1

    100010012 = 1(128) + 0(64) + 0(32) + 0(16) + 1(8) + 0(4) + 0(2) + 1(1) = 137
    110000102 = 1(128) + 1(64) + 0(32) + 0(16) + 0(8) + 0(4) + 1(2) + 0(1) = 194
    1010010112 = 1(256) + 0(128) + 1(64) + 0(32) + 0(16) + 1(8) + 0(4) + 1(2) + 1(1) = 331

    10. 1011111012 and 1000111102

    1 1 1 1 1 1
    1 0 1 1 1 1 1 0 1
    1 0 0 0 1 1 1 1 0
    1 0 1 0 0 1 1 0 1 1

    1011111012 = 1(256) + 0(128) + 1(64) + 1(32) + 1(16) + 1(8) + 1(4) + 0(2) + 1(1) = 381

    1000111102 = 1(256) + 0(128) + 0(64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 0(1) = 286

    10100110112 = 1(512) + 0(256) + 1(128) + 0(64) + 0(32) + 1(16) + 1(8) + 0(4) + 1(2) + 1(1) = 667
    Exercise 3.2 - D
    Find the difference of the following binary numbers if it exists.

    1. 1011012 and 1011102

    1 0 1 1 0 1 => 1 0 1 1 0 1
    1 0 1 1 1 0 1 0 1 1 1 0
    0 0 0 0 -1 1

    1011012 = 1(32) + 0(16) + 1(8) + 1(4) + 0(2) + 1(1) = 45


    1011102 = 1(32) + 0(16) + 1(8) + 1(4) + 1(2) + 0(1) = 46
    112 = 1(-2) + 1(1) = -1

    2. 10111012 and 11111102

    1 0 1 1 1 0 1 => 0 1 10 10 10 10 1
    1 1 1 1 1 1 0 1 1 1 1 1 1 0
    -1 0 1 1 1 1 1

    10111012 = 1(64) + 0(32) + 1(16) + 1(8) + 1(4) + 0(2) + 1(1) = 93


    11111102 = 1(64) + 1(32) + 1(16) + 1(8) + 1(4) + 1(2) + 0(1) = 126
    10111112 = 1(-64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 1(1) = -33
    3. 1000012 and 1100102

    1 0 0 0 0 1 => 0 1 1 1 10 1
    1 1 0 0 1 0 1 1 0 0 1 0
    -1 0 1 1 1 1

    1000012 = 1(32) + 0(16) + 0(8) + 0(4) + 0(2) + 1(1) = 33


    1100102 = 1(32) + 1(16) + 0(8) + 0(4) + 1(2) + 0(1) = 50
    1011112 = 1(-32) + 0(16) + 1(8) + 1(4) + 1(2) + 1(1) = -17

    4. 11100012 and 11110102

    1 1 1 0 0 0 1 => 0 10 10 1 1 10 1
    1 1 1 1 0 1 0 1 1 1 1 0 1 0
    -1 1 1 0 1 1 1

    11100012 = 1(64) + 1(32) + 1(16) + 0(8) + 0(4) + 0(2) + 1(1) = 113


    11110102 = 1(64) + 1(32) + 1(16) + 1(8) + 0(4) + 1(2) + 0(1) = 122
    11101112 = 1(-64) + 1(32) + 1(16) + 0(8) + 1(4) + 1(2) + 1(1) = -9

    5. 11000012 and 11001102 = NOT EXISTED

    1 1 0 0 0 0 1 => 0 1 1 1 10 10 1
    1 1 0 0 1 1 0 1 1 0 0 1 1 0
    -1 0 1 1 1 1 1

    11000012 = 1(64) + 1(32) + 0(16) + 0(8) + 0(4) + 0(2) + 1(1) = 97


    11001102 = 1(64) + 1(32) + 0(16) + 0(8) + 1(4) + 1(2) + 0(1) = 102
    10111112 = 1(-64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 1(1) = -33
    6. 10110012 and 10111102 = NOT EXISTED

    1 0 1 1 0 0 1 => 0 1 1 10 10 10 1
    1 0 1 1 1 1 0 1 0 1 1 1 1 0
    -1 1 0 1 1 1 1

    10110012 = 1(64) + 0(32) + 1(16) + 1(8) + 0(4) + 0(2) + 1(1) = 89


    10111102 = 1(64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 0(1) = 94
    11011112 = 1(-64) + 1(32) + 0(16) + 1(8) + 1(4) + 1(2) + 1(1) = -17

    7. 10010012 and 10011102 = NOT EXISTED

    1 0 0 1 0 0 1 => 0 1 1 1 10 10 1
    1 0 0 1 1 1 0 1 0 0 1 1 1 0
    -1 1 1 0 1 1 1

    10010012 = 1(64) + 0(32) + 0(16) + 1(8) + 0(4) + 0(2) + 1(1) = 73


    10011102 = 1(64) + 0(32) + 0(16) + 1(8) + 1(4) + 1(2) + 0(1) = 78
    11101112 = 1(-64) + 1(32) + 1(16) + 0(8) + 1(4) + 1(2) + 1(1) = -9

    8. 111100012 and 100011102 = NOT EXISTED

    1 1 1 1 0 0 0 1 => 1 0 1 1 10 10 10 1
    1 0 0 0 1 1 1 0 1 0 0 0 1 1 1 0
    0 0 1 1 1 1 1 1

    111100012 = 1(128) + 1(64) + 1(32) + 1(16) + 0(8) + 0(4) + 0(2) + 1(1) = 241
    100011102 = 1(128) + 0(64) + 0(32) + 0(16) + 1(8) + 1(4) + 1(2) + 0(1) = 142
    1111112 = 1(32) + 1(16) + 1(8) + 1(4) + 1(2) + 1(1) = 63
    9. 100010012 and 110000102

    1 0 0 0 1 0 0 1 => 0 10 0 0 0 1 10 1
    1 1 0 0 0 0 1 0 1 1 0 0 0 0 1 0
    -1 1 0 0 0 1 1 1

    100010012 = 1(128) + 0(64) + 0(32) + 0(16) + 1(8) + 0(4) + 0(2) + 1(1) = 137
    110000102 = 1(128) + 1(64) + 0(32) + 0(16) + 0(8) + 0(4) + 1(2) + 0(1) = 194
    110001112 = 1(-128) + 1(64) + 0(32) + 0(16) + 0(8) + 1(4) + 1(2) + 1(1) = -57

    10. 1011111012 and 1000111102

    1 0 1 1 1 1 1 0 1 => 1 0 1 0 10 10 10 10 1
    1 0 0 0 1 1 1 1 0 1 0 0 0 1 1 1 1 0
    0 0 1 0 1 1 1 1 1

    1011111012 = 1(256) + 0(128) + 1(64) + 1(32) + 1(16) + 1(8) + 1(4) + 0(2) + 1(1) = 381

    1000111102 = 1(256) + 0(128) + 0(64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 0(1) = 286

    1010111112 = 0(256) + 0(128) + 1(64) + 0(32) + 1(16) + 1(8) + 1(4) + 1(2) + 1(1) = 95

    You might also like