Skip to main content

Featured

C++ Program to Perform Linear Search on a Vector

  C++ Program to Perform Linear Search on a Vector Introduction In this C++ program, we will learn how to perform a Linear Search on a vector. The program first takes the size of the vector and its elements as input. Then it asks the user for the element to search. If the element is found, it displays the index where it is located. Otherwise, it displays a message indicating that the element is not found. C++ Program #include<bits/stdc++.h> using namespace std; int main() { int num, search, found = 0; cout << "Enter the size of the vector:" << endl; cin >> num; vector<int> v(num); cout << "Enter " << num << " elements in vector:" << endl; for(int i = 0; i < num; i++) { cin >> v[i]; } cout << "Enter element that you want to search:" << endl; cin >> search; for(int i = 0; i < num; i++) { ...
Post a Comment
Read more
Labels

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

Count Non-Set Bits in C

🧮 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

Labels:

Comments

Post a Comment

Popular Posts

🌙