Geetha Renuka

  lab Polinomial addition  POLYNOMIAL IN LINKED LIST #include<stdio.h> #include<conio.h> #include<stdlib.h> struct node { int coeff,expo; struct node *next; }; struct node *start=NULL,*s1=NULL,*s2=NULL,*s3=NULL,*p; void create(); void traverse(); void polyadd(); int main() { int choice,ele; clrscr(); while(1) { clrscr(); printf("\t\tpolynomial adt\n"); printf("1.create poly1 \n"); printf("2.create poly2 \n"); printf("3.traverselist1\n"); printf("4.traverselist2\n"); printf("5.polynomial add\n"); printf("6.treaverse list \n"); printf("7.exit\n"); printf("enter choice\n"); scanf("%d",&choice); switch(choice) { case 1:create(); s1=start; start=NULL; break; case 2:create(); s2=start; start=NULL; break; case 3: p=s1; traverse(); ...

DTI

Experiments

 AI notes

 DS NOTES