How to add binary numbers using Java

This code will take two binary arithmetic arrays, will add them and store in another array and shows the results of addition.


public class AddBinary 
{
static int carry = 0;
public static void main(String args[])
{
int a[] = {0,0,1,1}, b[]= {0,1,0,1};
int c[] = new int[a.length];
for(int i = 0; i<a.length;i++)
{
c[i] = (a[i] + b[i] + carry)%2;
carry = (a[i] + b[i] + carry)/2;
}
for(int j = 0 ; j<c.length; j++)
{
System.out.print(c[j]);
}
}
}

Comments

Post a Comment

Popular posts from this blog

Read Excel file from Java

Image
We use Excel file in our day to day work, for creating daily reports or maintaining expense sheet at home. Excel can also be used as a simple database, we can read entries from an excel file and can use them further in our program. We are using excel file to store Test execution reports, such as validation points, whether the test case is passed or not, true or false, and later using that cell information to decide whether the Test Case was passed or not. Excel automation plays an important role when using in Automation testing. We are using TestNG framework for our Test Case execution and stores the result in either Excel file(using java) or we use emailable reports from TestNG. We need to add external jar in our project to read and write excel file, POI jar is used to do this. You can download the jars from below link. Download POI Jars Follow below steps in eclipse to add the POI jars to your project After downloading the jars unzip the file Rig...
Read more

Data Structures programs in Java

In this post we will look at very important subject in computer science, every computer science student must know data structure and how to implement it. Not only in theory but he/she must know how to code it. Sounds boring !!!. Forget whatever I said above, just code for fun. There's no rule to follow in tech. Here's the code: Bubble Sort in java: from the Wikipedia article: Bubble sort , sometimes referred to as  sinking sort , is a simple  sorting algorithm  that repeatedly steps through the list to be sorted, compares each pair of adjacent items and  swaps  them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a  comparison sort , is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to  insertion sort . ...
Read more