E2FINL - #include #include #...

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

View Full Document Right Arrow Icon
#include<stdio.h> #include<conio.h> #include<math.h> # # define mx 6 # struct stack { int data[mx]; int top; }; } int mul[2*mx+1]; i struct stack add(struct stack *p,struct stack *q,int *c) { struct stack z; int 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+(*c))%2; (z.top)++; if(t1+t2+(*c)<2) (*c)=0; else (*c)=1; } return z; } void dectobin(int z,struct stack *p) { int x,t=mx; x=z; p->top=-1; do { (p->top)++; p->data[p->top]=x%2; x=x/2; t--; }while(t>0);
Background image of page 1

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

View Full DocumentRight Arrow Icon
} void display(struct stack *p) { int z; z=p->top; while(z>=0) { printf("%d",p->data[z]); z--; } } int bintodec(int mu[]) { int i,x=0; for(i=0;i<10;i++) { x=x+(mu[i]*pow(2,i)); } return x; } void shift(int c,struct stack *a,struct stack *q) { int i=0,temp; temp=a->data[0]; while(i<a->top) { a->data[i]=a->data[i+1]; i++; } a->data[a->top]=c; i=0; while(i<q->top) { q->data[i]=q->data[i+1]; i++; } q->data[q->top]=temp;
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the 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 / 4

E2FINL - #include #include #...

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

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