Skip to main content

Featured

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...

Set, Clear, Toggle nth Bit in C

Set, Clear, Toggle nth Bit in C

✅ Set, Clear, and Toggle nth Bit in C

#include <stdio.h>

// Function to set the nth bit (make it 1)
int setBit(int num, int n) {
    return num | (1 << n);
}

// Function to clear the nth bit (make it 0)
int clearBit(int num, int n) {
    return num & ~(1 << n);
}

// Function to toggle the nth bit (flip its value)
int toggleBit(int num, int n) {
    return num ^ (1 << n);
}

int main() {
    int num, n;

    printf("Enter a number: ");
    scanf("%d", &num);

    printf("Enter the bit position to manipulate (0-indexed): ");
    scanf("%d", &n);

    printf("\nOriginal number in binary: ");
    for (int i = 31; i >= 0; i--) {
        printf("%d", (num >> i) & 1);
    }

    printf("\n\nAfter setting %dth bit: %d", n, setBit(num, n));
    printf("\nAfter clearing %dth bit: %d", n, clearBit(num, n));
    printf("\nAfter toggling %dth bit: %d", n, toggleBit(num, n));

    printf("\n");

    return 0;
}
  

๐Ÿ“˜ Explanation:

This program demonstrates bit manipulation in C using bitwise operators. The user provides an integer and a bit position (0-indexed). The program then performs:

  • Set Operation: Uses bitwise OR to ensure the nth bit is 1.
  • Clear Operation: Uses bitwise AND with complement to make the nth bit 0.
  • Toggle Operation: Uses XOR to flip the value of the nth bit.
It also prints the binary representation of the original number using bit shifting.

๐Ÿงพ Sample Output:

Enter a number: 10
Enter the bit position to manipulate (0-indexed): 1

Original number in binary: 00000000000000000000000000001010

After setting 1th bit: 10
After clearing 1th bit: 8
After toggling 1th bit: 8
  

๐Ÿ”‘ Keywords:

Bit manipulation in C, set bit operation, clear bit mask, toggle bit using XOR, left shift, binary number handling, C programming, low-level bit logic

๐Ÿ“Œ Hashtags:

#CProgramming #BitManipulation #SetBit #ClearBit #ToggleBit #BinaryInC #CForBeginners #BitwiseOperations

Comments

Popular Posts

๐ŸŒ™