Check if nth Bit in a 32 bit Integer is Set or not
#include
#include
int result,position;
int n_bit_position(int x,int position);
void main()
{
unsigned int number;
clrscr();
printf("Enter the unsigned integer:\n");
scanf("%d", &number);
printf("enter position\n");
scanf("%d", &position);
n_bit_position(i, position);
if
(result & 1)
printf("YES\n");
else
printf("NO\n");
}
int n_bit_position(int number,int
position)
{
result = (number>>(position));
getch();
}
Output
Enter the unsigned integer:
101
enter position
4
NO
Enter the unsigned integer:
113
enter position
4
YES
Check if a given Bit Position is set to One or not
#include
#include
void main()
{
unsigned int number;
int result, position;
clrscr();
printf("Enter the unsigned integer:\n");
scanf("%d", &number);
printf("enter position to be searched\n");
scanf("%d", &position);
result = (number >> (position));
if (result & 1)
printf("TRUE\n");
else
printf("FALSE\n");
getch();
}
Output
Enter the unsigned integer:
128
enter position to be searched
7
TRUE
Count the Number of Bits set to One using Bitwise Operations
#include
#include
int main()
{
unsigned int number;
int count = 0;
clrscr();
printf("Enter the unsigned integer:\n");
scanf("%d", &number);
while (number != 0)
{
if ((number & 1) == 1)
count++;
number = number >> 1;
}
printf("number of one's are :\n%d\n", count);
return 0;
getch();
}
Output
Enter the unsigned integer:
128
number of one's are :
1
Enter the unsigned integer:
-127
number of one's are :26
No comments:
Post a Comment