BitManipulation

BitManipulation/countSetBits.py

@@ -0,0 +1,17 @@
+# Function to get no of set bits in binary 
+# representation of positive integer n (iterative approach)
+def  countSetBits(n): 
+    count = 0
+    while (n): 
+        count += n & 1
+        n >>= 1
+    return count 
+
+
+# Program to test function countSetBits 
+# std input would also work 
+i = 9
+print(countSetBits(i)) 
+
+# contributed by
+# Sampark Sharma

BitManipulation/nextpowOf2.py

@@ -0,0 +1,12 @@
+def nextPowOf2(n):
+    p = 1
+    if (n and not(n & (n - 1))):
+        return n
+    while (p < n) :
+        p <<= 1
+    return p;
+
+t = int(input())
+for i in range(t):
+    n= int(input())
+    print("Next Power of 2 " + str(nextPowOf2(n)))