Merge pull request #113 from AayushBangroo/master

IsNthBitSet code added

Author: SarthakKeshari

Bit Manipulation/IsNthBitSet.java

@@ -0,0 +1,42 @@
+/*
+Problem Statement: Given two numbers 'a' and 'n', check if nth bit is set in 'a'. Consider 0 based indexing.
+Idea: Do a bitwise AND operation with 1 at the nth position. If the result is non-zero bit is set otherwise
+it is unset.
+
+Examples:
+
+Input: 4 2
+Output: Bit is unset at position 2
+
+Input: 10 4
+Output: Bit is set at position 4
+ */
+
+import java.util.Scanner;
+
+public class IsNthBitSet {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int a = sc.nextInt();
+        int n = sc.nextInt();
+
+        checkNthBit(a, n);
+    }
+
+    public static void checkNthBit(int a, int n) {
+        //Create a mask that has only nth bit set
+        int mask = 1 << (n - 1);
+
+        //If nth bit is set in 'a' then bitwise AND with mask
+        //will give non-zero result
+        if ((a & mask) != 0) {
+            System.out.println("Bit is set at position " + n);
+        }
+        //If nth bit is unset in 'a' then bitwise AND with mask
+        //will give zero result
+        else {
+            System.out.println("Bit is unset at position " + n);
+        }
+    }
+}