Scribd Logo
Upload

Welcome to Scribd!

  • Bitwise Operations: Bitwise AND: Truth Table

    Uploaded by

    leidinar
    7 views3 pages
    The document describes different bitwise operations including bitwise AND, OR, XOR, and bit shifts. It provides truth tables and examples to illustrate each operation. Bitwise AND compares each bit of two binary numbers and returns a 1 only if both bits are 1. Bitwise OR returns a 1 if either or both bits are 1. Bitwise XOR returns 1 only if the bits are different. Bit shifts move all bits of a binary number left or right by a specified number of positions, filling empty bits with 0.

    Original Description:

    cs241 waterloo handout

    Original Title

    Bitwise Operations

    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 describes different bitwise operations including bitwise AND, OR, XOR, and bit shifts. It provides truth tables and examples to illustrate each operation. Bitwise AND compares each bit of two binary numbers and returns a 1 only if both bits are 1. Bitwise OR returns a 1 if either or both bits are 1. Bitwise XOR returns 1 only if the bits are different. Bit shifts move all bits of a binary number left or right by a specified number of positions, filling empty bits with 0.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views3 pages

    Bitwise Operations: Bitwise AND: Truth Table

    Uploaded by

    leidinar
    The document describes different bitwise operations including bitwise AND, OR, XOR, and bit shifts. It provides truth tables and examples to illustrate each operation. Bitwise AND compares each bit of two binary numbers and returns a 1 only if both bits are 1. Bitwise OR returns a 1 if either or both bits are 1. Bitwise XOR returns 1 only if the bits are different. Bit shifts move all bits of a binary number left or right by a specified number of positions, filling empty bits with 0.

    Copyright:

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

    Bitwise Operations

    Bitwise AND:
    Truth Table
    0
    0
    1
    1

    0
    1
    0
    1

    0
    0
    0
    1

    Example:

    Bitwise OR:
    Truth Table
    0
    0
    1
    1
    Example:

    0
    1
    0
    1

    0
    1
    1
    1

    Bitwise XAND:
    Truth Table
    0
    0
    1
    1

    0
    1
    0
    1

    1
    0
    0
    1

    Example:

    Bitwise XOR:
    Truth Table
    0
    0
    1
    1
    Example:

    0
    1
    0
    1

    0
    1
    1
    0

    Bit Shift Left:

    is equivalent to
    Sample
    0001
    0001
    0001
    0001

    0
    1
    2
    3

    0001
    0010
    0100
    1000

    Example:

    Bit Shift Right:

    is equivalent to
    Sample
    0100
    0100
    0100
    0100
    1000
    1000
    1000
    1000
    Example 1:

    Example 2:

    0
    1
    2
    3
    0
    1
    2
    3

    0100
    0010
    0001
    0000
    1000
    1100
    1110
    1111

    You might also like