E1 - z--; } } int bintodec(struct stack *p) { int i,x=0;

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
#include<stdio.h> #include<conio.h> #include<math.h> # struct stack { int data[10]; int top; }; } struct stack add(struct stack *p,struct stack *q) { struct stack z; int carry=0,i,max,t1,t2; z.top=-1; if(p->top>q->top) max=p->top; else max=q->top; for(i=0;i<=max;i++) { if(i<=p->top) t1=p->data[i]; else t1=0; if(i<=q->top) t2=q->data[i]; else t2=0; z.data[i]=(t1+t2+carry)%2; (z.top)++; if(t1+t2+carry<2) carry=0; else carry=1; } if(carry==1) { z.data[i]=1; z.top=i; } return z; } void dectobin(int z,struct stack *p) { int x; x=z; p->top=-1; do { (p->top)++; p->data[p->top]=x%2; x=x/2;
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
}while(x>0); } void display(struct stack *p) { int z; z=p->top; while(z>=0) { printf("%d",p->data[z]);
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: z--; } } int bintodec(struct stack *p) { int i,x=0; for(i=0;i<=p->top;i++) { x=x+(p->data[i]*pow(2,i)); } return x; } void main() { int a,b,c,x; struct stack a1,b1,c1; clrscr(); printf("Enter the two decimal nos"); scanf("%d%d",&a,&b); dectobin(a,&a1); dectobin(b,&b1); printf("The first no in binary is "); display(&a1); printf("\nThe second no in binary is "); display(&b1); c1=add(&a1,&b1); printf("\nThe Addition of the Binary nos is"); display(&c1); c=bintodec(&c1); printf("\nThe addition of the decimal nos is %d",c); getch(); }...
View Full Document

This note was uploaded on 10/25/2010 for the course CMPN SEM4 taught by Professor Thakur during the Spring '07 term at University of Mumbai.

Page1 / 2

E1 - z--; } } int bintodec(struct stack *p) { int i,x=0;

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online