JavaScript | Bitwise Operators

Like C, C++, Java, Python and various other languages, JavaScript also supports bit-wise operations. In JavaScript, a number is stored as a 64-bit floating point number but the bit-wise operation is performed on a 32-bit binary number i.e. to perform a bit-operation JavaScript converts the number into a 32-bit binary number (signed) and perform the operation and convert back the result to a 64-bit number.

Below are few bit-wise logical operators used in JavaScript.

  • Bit-wise AND ( & ) : It is a binary operator i.e. accepts two operands. Bit-wise AND (&) returns 1 if both the bits are set ( i.e 1) and 0 in any other case.
    A B OUTPUT ( A & B )
    0 0 0
    0 1 0
    1 0 0
    1 1 1
  • Bit-Wise OR ( | ) : Its is a binary operator i.e. accepts two operands. Bit-wise OR ( | ) returns 1 if any of the operand is set (i.e. 1) and 0 in any other case.
    A B OUTPUT ( A | B )
    0 0 0
    0 1 1
    1 0 1
    1 1 1
  • Bit-Wise XOR ( ^ ) : Its is a binary operator i.e. accepts two operands. Bit-wise XOR ( ^ ) returns 1 if both the operands are different and 0 in any other case.
    A B OUTPUT ( A ^ B )
    0 0 0
    0 1 1
    1 0 1
    1 1 0
  • Bit-Wise NOT ( ~ ) : Its is a unary operator i.e. accepts single operands. Bit-wise NOT ( ~ ) flips the bits i.e 0 becomes 1 and 1 becomes 0.
    A OUTPUT ( ~A )
    0 1
    1 0

    Below are few bit-wise shift operators used in JavaScript.

    1. Left Shift ( << ): Its a binary operator i.e. it accepts two operand. The first operator specifies the number and the second operator specifies the number of bits to shift. Each bits are shifted towards left and 0 bits are added from the right. The excess bits from the left are discarded.
      A 6 ( 00000000000000000000000000000110 )
      B 1 ( 00000000000000000000000000000001 )
      OUTPUT ( A << B ) 12 ( 00000000000000000000000000001100 )
    2. Sign Propagating Right Shift ( >> ) : Its a binary operator i.e. it accepts two operand. The first operand specifies the number and the second operand specifies the number of bits to shift. Each bit is shifted towards the right, the overflowing bits are discarded. This is Sign Propagating as the bits which are added from the left depends upon the sign of the number (i.e. 0 if positive and 1 if negative )
      A 6 ( 00000000000000000000000000000110 )
      B 1 ( 00000000000000000000000000000001 )
      OUTPUT ( A >> B ) 3 ( 00000000000000000000000000000011 )
    3. Zero fill Right Shift ( >>> ) : Its a binary operator i.e. it accepts two operand. The first operand specifies the number and the second operand specifies the number of bits to shift. Each bits is shifted towards right, the overflowing bits are discarded. 0 bit is added from the left so its zero fill right shift.
      A 6 ( 00000000000000000000000000000110 )
      B 1 ( 00000000000000000000000000000001 )
      OUTPUT ( A >>> B ) 3 ( 00000000000000000000000000000011 )

      Below is the implementation of the above described operators.

      filter_none

      edit
      close

      play_arrow

      link
      brightness_4
      code

      <script>
      var a = 6;
      var b = 1;
        
      // AND Operation
      document.write("A & B = " + (a & b) + '<br>');
        
        
      // OR operation
      document.write("A | B = " + (a | b) + '<br>');
        
      // NOT operation
      document.write("~A = " + (~a) + '<br>');
        
        
      // Sign Propagating Right Shift
      document.write("A >> B = " + (a >> b) + '<br>');
        
        
      // Zero Fill Right Shift
      document.write("A >>> B = " + (a >>> b) + '<br>');
        
        
      // Left Shift
      document.write("A << B = " + (a << b) + '<br>');                
      </script>                            

      chevron_right

      
      

      Output:

      A & B = 0
      A | B = 7
      ~A = -7
      A >> B = 3
      A >>> B = 3
      A << B = 12


      My Personal Notes arrow_drop_up

      Check out this Author's contributed articles.

      If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

      Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




      Article Tags :

      Be the First to upvote.


      Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.