- C Introduction
- C - Features
- C - Applications
- C - Preprocessor
- C - Preprocessor Directives
- C - Type Definitions
- C - Function Prototypes
- C - Header Files and Libraries
- C - Main Function
- C Program Elements
- C - Datatypes
- C - Constants
- C - Operators
- C - Assignment Operator
- C - Arithmetic Operator
- C - Relational Operator
- C - Sample Program to illustrate C relational operator
- C - Logical Operator
- C - Sample Program to demonstrate logical operators
- C - Increment and Decrement Operator
- C - Sample Program to illustrate pre increment
- C - Sample Program to illustrate post increment
- C - Bitwise Operator
- C - Sample Program to illustrate bitwise Operator
- C - Conditional Operator
- C - Comma Operator
- C - Sizeof Operator
- C - Typecast Operator
- C - Operator Precedence and Associativity
- C - Identifiers
- C - Keywords
- C Statements
- C - if-else statement
- C - else-if ladder statement
- C - Switch statement
- C - Sample Program to illustrate switch statement
- C - While Statements
- C - Sample Program to illustrate while loop
- C - do-while Statement
- C - for Statement
- C - Sample Program to illustrate for-loop
- C - Break statement
- C - Continue statement
C - Bitwise Operator
Bitwise Operators in C
Introduction
In C programming, bitwise operators are used to perform operations on the binary representations of numbers. These operators allow you to manipulate specific bits of an integer. Bitwise operations are typically used for low-level programming tasks, such as device drivers, cryptography, or system-level code.
Types of Bitwise Operators
C provides the following bitwise operators:
- Bitwise AND (&)
- Bitwise OR (|)
- Bitwise XOR (^)
- Bitwise NOT (~)
- Left Shift (<<)
- Right Shift (>>)
Bitwise AND Operator (&)
The bitwise AND operator (&) performs a binary AND operation between corresponding bits of two operands. If both bits are 1, the result is 1; otherwise, it is 0.
Syntax:
result = operand1 & operand2;
Example:
int a = 12; // 1100 in binary
int b = 10; // 1010 in binary
int result = a & b; // result is 8 (1000 in binary)
In this example, performing the bitwise AND operation on 1100 (12) and 1010 (10) results in 1000 (8).
Bitwise OR Operator (|)
The bitwise OR operator (|) performs a binary OR operation between corresponding bits of two operands. If either of the bits is 1, the result is 1; otherwise, it is 0.
Syntax:
result = operand1 | operand2;
Example:
int a = 12; // 1100 in binary
int b = 10; // 1010 in binary
int result = a | b; // result is 14 (1110 in binary)
In this example, performing the bitwise OR operation on 1100 (12) and 1010 (10) results in 1110 (14).
Bitwise XOR Operator (^)
The bitwise XOR operator (^) performs a binary exclusive OR operation. If the corresponding bits are different, the result is 1; otherwise, it is 0.
Syntax:
result = operand1 ^ operand2;
Example:
int a = 12; // 1100 in binary
int b = 10; // 1010 in binary
int result = a ^ b; // result is 6 (0110 in binary)
In this example, performing the bitwise XOR operation on 1100 (12) and 1010 (10) results in 0110 (6).
Bitwise NOT Operator (~)
The bitwise NOT operator (~) inverts all the bits of its operand. This operation is also known as a bitwise complement.
Syntax:
result = ~operand;
Example:
int a = 12; // 1100 in binary
int result = ~a; // result is -13 (two's complement representation)
In this example, performing the bitwise NOT operation on 1100 (12) results in the two's complement representation of -13.
Left Shift Operator (<<)
The left shift operator (<<) shifts the bits of the operand to the left by a specified number of positions. This operation is equivalent to multiplying the number by 2 raised to the power of the shift count.
Syntax:
result = operand << number_of_positions;
Example:
int a = 5; // 0101 in binary
int result = a << 2; // result is 20 (10100 in binary)
In this example, shifting the bits of 0101 (5) two positions to the left results in 10100 (20), which is equivalent to multiplying 5 by 4 (2^2).
Right Shift Operator (>>)
The right shift operator (>>) shifts the bits of the operand to the right by a specified number of positions. This operation is equivalent to dividing the number by 2 raised to the power of the shift count.
Syntax:
result = operand >> number_of_positions;
Example:
int a = 20; // 10100 in binary
int result = a >> 2; // result is 5 (0101 in binary)
In this example, shifting the bits of 10100 (20) two positions to the right results in 0101 (5), which is equivalent to dividing 20 by 4 (2^2).
Applications of Bitwise Operators
Bitwise operators are frequently used in the following applications:
- Setting or clearing specific bits: You can set or clear specific bits using bitwise OR and AND operators.
- Masking: You can use bitwise operations to extract or modify certain bits within a binary number.
- Efficient computations: Bitwise shifts are often used in algorithms that require fast multiplication or division by powers of 2.
- Encryption and cryptography: Bitwise operations are commonly used in encryption algorithms to manipulate data at the bit level.
Bitwise operators in C provide an efficient way to manipulate the individual bits of integer variables. They are widely used in system-level programming, device drivers, cryptography, and many other low-level applications where performance and control over individual bits are critical. Understanding and applying these operators is important for writing optimized and efficient code in C.
