{"id":28974,"date":"2023-01-04T17:58:20","date_gmt":"2023-01-04T12:28:20","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-what-happens-when-bitwise-and-is-applied-to-negative-numbers\/"},"modified":"2023-01-04T17:58:20","modified_gmt":"2023-01-04T12:28:20","slug":"solved-what-happens-when-bitwise-and-is-applied-to-negative-numbers","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-what-happens-when-bitwise-and-is-applied-to-negative-numbers\/","title":{"rendered":"[Solved] What happens when bitwise AND is applied to negative numbers?"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

In C, in the result of the binary &<\/code>, each bit depends on the two corresponding bits in the operands. If the bit in the same position is set (1) in both operands, it is set in the result. If it is clear (0) in either operand, it is clear in the result. For example, given bits 0011 and 0101, the &<\/code> operator would produce 0001, because only in the last position is the bit set in both operands.<\/p>\n

You likely already know that positive integers are represented with binary. The bit positions are numbered starting from 0 on the \u201cright\u201d, then 1 for the next position, 2, 3, and so on. The bit in position i<\/em> represents a value of 2i<\/em><\/sup>, so bit 0 represents 1, bit 1 represents 2, bit 2 represents 4, bit 3 represents 8, bit 4 represents 16, and so on. The value represented by all the bits is the sum of the values of the bits that are set to 1. So 101 represents 5, because the bits for 22<\/sup> = 4 and 20<\/sup> = 1 are set, and 4+1 = 5.<\/p>\n

The C standard specifies three rules that a C implementation may use to represent negative numbers (in C 2018 6.2.6.2 2):<\/p>\n