csf111_l11_10feb

Upload: rohit-goel

Post on 03-Jun-2018

215 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/12/2019 CSF111_L11_10Feb

    1/10

    BITS PilaniHyderabad Campus

    BITS Pilani Ms. Prafulla KalapatapuComputer Science & Information Systems GroupBITS-Pilani Hyderabad Campus

    [email protected]

  • 8/12/2019 CSF111_L11_10Feb

    2/10

    BITS PilaniHyderabad Campus

    Computer Programming ( CSF111 ) II Semester 2013 2014

  • 8/12/2019 CSF111_L11_10Feb

    3/10

    CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    Operators

    Todays Agenda

  • 8/12/2019 CSF111_L11_10Feb

    4/10

    CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    Operators

  • 8/12/2019 CSF111_L11_10Feb

    5/10

    CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    These operators allow manipulation of data at the bit level

    7. Bitwise operators

    Operator Meaning& Bitwise AND

    | Bitwise OR

    ^ Bitwise exclusive OR

    ~ Complement

    > Shift right

  • 8/12/2019 CSF111_L11_10Feb

    6/10

    CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    a=5Representing in bits

    a = 00000101

    If the value(number) is negative, then it will store in the form of 2s complement.

    2s complement a = -5Representing in bits

    a = 10000101

    1 s compl = 11111010 (flipping 0s to 1s and 1s to 0s, remaining sign bit as it is ) add 1 = 1

    = 11111011 (now it is -5)

    Number system -- binary

  • 8/12/2019 CSF111_L11_10Feb

    7/10CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    Bitwise and ( & ) :Ex 1: a=5, b=7Representing in bits

    a = 00000101b = 00000111

    a & b = 00000101Convert this into numerical 1 * 2 2 + 0 * 2 1 + 1 * 2 0 = 5Ex 2: a=-5, b=7Representing in bits

    a = 10000101

    1 s compl = 11111010add 1 = 11111011 (now it is -5)

    b = 00000111a & b = 00000011

    Convert this into numerical 1 * 2 1 + 1 * 2 0 = 3

    Examples

  • 8/12/2019 CSF111_L11_10Feb

    8/10CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    Bitwise or (|) :Ex 1: a=5, b=7Representing in bits

    a = 00000101b = 00000111

    a|b = 00000111Convert this into numerical 1 * 2 2 + 1 * 2 1 + 1 * 2 0 = 7Ex 2: a=-5, b=7Representing in bits

    a = 10000101

    1 s compl = 11111010 add 1 = 11111011 (now it is -5)

    b = 00000111a|b = 11111111 ( sign bit is - ve so again 2s comple)

    Convert this into numerical 1 * 2 0 = -(1) = -1

    Examples

  • 8/12/2019 CSF111_L11_10Feb

    9/10CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    Bitwise complement (~):

    a = 5a = 00000101~a = 11111010 ( sign bit is ve, so it is stored in 2s comple)

    1s comle = 10000101 Add 1 = 10000110

    Conversion into numeric-( 1 * 2 2 + 1 * 2 1 + 0 * 2 0 ) = -(6) = -6

  • 8/12/2019 CSF111_L11_10Feb

    10/10CSF111 CP Second Semester 2013-14 BITS Pilani, Hyderabad Campus

    Bitwise xor (^) :Ex 1: a=5, b=7Representing in bits

    a = 00000101b = 00000111

    a^b = 00000010Convert this into numerical 0 * 2 2 + 1 * 2 1 + 0 * 2 0 = 2Ex 2: a=-5, b=7Representing in bits

    a = 10000101

    1 s compl = 11111010 add 1 = 11111011 (now it is -5)

    b = 00000111a^b = 11111100 ( sign bit is - ve so again 2s comple)

    Convert this into numerical -( 1 * 2 2 ) = -(4) = -4

    Examples