Solution Code
#include
#include
#include
using namespace std;
/* READ BINARY NUMBER */
stack read()
{
stack s;
int x,n,i;
cout<>n;
cout<
for(i=0;i>x;
s.push(x);
}
return s;
}
/* DISPLAY FUNCTION */
void display(stack&s)
{
cout<<” “;
while(!s.empty())
{
cout<<s.top()<<” “;
s.pop();
}
}
/* ADDITION OF TWO BINARY NOS.*/
stack add(stack &s1,stack &s2)
{
stack s;
int sum,carry=0,b1,b2;
while(!s1.empty()||!s2.empty())
{
b1=b2=0;
if(!s1.empty())
{
b1=s1.top();
s1.pop();
}
if(!s2.empty())
{
b2=s2.top();
s2.pop();
}
sum=(b1+b2+carry)%2;
carry=(b1+b2+carry)/2;
s.push(sum);
}
if(carry==1)
s.push(1);
return s;
}
/* MAIN FUNCTION*/
int main()
{
stack s1,s2,s3;
int ch;
cout<<“\n\t\t\t***MENU***\n”;
cout< < < <<“\n4……..Exit”;
do
{
cout<>ch;
switch(ch)
{
case 1:
s1=read();
break;
case 2:
s2=read();
break;
case 3:
cout< s3=add(s1,s2);
display(s3);
break;
}
}while(ch!=4);
return 0;
getch();
}