0 A C - PROGRAM TO RIGHT ROTATE (WITHOUT CALLING FUNCTION) A GIVEN INTEGER

RIGHT ROTATION

Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.
In left rotation, the bits that fall off at left end are put back at right end.
In right rotation, the bits that fall off at right end are put back at left end.
Example:
Let n is stored using 8 bits. Left rotation of n = 11100101 by 3 makes n = 00101111 (Left shifted by 3 and first 3 bits are put back in last ). If n is stored using 16 bits or 32 bits then left rotation of n (000…11100101) becomes 00..0011100101000.
Right rotation of n = 11100101 by 3 makes n = 10111100 (Right shifted by 3 and last 3 bits are put back in first ) if n is stored using 8 bits. If n is stored using 16 bits or 32 bits then right rotation of n (000…11100101) by 3 becomes 101000..0011100.

PROGRAM IS :

#include<stdio.h>
#include<conio.h>
void main()
{
    int i,j,r;
    printf("Enter the unsigned int \n");
    scanf("%d",&i);
    printf("Enter the no of bits \n");
    scanf("%d",&j);
    r=i>>j;
    printf("The value of %d after rotating %d bits to the right is = %d \n ",i,j,r);
    getch();
}

Just copy and paste into your Microsoft Visual C++ or Turbo C (these are program developing software) 

Or else you can try this demo file and use it ... 

Click HERE to download this file. 

(Press ctrl+z and hit Enter to end the program).. 

~NOTE~ : While executing if you get any warning then just ignore it and continue with your program... 

IF FACE ANY PROBLEM DON'T FORGET TO COMMENT ...!!

Don't Forget to share.... 

Follow on Facebook : Ethical Hacking.