CareerCup

k = 1 << pos
return ((number & k) > 0)

number & k may not be 1

number = 100
pos = 3
100 & 100 = 100 (4) not 1

You want to check that "number AND k" preserves k

boolean isSet1(int number, int pos) {
        int k = 1;
        for(int i = 1; i <= pos; i++) {
            k = k << 1;
        }
        return (number & k) == k;
    }

One way is :

public static boolean isBitSet(int n, int pos) {
         return ((n & (1 << pos)) > 0);
    }

another way is

public static boolean isBitSet(int n, int pos) {
        return (((n >> pos) & 1) == 1);        
    }

bit position start at 0.

Another way could be:
bool is_set(int number, int pos){
return ((bool)(number>>pos)&0x1);
}

(number & k) > 0 should read as (number & k) != 0 [or simple (number & k) if in C] in all the codes above.

If the shifting puts the bit to the topmost bit in k than the result will be negative, but still non-zero.

static boolean findbit(int no,int pos)
	{
		int k=1<<pos;
		System.out.println(k);
		if((k&no)==k)
			return true;
		else
			return false;
		
	}

boolean bitset(int no,int pos)
{
return (no & (1 << bit)) != 0;
}

You need to consider whether the bits are counted from 0 or 1.
The above approaches wroks if the bits are counted from 0, but if counted from 1, below is the solution.
bool bitset(int number, int pos)
{
return (number & pow(2,(pos-1)) ;
}

what will happen when pos<0?

probably you can just divide num by 2 for position number of times and then take num % 2.
if the result is 1 then return true else return false.

y u use the loop u jst shift the number by (pos -1) unit to right and and with 1.u get the result.

return (n>>p & 1) ? true : false;

return ((1<<pos) & num )>>pos;

return ( num & pow( 2 , pos ) ) ? true : false

another method...

return ( num & (1 << pos) ) ? true : false;

Using XOR:

if(number ^ (1 << (pos - 1))){
		return true;
	}
	else{
		return false;
	}

1 #include<stdio.h>
  2 
  3 int bitSet(int num,int pos)
  4 
  5 {
  6 
  7     if((num &(1<<(pos-1))))
  8 
  9         return 1;
 10 
 11     else
 12         return 0;
 13 
 14 }
 15 
 16 
 17 int main()
 18 
 19 
 20 {
 21 
 22     int num,pos;
 23 
 24     printf("Enter the Number ");
 25 
 26     scanf("%d",&num);
 27 
 28     printf("Enter the position :");
 29 
 30     scanf("%d",&pos);
 31 
 32     if(bitSet(num,pos))
 33 
 34         printf("True");
 35 
 36     else
 37         printf("False");
 38 
 39 
 40 
 41 }