Semester 3 Computer Organization & Architecture (COA): Java program for Booth's Algorithm and IEEE 754 reprsentation

 Given below is Java programs for Booth's algorithm and IEEE 754.

//AIM:To implement Booths Algorithm import java.util.*; class boothf {static void bin(int x,int y[]) {if(x<0) x*=-1; int z=1; int c=0; int p=0; while(x!=0) {z=x%2; y[p]=z; x=x/2; ++p; }} static void com2(int x[]) {if(x[0]==1) {for(int i=1;i<4;++i) {if(x[i]==1) x[i]=0; else x[i]=1; }} else {int c=0; while(x[c]!=1) ++c; for(int i=c+1;i<4;++i) {if(x[i]==0) x[i]=1; else x[i]=0; }}} static void shiftr(int ac[],int q[],int sign) {for(int i=0;i<3;++i) {q[i]=q[i+1];} q[3]=ac[0]; for(int i=0;i<3;++i) {ac[i]=ac[i+1]; } ac[3]=sign;} static void add(int ac[],int m[]) { int carry[]={0,0,0,0,0}; int i; for(i=0;i<4;++i) {if(ac[i]+m[i]+carry[i]==0) {carry[i+1]=0; ac[i]=0;} else if(ac[i]+m[i]+carry[i]==1) {carry[i+1]=0; ac[i]=1;} else if(ac[i]+m[i]+carry[i]==2) {carry[i+1]=1; ac[i]=0; } else {carry[i+1]=1; ac[i]=1; }}} public static void main(String args[]) {Scanner scr=new Scanner(System.in); int ac[]={0,0,0,0}; int q[]={0,0,0,0}; int m[]={0,0,0,0}; int a,b,count=4; int q_1=0; System.out.println("Enter multiplicand "); a=scr.nextInt(); System.out.println("Enter multiplier "); b=scr.nextInt(); bin(a,m); if(a<0) { com2(m); } bin(b,q); if(b<0) { com2(q); } int m2[]=new int[4]; for(int i=0;i<4;++i) m2[i]=m[i]; com2(m2); int sign=0; System.out.print("Multiplicand = "); for(int k=3;k>=0;--k) System.out.print(m[k]); System.out.println(); System.out.print("Multiplier = "); for(int k=3;k>=0;--k) System.out.print(q[k]); do { if(q[0]==0 && q_1==1) { add(ac,m); if(a<0) sign=1; else sign=0; } else if(q[0]==1 && q_1==0) {add(ac,m2); if(a>0) sign=1; else sign=0; } q_1=q[0]; shiftr(ac,q,sign); --count; System.out.println(); System.out.print("ac= "); for(int i=3;i>=0;--i) System.out.print(ac[i]); System.out.println(); System.out.print("q= "); for(int i=3;i>=0;--i) System.out.print(q[i]); System.out.println("q_1= "+q_1); } while(count!=0); System.out.println(); System.out.println(); System.out.print("The product is "); for(int i=3;i>=0;--i) System.out.print(ac[i]); for(int i=3;i>=0;--i) System.out.print(q[i]); } } /* OUTPUT 1: Enter multiplicand 3 Enter multiplier 2 Multiplicand = 0011 Multiplier = 0010 ac= 0000 q= 0001q_1= 0 ac= 1110 q= 1000q_1= 1 ac= 0000 q= 1100q_1= 0 ac= 0000 q= 0110q_1= 0 The product is 00000110 OUTPUT 2: Enter multiplicand -3 Enter multiplier 2 Multiplicand = 1101 Multiplier = 0010 ac= 0000 q= 0001q_1= 0 ac= 0001 q= 1000q_1= 1 ac= 1111 q= 0100q_1= 0 ac= 1111 q= 1010q_1= 0 The product is 11111010 OUTPUT 3: Enter multiplicand -3 Enter multiplier -2 Multiplicand = 1101 Multiplier = 1110 ac= 0000 q= 0111q_1= 0 ac= 0001 q= 1011q_1= 1 ac= 0000 q= 1101q_1= 1 ac= 0000 q= 0110q_1= 1 The product is 00000110 OUTPUT 4: Enter multiplicand 3 Enter multiplier -2 Multiplicand = 0011 Multiplier = 1110 ac= 0000 q= 0111q_1= 0 ac= 1110 q= 1011q_1= 1 ac= 1111 q= 0101q_1= 1 ac= 1111 q= 1010q_1= 1 The product is 11111010 */


Given below is the Java Code for conversion into IEEE 754 format.
//Aim:IEEE 754 representation import java.util.*; class IEEE { public static void main(String args[]) { Scanner scr=new Scanner(System.in); double d; System.out.println("Enter the floating number"); d=scr.nextDouble(); int sign; if(d>=0) sign=0; else sign=1; int a=(int)d; double b=d-a; // bin conv int bin[]=new int[20]; int x=1; int c=0; int p=0; while(a!=0) { x=a%2; bin[p]=x; a=a/2; ++c; ++p; } // decimal number conv int bin2[]=new int[30]; int m=1; for(int j=0;j<23;++j) { b=b*2; m=(int)b; bin2[j]=m; b=b-m; } int biasedex=c+127-1; int d1=1;int k=0; int bin3[]=new int[8]; while(biasedex!=0) { d1=biasedex%2; bin3[7-k]=d1; biasedex=biasedex/2; ++k; } System.out.println(); System.out.print("Sign= "+sign); System.out.print(" biased expo= "); for(int i=0;i<8;++i) System.out.print(bin3[i]); System.out.print(" Normalised mantissa= "); for(int i=c-2;i>=0;--i) System.out.print(bin[i]); for(int i=0;i<23-c;++i) System.out.print(bin2[i]); } } /* Output Enter the floating number 12.367 Sign= 0 biased expo= 10000010 Normalised mantissa= 1000101110111110011101 */