- 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 - Sample Program to illustrate bitwise Operator
Sample Program to Illustrate Bitwise Operators in C
Introduction
Bitwise operators in C are used to manipulate individual bits of integer values. These operators are extremely useful in low-level programming, such as device drivers, encryption algorithms, and other applications where direct manipulation of bits is required.
In this section, we will demonstrate how to use different bitwise operators in C through a simple program. The program will cover the use of:
- Bitwise AND (&)
- Bitwise OR (|)
- Bitwise XOR (^)
- Bitwise NOT (~)
- Left Shift (<<)
- Right Shift (>>)
Sample C Program Using Bitwise Operators
The following C program demonstrates the use of bitwise operators on two integer variables:
Program Code:
#includeint main() { int a = 12; // Binary: 1100 int b = 10; // Binary: 1010 int result; // Bitwise AND result = a & b; printf("Bitwise AND: %d & %d = %d\n", a, b, result); // Bitwise OR result = a | b; printf("Bitwise OR: %d | %d = %d\n", a, b, result); // Bitwise XOR result = a ^ b; printf("Bitwise XOR: %d ^ %d = %d\n", a, b, result); // Bitwise NOT result = ~a; printf("Bitwise NOT: ~%d = %d\n", a, result); // Left Shift result = a << 2; // Shifting left by 2 bits printf("Left Shift: %d << 2 = %d\n", a, result); // Right Shift result = a >> 2; // Shifting right by 2 bits printf("Right Shift: %d >> 2 = %d\n", a, result); return 0; }
Explanation of the Program
Let’s go through the program step-by-step to understand how bitwise operators are applied:
1. Bitwise AND (&)
The bitwise AND operator performs a logical AND operation on corresponding bits of two operands. For example:
a = 12 (1100 in binary)
b = 10 (1010 in binary)
a & b = 1000 (8 in decimal)
In this case, the result is 8 because the AND operation only results in 1 when both corresponding bits are 1.
2. Bitwise OR (|)
The bitwise OR operator performs a logical OR operation on corresponding bits of two operands. For example:
a = 12 (1100 in binary)
b = 10 (1010 in binary)
a | b = 1110 (14 in decimal)
In this case, the result is 14 because the OR operation results in 1 if at least one of the corresponding bits is 1.
3. Bitwise XOR (^)
The bitwise XOR operator performs an exclusive OR operation on corresponding bits of two operands. For example:
a = 12 (1100 in binary)
b = 10 (1010 in binary)
a ^ b = 0110 (6 in decimal)
In this case, the result is 6 because the XOR operation results in 1 if the corresponding bits are different.
4. Bitwise NOT (~)
The bitwise NOT operator inverts all the bits of the operand. For example:
a = 12 (1100 in binary)
~a = 11111111111111111111111111110101 (-13 in decimal, two's complement)
In this case, the result is -13 because the NOT operation inverts all the bits of 12 (which is 1100 in binary), resulting in a large negative number in two's complement form.
5. Left Shift (<<)
The left shift operator shifts the bits of the operand to the left by a specified number of positions. This is equivalent to multiplying the number by 2 raised to the power of the shift count. For example:
a = 12 (1100 in binary)
a << 2 = 110100 (48 in decimal)
Here, shifting the bits of 12 two positions to the left results in 48 because multiplying 12 by 4 (2^2) gives 48.
6. Right Shift (>>)
The right shift operator shifts the bits of the operand to the right by a specified number of positions. This is equivalent to dividing the number by 2 raised to the power of the shift count. For example:
a = 12 (1100 in binary)
a >> 2 = 0011 (3 in decimal)
Here, shifting the bits of 12 two positions to the right results in 3 because dividing 12 by 4 (2^2) gives 3.
Program Output
When the program is executed, the following output will be displayed:
Bitwise AND: 12 & 10 = 8
Bitwise OR: 12 | 10 = 14
Bitwise XOR: 12 ^ 10 = 6
Bitwise NOT: ~12 = -13
Left Shift: 12 << 2 = 48
Right Shift: 12 >> 2 = 3
This sample program demonstrates how bitwise operators can be used in C to manipulate individual bits of integers. Bitwise operations are crucial for low-level programming and provide an efficient way to perform certain types of computations, particularly when working with binary data or hardware.
