C PROGRAMMING PROGRAM • OPERATORS & CONVERSIONS

Demonstrate Bitwise Operators

Learn how to demonstrate bitwise operators using a clear C program.

IntermediateBitwise ANDBitwise ORXOR

PROBLEM UNDERSTANDING

Input and expected output

Sample input

12 10

Sample output

AND = 8
OR = 14
XOR = 6
First shifted left = 24
First shifted right = 6

COMPLETE C PROGRAM

Complete C implementation

#include <stdio.h>

int main(void)
{
    unsigned int first, second;

    printf("Enter two non-negative integers: ");
    scanf("%u %u", &first, &second);
    printf("AND = %u\n", first & second);
    printf("OR = %u\n", first | second);
    printf("XOR = %u\n", first ^ second);
    printf("First shifted left = %u\n", first << 1);
    printf("First shifted right = %u\n", first >> 1);
    return 0;
}

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

AND = 8
OR = 14
XOR = 6
First shifted left = 24
First shifted right = 6

0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

Read the required input values.
Apply bitwise operators directly to the binary representations of two unsigned integers.
Display the computed result.

Apply bitwise operators directly to the binary representations of two unsigned integers.

EFFICIENCY

Time and space complexity

Time complexity

O(1)

Auxiliary space

O(1)

DEBUGGING CHECKLIST

Common mistakes

Check this

Use the correct format specifier for every variable.

Check this

Initialize variables before using their values.

Check this

Check braces, semicolons and input order carefully.

Try it yourself

Practice: Run the program with the sample input, predict its output, and then test one boundary case of your own.