e2 - #include<stdio.h> #include<conio.h>...

Info iconThis preview shows pages 1–5. 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; }; # define mx 10 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
Background image of page 1

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

View Full DocumentRight Arrow Icon
  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); } void display(struct stack *p) {  int z;  z=p->top;  while(z>=0)  {  printf("%d",p->data[z]);   z--;  } }
Background image of page 2
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 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++;
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
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 / 5

e2 - #include&lt;stdio.h&gt; #include&lt;conio.h&gt;...

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

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