Bit Manipulation - The Coding Shala

Home >> Algorithms >> Bit Manipulation

 In this post, we will learn the basics of Bit Manipulation.

Bit Manipulation

As we know Bit stands for binary digits, the smallest unit of data in the computer. The bit can be either 0 or 1.

What is Bit Manipulation?
Bit manipulation is the process of using bitwise operations on the sequence of bits to get a required result.

First, we will see bitwise operators that we use.

& ( and operator)

If both the bits are 1 then the answer will be 1.
0 & 0 = 0
0 & 1 = 0
1 & 0 = 0
1 & 1 = 1

let's take an example
A = 5
B = 3
A & B = 5 & 3 = 101 & 011 = 001 = 1

| (or operator) 

Return 1 if any bit is 1.
0 | 0 = 0
0 | 1 = 1
1 | 0 = 1
1 | 1 = 1

^ (xor operator)

Return 1 if both the bits are different else 0.
0 ^ 0 = 0
0 ^ 1 = 1
1 ^ 0 = 1
1 ^ 1 = 1

~ (not operator)

Use to flip the bits.
~0 = 1
~1 = 0

>> ( right shift)

Shifts all the bits to right position. (divies by two).

For example:
A = 29 ( 11101)
A >> 2 = 1 1 1 0 1 >> 2 = 0 0 1 1 1 = 7

Note: In the right shift most significant bit(left-most bit) will be replaced by 0.

<< (left shift)

Shifts the bits to the left position. (multiplies by two).

For Example:
A = 29 ( 11101), or ( 0011101)
 A << 2 =  0 0 1 1 1 0 1 << 2 = 1 1 1 0 1 0 0 = 116

Note: In the left shift, the least bit(rightmost bit) will be replaced by 0.

Remember: Logical Operators will return different results than bitwise operations.


What is the difference between Logical Shift(>>) and Arithmetic Shift(>>>)?
The logical shift right inserts a 0 in the sing bit while the Arithmetic shift keeps the sign bit.

Example:
1 0 1 1 0 1 0 1 (-75) >>  1 = 0 1 0 1 1 0 1 0 (90)
1 0 1 1 0 1 0 1 (-75) >>> 1 = 1 1 0 1 1 0 1 0 (-38)

1's Complement

1's complement of a binary number is obtained by inverting(toggling) all the bits in it.

Example:
1's complement of 0101 is 1010.

2's Complement

If we add 1 to the 1's complement of the binary number then we get two's complement of a binary number.

For example:
A = 0111
step 1: intver all bits(one's complement)
A = 1000

step 2: add 1
A = 1000 + 1 = 1001

Why Two's Complement used?
Negative numbers are usually stored in computers in the form of two's complement. For the positive number, we use 0 in the sign bit(leftmost) with its binary number while a negative number is represented as the two's complement with 1 in the sign bit.

Example:
7 = 0 111
-7 = 1 001


Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Home >> Scripting >> Sum, product and average Shell Script to find the sum, product, and the average of given numbers Read four integer numbers from the user and find the sum, product, and average of these four numbers? Code:  #! / bin / bash echo "enter four integers" read a b c d sum =$(echo "$a + $b + $c + $d" | bc - l) average=$(echo "$sum / 4" | bc - l) product=$(echo "$a * $b * $c * $d" | bc - l) echo "sum = $sum" echo "Average = $average" echo "Product = $product" Other Posts You May Like Shell script to print sum of the digits of a number Shell Script to print number in descending order Shell script to find out biggest number from three numbers Shell script to find out factorial of a number Shell Script to create a simple calculator Please leave a comment below if you like this post or found some error, it will help me to improve my content.
Read more

New Year Chaos Solution - The Coding Shala

Home >> Programming Questions >> New Year Chaos New Year Chaos Problem Solution In this post, you will learn how to solve New Year Chaos Problem and implement its solution in Java. Problem:   It's New Year's Day and everyone's in line for the Wonderland rollercoaster ride! There are a number of people queued up, and each person wears a sticker indicating their initial position in the queue. Initial positions increment from at the front of the line to at the back.  Any person in the queue can bribe the person directly in front of them to swap positions. If two people swap positions, they still wear the same sticker denoting their original places in line. One person can bribe at most two others.  For Example, if n=8 and Person 5 bribes Person 4, the queue will look like this: 1,2,3,5,4,6,7,8. Fascinated by this chaotic queue, you decide you must know the minimum number of bribes that took place to get the queue into its current state. Input:
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y
Read more

Java Method Overloading - The Coding Shala

Image
Home >> Learn Java >> Java Method Overloading Java Method Overloading Java class can have more than one method with the same name but different in parameters, known as Method Overloading. Question: What is the use of method overloading? Answer:  Suppose we want to perform some operation like an addition but addition can be performed between two numbers, three numbers or two floats or more. So instead of using different methods, we use the same name of the method with different parameters. This can increase the readability of the program. Method overloading can be achieved by changing numbers of arguments or by changing the data types. Example of Method Overloading in Java The following example explains Method Overloading: //Method Overloading example class Addition { public int add ( int a , int b ){ return a + b ; } public int add ( int a , int b , int c ){ return a + b + c ; }
Read more

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { int temp = num
Read more