Python3 Program to Rotate bits of a number

Last Updated : 06 Sep, 2024

Bit Rotation: A rotation (or circular shift) is an operation similar to a shift except that the bits that fall off at one end are put back to the other end.
In the left rotation, the bits that fall off at the left end are put back at the right end.
In the right rotation, the bits that fall off at the right end are put back at the left end.

INTRODUCTION:

In this Python program, we will learn how to rotate the bits of a given number. Bit rotation, also known as bit shifting, is a technique for rotating the bits of a binary number to the left or right. This can be useful in a variety of contexts, such as in computer science and cryptography.

The program will take an integer input and a rotation distance, and will output the resulting rotated number. The program will use bit shifting and bitwise OR operations to accomplish the rotation.

We will begin by declaring the necessary variables and prompting the user for input. Next, we will use bit shifting and bitwise OR to rotate the bits of the input number according to the specified rotation distance. Finally, we will output the resulting rotated number to the console.

EXAMPLE 1:

Python

def rotate_bits(num, rot):     return (num << rot) & 0xFFFFFFFF  num = int(input("Enter a number: ")) rot = int(input("Enter the number of positions to rotate: "))  result = rotate_bits(num, rot) print("The result of the rotation is:", result)

Example: 2

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.

Python3

# Python3 code to  # rotate bits of number  INT_BITS = 32  # Function to left # rotate n by d bits def leftRotate(n, d):      # In n<<d, last d bits are 0.     # To put first 3 bits of n at      # last, do bitwise or of n<<d     # with n >>(INT_BITS - d)      return (n << d)|(n >> (INT_BITS - d))  # Function to right # rotate n by d bits def rightRotate(n, d):      # In n>>d, first d bits are 0.     # To put last 3 bits of at      # first, do bitwise or of n>>d     # with n <<(INT_BITS - d)      return (n >> d)|(n << (INT_BITS - d)) & 0xFFFFFFFF  # Driver program to # test above functions  n = 16 d = 2  print("Left Rotation of",n,"by"       ,d,"is",end=" ") print(leftRotate(n, d))  print("Right Rotation of",n,"by"      ,d,"is",end=" ") print(rightRotate(n, d))  # This code is contributed by # Smitha Dinesh Semwal

Output :

Left Rotation of 16 by 2 is 64
Right Rotation of 16 by 2 is 4

Time Complexity: O(1)

Auxiliary Space: O(1)

Please refer complete article on Rotate bits of a number for more details!

Python3 Program to Generate all rotations of a number

kartik

Improve

Article Tags :

Practice Tags :

INTRODUCTION:One important point to consider when working with the algorithm to rotate the digits of a given number by k positions is the time complexity. If we were to implement this algorithm using the approach shown in the previous example, the time complexity would be O(n), where n is the number

4 min read

Python3 Program to Generate all rotations of a number

Given an integer n, the task is to generate all the left shift numbers possible. A left shift number is a number that is generated when all the digits of the number are shifted one position to the left and the digit at the first position is shifted to the last.Examples: Input: n = 123 Output: 231 31

2 min read

Python program to right rotate n-numbers by 1

Given a number n. The task is to print n-integers n-times (starting from 1) and right rotate the integers by after each iteration.Examples: Input: 6 Output : 1 2 3 4 5 6 2 3 4 5 6 1 3 4 5 6 1 2 4 5 6 1 2 3 5 6 1 2 3 4 6 1 2 3 4 5 Input : 3 Output : 1 2 3 2 3 1 3 1 2 Method 1: Below is the implementa

2 min read

Python Program to Reverse a Number

We are given a number and our task is to reverse its digits. For example, if the input is 12345 then the output should be 54321. In this article, we will explore various techniques for reversing a number in Python. Using String SlicingIn this example, the Python code reverses a given number by conve

3 min read

Python program to add two binary numbers

Given two binary numbers, write a Python program to compute their sum. Examples: Input: a = "11", b = "1" Output: "100" Input: a = "1101", b = "100" Output: 10001Approach: Naive Approach: The idea is to start from the last characters of two strings and compute digit sum one by one. If the sum become

4 min read

Python Program to Subtract Two Binary Numbers

We are given two binary numbers, num1 and num2 and we have to subtract these two binary numbers and return the result. In this article, we will see how we can subtract two binary numbers in Python. Examples: Input: a = "1110" , b = "0110"Output: "1000"Explanation: We can see that when "1110" is subt

3 min read

Python Program to Multiply Two Binary Numbers

Given two binary numbers, and the task is to write a Python program to multiply both numbers. Example: firstnumber = 110 secondnumber = 10 Multiplication Result = 1100 We can multiply two binary numbers in two ways using python, and these are: Using bin() functions andWithout using pre-defined funct

2 min read

Python Program for Array Rotation

Here we are going to see how we can rotate array with Python code. Array Rotation: Python Program for Array Rotation ExamplePartitioning the sub arrays and reversing them Approach: Input arr[] = [1, 2, 3, 4, 5, 6, 7, 8], d = 1, size = 8 1) Reverse the entire list by swapping first and last numbers i

7 min read

Python3 Program To Rotate Linked List Block Wise

Given a Linked List of length n and block length k rotate in a circular manner towards right/left each block by a number d. If d is positive rotate towards right else rotate towards left. Examples: Input: 1->2->3->4->5->6->7->8->9->NULL, k = 3 d = 1Output: 3->1->2-

3 min read

Python Program to add two hexadecimal numbers

Given two hexadecimal numbers, write a Python program to compute their sum. Examples: Input: a = "01B", b = "378" Output: 393 Explanation: B (11 in decimal) + 8 = 19 (13 in hex), hence addition bit = 3, carry = 1 1 + 7 + 1 (carry) = 9, hence addition bit = 9, carry = 0 0 + 3 + 0 (carry) = 3, hence a

6 min read

Python3 Program to Rotate bits of a number

INTRODUCTION:

EXAMPLE 1:

Example: 2

Similar Reads