Count Non-Set (0) Bits in a 32-bit Integer in c

January 03, 2026

C Program to Check Prime Number Using Efficient Logic

Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design. Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

🧮 Count Non-Set (0) Bits in a 32-bit Integer

#include <stdio.h> int main() { unsigned int num; int count = 0; // Read input from user printf("Enter the number : "); scanf("%u", &num); // Loop through all 32 bits for (int i = 0; i < 32; i++) { if ((num & (1 << i)) == 0) { count++; } } // Output result printf("The count of non set bits is %d\n", count); return 0; }

📘 Explanation:

🔹 The program loops over each bit of a 32-bit unsigned integer using a bitwise AND operation.
🔹 If a bit is 0, it increments the `count` of non-set bits.
🔹 Works for any unsigned integer in the 32-bit range.

🧪 Sample Output:

Enter the number : 10
The count of non set bits is 30

🏷️ Keywords:

C program to count 0 bits, count unset bits, bitwise logic, 32-bit integer, technical interview question, C beginner practice

Search This Blog

1PRINTF

Featured

C Program to Check Prime Number Using Efficient Logic