Untitled
unknown
plain_text
6 months ago
1.7 kB
4
Indexable
public class BitwiseOperators { public static void main(String[] args) { int num1 = 5; // Example value int num2 = 3; // Example value int num3; System.out.println("num1: " + num1 + " (Binary: " + Integer.toBinaryString(num1) + ")"); System.out.println("num2: " + num2 + " (Binary: " + Integer.toBinaryString(num2) + ")"); // Bitwise AND (&) num3 = num1 & num2; System.out.println("num1 & num2: " + num3 + " (Binary: " + Integer.toBinaryString(num3) + ")"); // Bitwise OR (|) num3 = num1 | num2; System.out.println("num1 | num2: " + num3 + " (Binary: " + Integer.toBinaryString(num3) + ")"); // Bitwise XOR (^) num3 = num1 ^ num2; System.out.println("num1 ^ num2: " + num3 + " (Binary: " + Integer.toBinaryString(num3) + ")"); // Bitwise NOT (~) num3 = ~num1; // Note: NOT is a unary operator System.out.println("~num1: " + num3 + " (Binary: " + Integer.toBinaryString(num3) + ")"); //Demonstrating Left Shift and Right Shift int v = 10; // Original number int n = 2; // Shifting value System.out.println("Original value of v: " + v); // Left shift (<<) int leftShift = v << n; System.out.println("Left shift (<<) by " + n + " bits: " + leftShift); // Right shift (>>) int rightShift = v >> n; System.out.println("Right shift (>>) by " + n + " bits: " + rightShift); // Unsigned right shift (>>>) int unsignedRightShift = v >>> n; System.out.println("Unsigned right shift (>>>) by " + n + " bits: " + unsignedRightShift); } }
Editor is loading...
Leave a Comment