AI Coding & CSE Fundamentals

#CProgramming #BitwiseOperators #Optimization

Divide/Multiply by 2 using Bit Shift

#include <stdio.h>

int main() {
    int num = 16;
    int multiplyBy2 = num << 1;
    int divideBy2 = num >> 1;

    printf("Original number: %d\n", num);
    printf("Multiplied by 2: %d\n", multiplyBy2);
    printf("Divided by 2: %d\n", divideBy2);

    return 0;
}

#CProgramming #Bitwise #PowerOf2

Check if a Number is Power of 2

#include <stdio.h>
#include <stdbool.h>

bool isPowerOfTwo(int n) {
  if (n <= 0) {
    return false;
  }
  return (n & (n - 1)) == 0;
}

int main() {
  int num = 16;
  if (isPowerOfTwo(num)) {
    printf("%d is a power of 2\n", num);
  } else {
    printf("%d is not a power of 2\n", num);
  }
  return 0;
}

#CProgramming #Bitwise

Check if a Number is Power of 2

#include <stdio.h>#include <stdbool.h>bool isPowerOfTwo(int n) {    if (n <= 0) {        return false;    }    return (n & (n - 1)) == 0;}int main() {    int num = 16;    if (isPowerOfTwo(num)) {        printf("%d is a power of 2\n", num);    } else {        printf("%d is not a power of 2\n", num);    }    return 0;}

#CProgramming #BitwiseOperations

Set/Clear/Toggle Bits

#include <stdio.h>

int main() {
    unsigned int num = 10; // Example number
    int bit_position = 1; // Example bit position (0-indexed)

    // Set bit
    unsigned int set_mask = 1 << bit_position;
    unsigned int set_result = num | set_mask;
    printf("Number after setting bit %d: %u\n", bit_position, set_result);

    // Clear bit
    unsigned int clear_mask = ~(1 << bit_position);
    unsigned int clear_result = num & clear_mask;
    printf("Number after clearing bit %d: %u\n", bit_position, clear_result);

    // Toggle bit
    unsigned int toggle_mask = 1 << bit_position;
    unsigned int toggle_result = num ^ toggle_mask;
    printf("Number after toggling bit %d: %u\n", bit_position, toggle_result);

    return 0;
}

#Cprogramming #BitManipulation #InterviewQuestion

Check if Nth Bit is Set

#include <stdio.h>
#include <stdint.h>

int isNthBitSet(uint32_t num, int n) {
    if (n < 0 || n >= 32) {
        return -1; 
    }
    return (num & (1UL << n)) != 0;
}

int main() {
    uint32_t number = 10; 
    int n = 1;          
    int result = isNthBitSet(number, n);

    if (result == -1) {
        printf("Invalid bit position\n");
    } else if (result) {
        printf("Bit %d is set in %u\n", n, number);
    } else {
        printf("Bit %d is not set in %u\n", n, number);
    }

    return 0;
}

#CProgramming #BitManipulation #KernighanAlgorithm

Count Set Bits (Brian Kernighan's Algorithm)

#include <stdio.h>

int countSetBits(int n) {
    int count = 0;
    while (n) {
        n &= (n - 1);
        count++;
    }
    return count;
}

int main() {
    int num = 9;
    printf("Number of set bits in %d is %d\n", num, countSetBits(num));
    return 0;
}

#CProgramming #BitManipulation #Algorithm #InterviewQuestion #Kernighan

Count Set Bits (Brian Kernighan's Algorithm)

#include <stdio.h>

int countSetBits(int n) {
    int count = 0;
    while (n) {
        n &= (n - 1);
        count++;
    }
    return count;
}

int main() {
    int num = 9; 
    printf("Number of set bits in %d is %d\n", num, countSetBits(num));
    return 0;
}

#CProgramming #SwapNumbers #WithoutTemp #InterviewQuestion #ArithmeticSwap

Swap Two Numbers Without Temp

#include <stdio.h>

int main() {
    int a = 5;
    int b = 10;
    a = a + b;
    b = a - b;
    a = a - b;
    printf("a = %d, b = %d\n", a, b);
    return 0;
}

#CProgramming #CLanguage #DSA #InterviewPrep #SwapLogic

Swap Two Numbers Without Temp

#include <stdio.h>

int main() {
    int a = 5;
    int b = 10;
    a = a + b;
    b = a - b;
    a = a - b;
    printf("a = %d, b = %d\n", a, b);
    return 0;
}

#CProgramming #CLanguage #DSA #InterviewPrep #SwapLogic

Swap Two Numbers Without Temp

#include <stdio.h>

int main() {
    int a = 5;
    int b = 10;
    a = a + b;
    b = a - b;
    a = a - b;
    printf("a = %d, b = %d\n", a, b);
    return 0;
}