Binary Operations

Finding k-th bit in a given integer

public int getBit(int num, int k) {
    if((num & (1 << k)) > 0) {
        return 1;
    }
    return 0;
}

Put the given bit in the integer

public int putBit(int number, int bit, int k) {
    return ((1 << k) | number);
}

Finding complement bit of given bit

• input — 1 => output — 0
• input — 0 => output — 1

public int getComplementBit(int bit) {
    return 1 ^ bit;
}

Thanks….

I Am…..

I am a Software Engineer having experience in mobile app development with expertise in Java, Android and Flutter. Interested people can contact me through LinkedIn and Instagram.