Test your Programming Skill : P-1

Write a Program to calculate Sum of Two number Without Using Any operator like +,-,* ... etc.

You can solve it in many different ways : But you need to consider binary operation like XOR , AND .


Imagine if you have to add two number in Binary what will you do . simply you going to create full adder .
similarly here you have to implement full adder . But not only for 3 bit make it  general . i.e it can add any number .
To do this you can use recursion or looping .

Here we provide you C & Python 3 program sample .

C code Without Recursion :

 #include<stdio.h>  
 int Add(int x, int y)  
 {  
   while (y != 0)   
   // Iterate till there is no carry   
   {  
     int carry = x & y;   
     // carry now contains common set bits of x and y  
     x = x ^ y;   
     // Sum of bits of x and y where at least one of the bits is not set  
     y = carry << 1;  
     // Carry is shifted by one so that adding it to x gives the required sum  
   }  
   return x;  
 }  
 int main()  
 {  
      int a,b;  
      printf("input a & b : ");  
      scanf("%d %d",&a,&b);  
   printf("%d", Add(a, b));  
   return 0;  
 }  

C code With Recursion :

 #include<stdio.h>  
 int Add(int x, int y)  //Recursive problem  
 {  
   if (y == 0)  
     return x;  
   else  
     return Add( x ^ y, (x & y) << 1);  
 }  
 int main()  
 {  
      int a,b;  
      printf("input a & b : ");  
      scanf("%d %d",&a,&b);  
   printf("%d", Add(a, b));  
   return 0;  
 }  

# Python 3 code without recursion :

def ADD(x,y):  
   while(y!=0):  
     carry=x&y  
     x=x^y  
     y=carry<<1  
   return(x)  
x=int(input("insert first no : "))  
y=int(input("insert second no : "))  
print(ADD(x,y))  

# Python 3 code with recursion :

def ADD(x,y):   
   if(y==0):  
     return(x)  
   else:  
     return(ADD(x^y,(x&y)<<1))  
          
   
x=int(input("insert first no : "))   
y=int(input("insert second no : "))   
print(ADD(x,y))  
   

Hope It will Help you :::)

Test your Programming Skill : P-2

Have a Nice Day 8-)