Scribd Logo
Upload

Welcome to Scribd!

  • Logical Binary Shifts

    Uploaded by

    John Ramon Carlos Jr
    20 views13 pages
    Computers can perform logical shifts on binary numbers by moving the numbers left or right in the bit positions. Shifting left is equivalent to multiplication by 2, while shifting right is equivalent to division by 2. However, logical shifts are limited by the size of the register storing the binary number, as shifting will eventually result in all zeros if too many shifts are performed in an 8-bit register. For example, shifting the binary value of 112 (01110000) left by 5 places would produce all zeros, incorrectly implying that 112 × 32 = 0.

    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
    Computers can perform logical shifts on binary numbers by moving the numbers left or right in the bit positions. Shifting left is equivalent to multiplication by 2, while shifting right is equivalent to division by 2. However, logical shifts are limited by the size of the register storing the binary number, as shifting will eventually result in all zeros if too many shifts are performed in an 8-bit register. For example, shifting the binary value of 112 (01110000) left by 5 places would produce all zeros, incorrectly implying that 112 × 32 = 0.

    Copyright:

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

    Logical Binary Shifts

    Uploaded by

    John Ramon Carlos Jr
    Computers can perform logical shifts on binary numbers by moving the numbers left or right in the bit positions. Shifting left is equivalent to multiplication by 2, while shifting right is equivalent to division by 2. However, logical shifts are limited by the size of the register storing the binary number, as shifting will eventually result in all zeros if too many shifts are performed in an 8-bit register. For example, shifting the binary value of 112 (01110000) left by 5 places would produce all zeros, incorrectly implying that 112 × 32 = 0.

    Copyright:

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

    Number System

    Logical Binary Shifts


    Logical Binary Shifts

    ● Computers can carry out a logical shift on a sequence of


    binary numbers. The logical shift means moving the binary
    number to the left or to the right.

    ● Each shift left is equivalent to multiplying the binary


    number by 2 and each shift right is equivalent to dividing
    the binary number by 2.
    Logical Binary Shifts

    ● As bits are shifted, any empty positions are replaced with a


    zero.

    ● There is clearly a limit to the number of shifts which can be


    carried out if the binary number is stored in an 8-bit
    register. Eventually after a number of shifts the register
    would only contain zeros.
    Logical Binary Shifts

    ● For example, if we shift 01110000 (denary value 112) five


    places left (the equivalent to multiplying by 25, i.e. 32), in
    an 8-bit register we would end up with 00000000.

    ● This makes it seem as though 112 × 32 = 0! This would


    result in the generation of an error message.
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts
    Logical Binary Shifts

    You might also like