OLiSwEll

//9.c //Write a program to create a sorted singly linked list.   struct list {    int info;    struct list *next; }*start,*p,*q,*node;  void main() {     void disp(struct list *);     void create(struct list *);     int choice;     clrscr();     start=node='\0';     do     {        clrscr();        printf("\n\n1 : Add element in link list.");        printf("\n2 : Display linklist.");        printf("\n3 : Exit from Program.\n");        printf("\nEnter your choice ==========> ");        scanf("%d",&choice);        switch(choice)        {        case 1:       create(start);       getch();       break;        case 2:       disp(start);       getch();       break;        case 3:        return;        default:      printf("\n\nINVALID CHOICE\n");      getch();      }    }while(1); }   void disp(struct list *t) {     printf("\nSorted link list contains : ");     while(t!='\0')     {        printf("%d ",t->info);        t= t->next;     } }  void create(struct list *t) {     int item,i,j;     p = t;     q = t->next;     printf("Enter an item ======> ");     scanf("%d",&item);     node = (struct list *)malloc(sizeof(struct list));     node->info = item;     node->next = '\0';     if(t == '\0')        start = node;     else if(node->info <>info)     {        node->next = t;        start = node;     }     else     {        while(q!='\0')        {         if(node->info <>info)         {          node->next = p->next;          p->next = node;          return;         }         else         {          p = q;          q = q->next;         }        }        p->next = node;     } } //9.e /* Write program perform the following operations on a singly linked list.  1. Insert an element  2. Delete an element  3. Find the sum of elements of the list  4. Count number of the nodes in the linked list  5. Search a given elements in the linked list.  6. Reverse the linked list.  7. Make a copy of the given linked list  8. Merge two linked list.  9. Find the union of the two given linked list  10. Find the intersection of the two given linked list.  */  int count,flag=0,sum; struct linklist {    int info;    struct linklist *next; }*start,*FIRST,*begin,*node,*p,*prev;  void insert1(); void insert2(struct linklist *); void first(); void last(struct linklist *); void specified(struct linklist *); void del(struct linklist *); void find(struct linklist *); void reverse(struct linklist *); void copy(struct linklist *); void mergecreate(); void merge(struct linklist *,struct linklist *); void union1(struct linklist *,struct linklist *); void intersection(struct linklist *,struct linklist *); void dispstart(struct linklist *); void dispfirst(struct linklist *); void dispmerge(struct linklist *); void findsum(struct linklist *); void main() {     int choice,item;     int i;     clrscr();     start = FIRST = begin = p = node = '\0';     printf("Enter an Eelement -1 for Stop ==> ");     scanf("%d",&item);     node = (struct linklist *)malloc(sizeof(struct linklist));     if(item!=-1)     p = start = node;     while(item!=-1)     {      count++;        //Count Number of nodes      node->info = item;      p->next = node;      p = p->next;      node->next = '\0';      scanf("%d",&item);      node = (struct linklist *)malloc(sizeof(struct linklist));     }     do     {     clrscr();     printf("\n1 : Insert Element in list.");     printf("\n2 : Delete Element From list.");     printf("\n3 : Find an Element from list.");     printf("\n4 : Count Number of Nodes.");     printf("\n5 : Reverse Given Linklist.");     printf("\n6 : Copy the Given Linklist.");     printf("\n7 : Merge(Concate) Two Linklist.");     printf("\n8 : Find Union of Two linklist.");     printf("\n9 : Find Intersection of Two linklist.");     printf("\n10: Find the Sum of Element.");     printf("\n11: Display Linklist.");     printf("\n12: Exit From Program.\n");     printf("\nEnter Your Choice =====> ");     scanf("%d",&choice);     switch(choice)     {     case 1:        insert1();        getch();        break;     case 2:        del(start);        getch();        break;     case 3:        find(start);        getch();        break;     case 4:        printf("\n\t\t>>>>>>>> THERE ARE %d NODES IN LINKLIST. <<<<<<<<<\n",count);        getch();        break;     case 5:        FIRST = '\0';        reverse(start);        printf("\nLinklist Contains : ");        dispstart(start);        printf("\nREVERSE LINKLIST  : ");        dispfirst(FIRST);        getch();        break;     case 6:        FIRST = '\0';        copy(start);        printf("\nLinklist Contains : ");        dispstart(start);        printf("\nLinklist Contains : ");        dispstart(FIRST);        getch();        break;     case 7:        begin = '\0';        if(flag==0)            mergecreate();        merge(start,FIRST);        printf("\nLinklist Contains : ");        dispstart(start);        printf("\nLinklist Contains : ");        dispstart(FIRST);        printf("\nMERGE LINKLIST  : ");        dispstart(begin);        getch();        break;     case 8:        begin = '\0';        if(flag==0)           mergecreate();        union1(start,FIRST);        printf("\nLinklist Contains : ");        dispstart(start);        printf("\nLinklist Contains : ");        dispstart(FIRST);        printf("\nUnion Linklist  : ");        dispstart(begin);        getch();        break;     case 9:        begin = '\0';        if(flag==0)            mergecreate();        intersection(start,FIRST);        printf("\nLinklist Contains : ");        dispstart(start);        printf("\nLinklist Contains : ");        dispstart(FIRST);        printf("\nIntersection List : ");        dispstart(begin);        getch();        break;     case 10:        sum = 0;        findsum(start);        printf("\n\nSUM OF ELEMENT IS %d.\n",sum);        getch();        break;     case 11:        printf("\nLinklist Contains : ");        dispstart(start);        getch();        break;     case 12:        return;     default:        printf("\n\nINVALID CHOICE\n");     }     }while(1);  } void dispfirst(struct linklist *p) {    while(p!='\0')    {        printf("%d ",p->info);        p = p->next;    } }  void dispstart(struct linklist *first) {     p=first;     while(p!='\0')     {        printf("%d ",p->info);        p = p->next;     } }  void insert1() {    int choice;    printf("\n\t1 : Insert at First Position.");    printf("\n\t2 : Insert at Last Position.");    printf("\n\t3 : Insert at Specified Position.");    printf("\n\n\tEnter Your Choice =======> ");    scanf("%d",&choice);    switch(choice)    {    case 1:          first();          break;    case 2:          last(start);          break;    case 3:          specified(start);          break;    default:          printf("\nINVALID CHOICE\n");    } } void first() {    int item;    printf("\nEnter an Item =====> ");    scanf("%d",&item);    node = (struct linklist*)malloc(sizeof(struct linklist));    node->info = item;    node->next = start;    start = node;     count++; } void last(struct linklist *p) {    int item;    printf("\nEnter an Item =====> ");    scanf("%d",&item);    node = (struct linklist*)malloc(sizeof(struct linklist));    node->info=item;    node->next = '\0';    if(start=='\0')       start = node;    else       while(p->next != '\0')      p = p->next;    p->next = node;    count++; } void specified(struct linklist *p) {    int item,pos,n=2;    printf("\nEnter an Item =====> ");    scanf("%d",&item);    printf("\nEnter Position =====> ");    scanf("%d",&pos);    node = (struct linklist*)malloc(sizeof(struct linklist));    node->info=item;    node->next = '\0';    if(pos==1)    {      node->next = start;      start = node;      count++;      return;    }    else       while(pos>n)       {      p = p->next;      if(p == '\0')      {         printf(" \nPosition Not Found.\n");         return;      }      n++;       }    node->next = p->next;    p->next = node;    count++; } void del(struct linklist *p) {    int item;    if(start == '\0')    {       printf("\nLINKLIST IS EMPTY\n");       return;    }    printf("Enter Item that You want to DELETE ======> ");    scanf("%d",&item);    if(item == start->info)    {       printf("\n%d is deleted.\n",start->info);       start = start->next;       count--;    }    else       while(p!='\0')       {      prev = p;      p = p->next;      if(p->info == item)      {         printf("\n%d is deleted.\n",p->info);         prev->next = p->next;         count--;         return;      }       }      if(p=='\0')      printf("\nItem Does Not Found.\n"); } void find(struct linklist *p) {    int i=0,item;    if(start == '\0')    {       printf("\nLINKLIST IS EMPTY\n");       return;    }    printf("Enter Item that U want to Find =====> ");    scanf("%d",&item);    if(start->info ==  item)    {       i++;       printf("\nYOUR SELECTED ITEM IS %d AT POSITION %d.",item,i);       return;    }    else       while(p != '\0')       {     if(p->info == item)     {        i++;        printf("\nYOUR SELECTED ITEM IS %d AT POSITION %d.",item,i);        return;     }     else     {       i++;     }     p = p->next;       }       if(p == '\0')      printf("\nITEM IS NOT FOUND.\n"); } void reverse(struct linklist *p) {     if(p=='\0')     {        printf("\n\nLINKLIST IS EMPTY.\n");        return;     }     while(p != '\0')     {        node = (struct linklist *)malloc(sizeof(struct linklist));        node->info = p->info;        node->next = FIRST;        if(FIRST == '\0')        node->next = '\0';        FIRST = node;        p = p->next;     } } void copy(struct linklist *p) {     struct linklist *q;     q = p;     if(p=='\0')     {        printf("\n\nLINKLIST IS EMPTY\n");        return;     }     while(p != '\0')     {        node = (struct linklist *)malloc(sizeof(struct linklist));        if(FIRST == '\0')      FIRST = q = node;        node->info = p->info;        q->next = node;        q = q->next;        node->next = '\0';        p = p->next;    }    printf("\n\nLINKLIST IS COPIED.\n"); } void mergecreate() {    int item;    flag = 1;    printf("Enter an Eelement in SECOND LIST -1 for Stop ==> ");    scanf("%d",&item);    node = (struct linklist *)malloc(sizeof(struct linklist));    if(item!=-1)        p = FIRST = node;    while(item!=-1)    {       node->info = item;       p->next = node;       p = p->next;       node->next = '\0';       scanf("%d",&item);       node = (struct linklist *)malloc(sizeof(struct linklist));    } } void merge(struct linklist *p,struct linklist *q) {    struct linklist *t;    t = p;    if(p=='\0')    {       printf("\nFIRST LINKLIST IS EMPTY\n");       goto next1;    }    while(p != '\0')    {        node = (struct linklist*)malloc(sizeof(struct linklist));        node->info = p->info;        if(begin == '\0')        {       begin = t = node;        }        t->next = node;        t = t->next;        node->next = '\0';        p = p->next;    }    next1:    if(FIRST == '\0')    {        printf("\nSECOND LINKLIST IS EMPTY\n");        return;    }    node = (struct linklist*)malloc(sizeof(struct linklist));    if(start == '\0')        begin = t = node;    while(q!='\0')    {        node->info = q->info;        t->next = node;        t = t->next;        node->next = '\0';        node = (struct linklist*)malloc(sizeof(struct linklist));        q = q->next;    } } void union1(struct linklist *p,struct linklist *q) {    int flag1=0,item;    struct linklist *t;    if(p=='\0')    {        printf("\nFIRST LINKLIST IS EMPTY\n");        goto next1;    }    while(p != '\0')    {        t = begin;        flag1 = 0;        while(t!='\0')        {          if(p->info == t->info)          {            flag1=1;            break;          }          t = t->next;        }        if(flag1==0)        {           node = (struct linklist*)malloc(sizeof(struct linklist));           node->info = p->info;           node->next = '\0';           if(begin == '\0')           {           begin = node;           }           else           {           t = begin;           while(t->next != '\0')              t = t->next;           t->next = node;           }        }        p = p->next;    }    next1:    if(q=='\0')    {       printf("\nSECOND LINKLIST IS EMPTY\n");       return;    }    while(q != '\0')    {        t = begin;        flag1 = 0;        while(t!='\0')        {          if(q->info == t->info)          {            flag1=1;            break;          }          t = t->next;        }        if(flag1==0)        {           node = (struct linklist*)malloc(sizeof(struct linklist));           node->info = q->info;           node->next = '\0';           if(begin == '\0')           {           begin = node;           }           else           {           t = begin;           while(t->next != '\0')              t = t->next;           t->next = node;           }        }        q = q->next;    } } void intersection(struct linklist *p,struct linklist *s) {    struct linklist *t,*temp,*q;    int item,flag1,chkflag;    if(p=='\0')    {       printf("\n\nFIRST LINKLIST IS EMPTY\n");       return;    }    while(p!='\0')    {        flag1 = 0;        q = s;        while(q!='\0')        {       if(p->info == q->info)       {          item = p->info;          flag1 = 1;          break;       }       q = q->next;        }        if(flag1 == 1)        {       chkflag = 0;       temp = begin;       while(temp!='\0')       {           if(temp->info == item)           {          chkflag = 1;          break;           }           temp = temp->next;       }       if(chkflag == 0)       {           t = begin;           node = (struct linklist *)malloc(sizeof(struct linklist));           node->info = item;           node->next = '\0';           if(begin == '\0')          begin = node;           else           {          while(t->next != '\0')              t = t->next;          t->next = node;           }       }        }        p = p->next;    } } void findsum(struct linklist *p) {    while(p!='\0')    {      sum+=p->info;      p = p->next;    } }   

//9.c /* W.A.P. to create a sorted singly linked list. */ #include  #include   struct list {     int info;     struct list *next; }*start,*p,*q,*node;  void create(struct list *t) {     int item,i,j;     p = t;     q = t->next;      printf("Enter an Element:");     scanf("%d",&item);      node = (struct list *)malloc(sizeof(struct list));     node->info = item;     node->next = NULL;      if(t == NULL)         start = node;     else if(node->info <>info)     {         node->next = t;         start = node;     }     else     {         while(q!=NULL)         {             if(node->info <>info)             {                 node->next = p->next;                 p->next = node;                 return;             }             else             {                 p = q;                 q = q->next;             }         }         p->next = node;     } }  void disp(struct list *t) {          while(t!=NULL)     {         printf("%d ",t->info);         t= t->next;     } }  void main() {      int ch;     clrscr();     start=node=NULL;      do     {         printf("\n1. For Insert\n2. For Display\n3. For Exit");         printf("\nEnter your choice:");         scanf("%d",&ch);                  switch(ch)         {             case 1:                 create(start);                 break;             case 2:                 disp(start);                 break;         }     }while(ch!=3); } //9.e /* Write a Program perform the following operations on a singly likked list. 1. Insert an element. 2. Delete an element. 3. Find the sum of elements of the list. 4. Count number of the nodes in the linked list. 5. Search given elements in the linked list. 6. Reverse the linked list. 7. Make a copy of the nodes in the linked list. 8. concate two linked list. 9. Merge two linked list. 10.Find the union of the given linked list. 11.Find the intersection of the two given linked list. */ int count,flag=0,sum; struct linklist {  int info;  struct linklist *next; }*fintersection,*funion,*fmerge,*start,*FIRST,*FIRST1,*node,*p,*prev;  void insert1(); void insert2(struct linklist *); void first(); void last(struct linklist *); void specified(struct linklist *); void del(struct linklist *); void find(struct linklist *); void reverse(struct linklist *); void copy(struct linklist *); void mergecreate(); void merge(struct linklist *,struct linklist *); void union1(struct linklist *,struct linklist *); void intersection(struct linklist *,struct linklist *); void dispstart(struct linklist *); void dispfirst(struct linklist *); void dispmerge(struct linklist *);  void main() {       int choice,item;       int i;        clrscr();          start = FIRST = p = node = '\0';          printf("Enter an Eelement -1 for Stop ==> ");     scanf("%d",&item);     node = (struct linklist *)malloc(sizeof(struct linklist));      if(item!=-1)               p = start = node;          while(item!=-1)           {         count++;        //Count Number of nodes              node->info = item;              p->next = node;              p = p->next;              node->next = '\0';              scanf("%d",&item);              node = (struct linklist *)malloc(sizeof(struct linklist));     }      do      {              printf("\n\1. For Insert\n2. For Delete\n3. For Find\n4. For Count\n5. For Reverse\n6. For Copy LL\n7. For Merger 2 LL");         printf("\n8. For Union\n9. For Intersection\n10. For Sum of LL\n11. For Exit");              printf("\nEnter Your Choice:");              scanf("%d",&choice);               switch(choice)               {                 case 1:                      insert1();                      dispstart(start);                      break;                   case 2:                 del(start);                      dispstart(start);                      break;                   case 3:                      find(start);                      break;                   case 4:                      printf("\n %d Element in LinkList",count);                      break;                   case 5:                      reverse(start);                     dispstart(start);                      printf("\nREVERSE LINKLIST  : ");                      dispfirst(FIRST);                      break;                   case 6:                      copy(start);                      dispstart(start);                      printf("\nCopy of LinkList");                      dispstart(FIRST);                      break;                   case 7:                      if(flag==0)                             mergecreate();                      merge(start,FIRST1);                      printf("\nLinklist Contains : ");                      dispstart(start);                      printf("\nLinklist Contains : ");                      dispstart(FIRST1);                      printf("\nMERGE LINKLIST  : ");                      dispstart(fmerge);                      fmerge = '\0';                      break;                  case 8:                      if(flag==0)                            mergecreate();                      union1(start,FIRST1);                      printf("\nFirst Linklist");                      dispstart(start);                      printf("\nSecond Linklist");                      dispstart(FIRST1);                      printf("\nUnion Linklist");                      dispstart(funion);                      funion = '\0';                      break;                   case 9:                      if(flag==0)                             mergecreate();                      intersection(start,FIRST1);                      printf("\nFirst Linklist");                      dispstart(start);                      printf("\nSecond Linklist");                      dispstart(FIRST1);                      printf("\nIntersection LinkList");                      dispstart(fintersection);                      fintersection = '\0';                 break;                 case 10:                      sum = 0;                      dispstart(start);                      printf("\nSum of Element is: %d\n",sum);                      break;              }     }while(choice!=11); }  void dispfirst(struct linklist *p) {     while(p!='\0')          {                printf("%d ",p->info);                p = p->next;          }         FIRST = '\0'; }  void dispstart(struct linklist *first) {     p=first;          while(p!='\0')          {                printf("%d ",p->info);                sum+=p->info;                p = p->next;          } }  void insert1() {     int choice;      printf("\n\t1 : Insert at First Position.");      printf("\n\t2 : Insert at Last Position.");      printf("\n\t3 : Insert at Specified Position.");      printf("\n\n\tEnter Your Choice:");      scanf("%d",&choice);             switch(choice)         {              case 1:                  first();                  break;              case 2:                  last(start);                  break;              case 3:                  specified(start);                  break;        } } void first() {        int item;        printf("\nEnter an Element:");        scanf("%d",&item);        node = (struct linklist*)malloc(sizeof(struct linklist));        node->info = item;        node->next = start;        start = node;         count++; }  void last(struct linklist *p) {      int item;      printf("\nEnter an Element:");      scanf("%d",&item);      node = (struct linklist*)malloc(sizeof(struct linklist));      node->info=item;      node->next = '\0';      if(start=='\0')            start = node;      else             while(p->next != '\0')                   p = p->next;      p->next = node;           count++; }  void specified(struct linklist *p) {        int item,pos,n=2;      printf("\nEnter an Element:");      scanf("%d",&item);      printf("\nEnter Position:");      scanf("%d",&pos);      node = (struct linklist*)malloc(sizeof(struct linklist));      node->info=item;      node->next = '\0';       if(pos==1)       {             node->next = start;             start = node;             count++;             return;       }      else     {           while(pos>n)            {                  p = p->next;                    if(p == '\0')             {                  printf("\nPosition Not Found");                  return;             }                   n++;            }     }        node->next = p->next;        p->next = node;        count++; }  void del(struct linklist *p) {       int item;        if(start == '\0')         {               printf("\n LinkList is Underflow");               return;         }       printf("Enter Item that You want to DELETE:");       scanf("%d",&item);        if(item == start->info)        {               printf("\n %d is deleted",start->info);               start = start->next;           count--;        }       else     {           while(p!='\0')            {                  prev = p;                  p = p->next;                  if(p->info == item)                   {                  printf("\n %d is deleted",p->info);                  prev->next = p->next;                      count--;                  return;                   }             }     }          if(p=='\0')                printf("\nElement Not Found"); }  void find(struct linklist *p) {        int i=0,item;         if(start == '\0')         {               printf("\n LinkList is Underflow");               return;         }         printf("Enter Element You want to Find:");        scanf("%d",&item);         if(start->info ==  item)         {               i++;               printf("\nElement is %d at Position %d",item,i);               return;         }        else     {              while(p != '\0')               {             if(p->info == item)               {                    i++;                       printf("\nElement is %d at Position %d",item,i);                       return;               }             else              {                   i++;              }              p = p->next;               }     }          if(p == '\0')                printf("\nElement Not Found"); }  void reverse(struct linklist *p) {      if(p=='\0')         {               printf("\n LinkList is Underflow");               return;         }       while(p != '\0')        {              node = (struct linklist *)malloc(sizeof(struct linklist));              node->info = p->info;              node->next = FIRST;          if(FIRST == '\0')                node->next = '\0';              FIRST = node;              p = p->next;        } }  void copy(struct linklist *p) {     struct linklist *q;        q = p;         if(p=='\0')         {               printf("\n LinkList is Underflow");               return;         }       while(p != '\0')        {              node = (struct linklist *)malloc(sizeof(struct linklist));              if(FIRST == '\0')             FIRST = q = node;              node->info = p->info;                q->next = node;                q = q->next;                node->next = '\0';              p = p->next;        }        printf("\nLinkList is Copied"); }  void mergecreate() {     int item;     flag = 1;      printf("Enter an Eelement in SECOND LIST -1 for Stop :");     scanf("%d",&item);     node = (struct linklist *)malloc(sizeof(struct linklist));      if(item!=-1)         p = FIRST1 = node;     while(item!=-1)      {             node->info = item;             p->next = node;             p = p->next;             node->next = '\0';             scanf("%d",&item);             node = (struct linklist *)malloc(sizeof(struct linklist));      } }  void merge(struct linklist *p,struct linklist *q) {       struct linklist *t;       t = p;        if(p=='\0')         {               printf("\n First LinkList is Underflow");         goto next1;         }         while(p != '\0')          {                node = (struct linklist*)malloc(sizeof(struct linklist));                node->info = p->info;                if(fmerge == '\0')         {               fmerge = t = node;         }                t->next = node;                t = t->next;                node->next = '\0';                p = p->next;          }     next1:      if(FIRST1 == '\0')     {               printf("\n Second LinkList is Underflow");               return;         }           node = (struct linklist*)malloc(sizeof(struct linklist));           if(start == '\0')             fmerge = t = node;            while(q!='\0')            {         node->info = q->info;         t->next = node;          t = t->next;          node->next = '\0';          node = (struct linklist*)malloc(sizeof(struct linklist));          q = q->next;            } }   void union1(struct linklist *p,struct linklist *q) {      int flag1=0,item;       struct linklist *t;        if(p=='\0')         {               printf("\n\t\t>>>>>>>> FIRST LINKLIST IS EMPTY <<<<<<<<\n");               goto next1;         }         while(p != '\0')          {                t = funion;                flag1 = 0;          while(t!='\0')            {                  if(p->info == t->info)                   {                        flag1=1;                        break;                   }                  t = t->next;             }            if(flag1==0)             {                   node = (struct linklist*)malloc(sizeof(struct linklist));                   node->info = p->info;                   node->next = '\0';                   if(funion == '\0')             {                   funion = node;             }                   else             {                   t = funion;                    while(t->next != '\0')                          t = t->next;                   t->next = node;             }               }         p = p->next;     }     next1:           if(q=='\0')         {               printf("\n Second LinkList is Underflow");               return;         }         while(q != '\0')          {                t = funion;                flag1 = 0;          while(t!='\0')            {                  if(q->info == t->info)                   {                        flag1=1;                        break;                   }                  t = t->next;             }            if(flag1==0)             {                   node = (struct linklist*)malloc(sizeof(struct linklist));                   node->info = q->info;                   node->next = '\0';                   if(funion == '\0')             {                   funion = node;             }                   else             {                   t = funion;                    while(t->next != '\0')                          t = t->next;                   t->next = node;             }              }            q = q->next;     } }  void intersection(struct linklist *p,struct linklist *s) {     struct linklist *t,*temp,*q;        int item,flag1,chkflag;        if(p=='\0')         {               printf("\n First LinkList is Underflow");               return;         }        while(p!='\0')         {                flag1 = 0;          q = s;           while(q!='\0')            {                  if(p->info == q->info)                    {                  item = p->info;                  flag1 = 1;                  break;                    }                  q = q->next;            }              if(flag1 == 1)               {             chkflag = 0;             temp = fintersection;               while(temp!='\0')                {                       if(temp->info == item)                        {                     chkflag = 1;                     break;                        }                       temp = temp->next;                 }              if(chkflag == 0)               {                     t = fintersection;                     node = (struct linklist *)malloc(sizeof(struct linklist));                     node->info = item;                     node->next = '\0';                      if(fintersection == '\0')                     fintersection = node;                      else                       {                     while(t->next != '\0')                           t = t->next;                     t->next = node;                       }               }               }          p = p->next;     } }  

//(a) Write a program to create a singly linked list in LIFO fashion. //Singly Linked-List in FIFO fashion. #include struct List {     int no;     struct List *next; }*start=NULL,*link=NULL,*temp=NULL; void insert() {     temp=(struct List *) malloc(sizeof(struct List));     if(temp == NULL)         printf("\nNo sufficient Memory");     else     {         printf("Enter Value: ");         scanf("%d",&temp->no);         temp->next=NULL;         if(start == NULL)             start=temp;         else         {             link=start;             while(link->next!=NULL)             {                 link=link->next;             }             link->next=temp;         }         printf("\nItem is Inserted at Last");     } } void delet() {     if(start==NULL)         printf("\nList is Empty");     else if(start->next==NULL)     {         printf("\nThe Deleted Item is:");         printf("\n  %d",start->no);         free(start);         start=NULL;     }     else     {         temp=start;         start=start->next;         printf("\nThe Deleted Item is:");         printf("\n  %d",temp->no);         free(temp);     } } void view() {     if(start==NULL)         printf("\nList is Empty");     else     {         printf("\nThe List is:");         link=start;         while(link!=NULL)         {             printf("\n  %d",link->no);             link=link->next;         }     } } void main() {     int ch,value,i;     clrscr();     do     {         do         {             clrscr();             printf("\n1. Insert\n2. Delete \n3. View\n4. Exit");             printf("\nEnter Your Choice: ");             scanf("%d",&ch);         }while(ch<1>4);         switch(ch)         {             case 1:                 insert();                 getch();                 break;             case 2:                 delet();                 getch();                 break;             case 3:                 view();                 getch();         }     }while(ch!=4); } //(b) Write a program to create a singly linked list in FIFO fashion. //Singly Linked-List in FIFO fashion. #include struct List {     int no;     struct List *next; }*start=NULL,*link=NULL,*temp=NULL; void insert() {     temp=(struct List *) malloc(sizeof(struct List));     if(temp == NULL)         printf("\nNo sufficient Memory");     else     {         printf("Enter Value: ");         scanf("%d",&temp->no);         temp->next=NULL;         if(start == NULL)             start=temp;         else         {             link=start;             while(link->next!=NULL)             {                 link=link->next;             }             link->next=temp;         }         printf("\nItem is Inserted at Last");     } } void delet() {     if(start==NULL)         printf("\nList is Empty");     else if(start->next==NULL)     {         printf("\nThe Deleted Item is:");         printf("\n  %d",start->no);         free(start);         start=NULL;     }     else     {         temp=start;         start=start->next;         printf("\nThe Deleted Item is:");         printf("\n  %d",temp->no);         free(temp);     } } void view() {     if(start==NULL)         printf("\nList is Empty");     else     {         printf("\nThe List is:");         link=start;         while(link!=NULL)         {             printf("\n  %d",link->no);             link=link->next;         }     } } void main() {     int ch,value,i;     clrscr();     do     {         do         {             clrscr();             printf("\n1. Insert\n2. Delete \n3. View\n4. Exit");             printf("\nEnter Your Choice: ");             scanf("%d",&ch);         }while(ch<1>4);         switch(ch)         {             case 1:                 insert();                 getch();                 break;             case 2:                 delet();                 getch();                 break;             case 3:                 view();                 getch();         }     }while(ch!=4); }  //(c) Write a program to create a sorted singly linked list.  //Sorting in Linked-List #include struct list {     int no;     struct list *next; }*start=NULL,*link=NULL,*temp=NULL; void create() {     temp=(struct list *) malloc(sizeof(struct list));     if(temp==NULL)         printf("\nNo sufficient Memory !!!");     else     {         printf("Enter No.: ");         scanf("%d",&temp->no);         temp->next=NULL;         if(start==NULL)         {             start=temp;         }         else         {             link=start;             while(link->next!=NULL)             {                 link=link->next;             }             link->next=temp;         }     } } void asort(int n) {     for(;n>0;n--)     {         link=start;         while(link->next!=NULL)         {             if(link->no > link->next->no)             {                 link->no = link->no + link->next->no;                 link->next->no = link->no - link->next->no;                 link->no = link->no - link->next->no;             }             link=link->next;         }     } } void dsort(int n) {     for(;n>0;n--)     {         link=start;         while(link->next!=NULL)         {             if(link->no <>next->no)             {                 link->no = link->no + link->next->no;                 link->next->no = link->no - link->next->no;                 link->no = link->no - link->next->no;             }             link=link->next;         }     } } void trav() {     link=start;     while(link!=NULL)     {         printf("  %d",link->no);         link=link->next;     } } void main() {     int n,i;     clrscr();     do     {         printf("How many nodes you want to create? ");         scanf("%d",&n);     }while(n<0); i="0;i struct list {     int no;     struct list *next; }*start=NULL,*link=NULL,*temp=NULL; void create(int *p,int n) {     int i;     for(i=0;ino=*(p+i);             temp->next=NULL;             if(start==NULL)             {                 start=temp;             }             else             {                 link=start;                 while(link->next!=NULL)                 {                     link=link->next;                 }                 link->next=temp;             }         }     } } void trav() {     if(start==NULL)         printf("\nLinked-List is Empty");     else     {         printf("The Linked-List is:\n");         link=start;         while(link!=NULL)         {             printf("  %d",link->no);             link=link->next;         }     } } void main() {     int n,i;     int *p;     clrscr();     do     {         printf("How many elements you want to insert in Array? ");         scanf("%d",&n);     }while(n<0); p="(int" i="0;i struct List {     int no;     struct List *next; }*L1start=NULL,*L2start=NULL,*link=NULL,*temp=NULL; void insert(int l) {     temp=(struct List *) malloc(sizeof(struct List));     if(temp == NULL)         printf("\nNo Sufficient Memory!!!");     else     {         printf("\nEnter ID: ");         scanf("%d",&temp->no);         temp->next=NULL;         if(l==1)         {             if(L1start==NULL)                 L1start=temp;             else             {                 link=L1start;                 while(link->next!=NULL)                     link=link->next;                 link->next=temp;             }             printf("\nNode is Inserted at Last in List1");         }         else         {             if(L2start==NULL)                 L2start=temp;             else             {                 link=L2start;                 while(link->next!=NULL)                     link=link->next;                 link->next=temp;             }             printf("\nNode is Inserted at Last in List2");         }     } } void delet(int l) {     if(l==1)     {         if(L1start==NULL)             printf("\nLinked-List1 is Empty");         else         {             link=L1start;             while(link->next!=NULL)             {                 temp=link;                 link=link->next;             }             printf("\nDeleted Item is:  %d",link->no);             if(link==L1start)                 L1start=NULL;             else                 temp->next=NULL;             free(link);             printf("\nLast Node is Deleted from List1");         }     }     else     {         if(L2start==NULL)             printf("\nLinked-List2 is Empty");         else         {             link=L2start;             while(link->next!=NULL)             {                 temp=link;                 link=link->next;             }             printf("\nDeleted Item is:  %d",link->no);             if(link==L2start)                 L2start=NULL;             else                 temp->next=NULL;             free(link);             printf("\nLast Node is Deleted from List2");         }     } } void traverse() {     if(L1start==NULL)         printf("\nLinked-List1 is Empty");     else     {         link=L1start;         printf("\nLinked-List1: ");         while(link!=NULL)         {             printf("  %d",link->no);             link=link->next;         }     }     if(L2start==NULL)         printf("\nLinked-List2 is Empty");     else     {         link=L2start;         printf("\nLinked-List2: ");         while(link!=NULL)         {             printf("  %d",link->no);             link=link->next;         }     } } void concate(int t) {     struct List *trav=NULL;     if(t==1)     {         link=L2start;         while(link!=NULL)         {             temp=(struct List *) malloc(sizeof(struct List));             if(temp == NULL)                 printf("\nNo Sufficient Memory!!!");             else             {                 temp->no=link->no;                 temp->next=NULL;                 if(L1start==NULL)                     L1start=temp;                 else                 {                     trav=L1start;                     while(trav->next!=NULL)                         trav=trav->next;                     trav->next=temp;                 }             }             link=link->next;         }     }     else     {         link=L1start;         while(link!=NULL)         {             temp=(struct List *) malloc(sizeof(struct List));             if(temp == NULL)                 printf("\nNo Sufficient Memory!!!");             else             {                 temp->no=link->no;                 temp->next=NULL;                 if(L2start==NULL)                     L2start=temp;                 else                 {                     trav=L2start;                     while(trav->next!=NULL)                         trav=trav->next;                     trav->next=temp;                 }             }             link=link->next;         }     }     traverse(); } void Union() {     struct List *unionfst=NULL,*trav=NULL;     if(L1start!=NULL)     {         link=L1start;         while(link!=NULL)         {             temp=(struct List *) malloc(sizeof(struct List));             if(temp == NULL)                 printf("\nNo Sufficient Memory!!!");             else             {                 temp->no=link->no;                 temp->next=NULL;                 if(unionfst==NULL)                     unionfst=temp;                 else                 {                     trav=unionfst;                     while(trav->next!=NULL)                     {                         if(trav->no!=temp->no)                             trav=trav->next;                         else                             break;                     }                     if(trav->next==NULL && trav->no!=temp->no)                         trav->next=temp;                 }             }             link=link->next;         }     }     if(L2start!=NULL)     {         link=L2start;         while(link!=NULL)         {             temp=(struct List *) malloc(sizeof(struct List));             if(temp == NULL)                 printf("\nNo Sufficient Memory!!!");             else             {                 temp->no=link->no;                 temp->next=NULL;                 if(unionfst==NULL)                     unionfst=temp;                 else                 {                     trav=unionfst;                     while(trav->next!=NULL)                     {                         if(trav->no!=temp->no)                             trav=trav->next;                         else                             break;                     }                     if(trav->next==NULL && trav->no!=temp->no)                         trav->next=temp;                 }             }             link=link->next;         }     }     if(unionfst==NULL)         printf("\nUnion of Both Linked-List is Empty");     else     {         link=unionfst;         printf("\nUnion of Both Linked-List: ");         while(link!=NULL)         {             printf("  %d",link->no);             link=link->next;         }     } } void intersect() {     struct List *interfst=NULL,*trav1=NULL,*trav2=NULL;     if(L1start!=NULL && L2start!=NULL)     {         link=L1start;         while(link!=NULL)         {             trav1=L2start;             while(trav1!=NULL)             {                 if(link->no==trav1->no)                 {                     temp=(struct List *) malloc(sizeof(struct List));                     if(temp == NULL)                         printf("\nNo Sufficient Memory!!!");                     else                     {                         temp->no=link->no;                         temp->next=NULL;                         if(interfst==NULL)                             interfst=temp;                         else                         {                             trav2=interfst;                             while(trav2->next!=NULL)                             {                                 if(trav2->no!=temp->no)                                     trav2=trav2->next;                                 else                                     break;                             }                             if(trav2->next==NULL && trav2->no!=temp->no)                                 trav2->next=temp;                         }                     }                     break;                 }                 else                     trav1=trav1->next;             }             link=link->next;         }     }     if(interfst==NULL)         printf("\nIntersection of Both Linked-List is Empty");     else     {         link=interfst;         printf("\nIntersection of Both Linked-List: ");         while(link!=NULL)         {             printf("  %d",link->no);             link=link->next;         }     } } int choice() {     int L;     do     {         printf("You want perform the operation on\n");         printf("1. List1\n2. List2\nEnter Your Chice: ");         scanf("%d",&L);     }while(L<1>2);     return L; } void main() {     int ch,v,t;     do     {    do         {    clrscr();             printf("\n1. Insert\n2. Delete\n3. Concatenation\n4. Union");             printf("\n5. Intersection\n6. Traversal\n7. Exit");             printf("\nEnter Your Choice: ");             scanf("%d",&ch);         }while(ch<1>7);         switch(ch)         {    case 1:                 insert(choice());                 getch();                 break;             case 2:                  delet(choice());                 getch();                 break;             case 3:                 do                 {                     printf("Concate\n");                     printf("1. List1 before List2\n2. List2 before List1");                     printf("\nEnter Your Chice: ");                     scanf("%d",&t);                 }while(t<1>2);                 concate(t);                 getch();                 break;             case 4:                 Union();                 getch();                 break;             case 5:                 intersect();                 getch();                 break;             case 6:                 traverse();                 getch();                 break;         }     }while(ch!=7); } //Perform some Operations on Singly Linked-List #include struct List {     int no;     struct List *next; }*start=NULL,*link=NULL,*temp=NULL; void insert() {     temp=(struct List *) malloc(sizeof(struct List));     if(temp == NULL)         printf("\nNo Sufficient Memory!!!");     else     {         printf("\nEnter ID: ");         scanf("%d",&temp->no);         temp->next=NULL;         if(start==NULL)             start=temp;         else         {             link=start;             while(link->next!=NULL)                 link=link->next;             link->next=temp;         }         printf("\nNode is Inserted at Last");     } } void delet() {     if(start==NULL)         printf("\nLinked-List is Empty");     else     {         link=start;         while(link->next!=NULL)         {             temp=link;             link=link->next;         }         printf("\nDeleted Item is:  %d",link->no);         if(link==start)             start=NULL;         else             temp->next=NULL;         free(link);         printf("\nLast Node is Deleted");     } } void sum() {     if(start==NULL)         printf("\nLinked-List is Empty");     else     {         int s=0;         link=start;         while(link!=NULL)         {             s=s+link->no;             link=link->next;         }         printf("\nSum of Elements of the List is %d",s);     } } void count_node() {     int n=0;     link=start;     while(link!=NULL)     {         n++;         link=link->next;     }     printf("\nTotal no. of nodes in the List are %d",n); } void search(int val) {     if(start==NULL)         printf("\nLinked-List is Empty");     else     {         link=start;         while(link!=NULL)         {             if(link->no==val)             {                 printf("\nThe Number is Exist in the List");                 break;             }             link=link->next;         }         if(link==NULL)             printf("\nThe Number is not Exist in the List");     } } void reverse_LL() {     struct List *fst,*trav=NULL;     if(start==NULL)     {         printf("\nLinked-List is Empty");         return;     }     else    if(start->next!=NULL)     {         fst=link=start;         start=NULL;         while(link->next!=NULL)         {             while(link->next->next!=NULL)             {                 link=link->next;             }             if(start==NULL)             {                 start=link->next;                 link->next=NULL;             }             else             {                 trav=start;                 while(trav->next!=NULL)                     trav=trav->next;                 trav->next=link->next;                 link->next=NULL;             }             link=fst;         }         if(trav!=NULL)         {             trav->next->next=fst;             fst->next=NULL;         }         else         {             start->next=link;             link->next=NULL;         }     }     printf("\nLinked-List is Reversed");     link=start;     printf("\nLinked-List: ");     while(link!=NULL)     {         printf("  %d",link->no);         link=link->next;     } } void copy_LL() {     struct List *first=NULL,*trav=NULL;     if(start==NULL)         printf("\nLinked-List is Empty");     else     {         link=start;         while(link!=NULL)         {             temp=(struct List *) malloc(sizeof(struct List));             if(temp == NULL)             {    printf("\nNo Sufficient Memory!!!");                 break;             }             else             {                 temp->no=link->no;                 temp->next=NULL;                 if(first==NULL)                     first=temp;                 else                 {                     trav=first;                     while(trav->next!=NULL)                         trav=trav->next;                     trav->next=temp;                 }             }             link=link->next;         }         printf("\nLinked-List is copied");         trav=first;         while(trav!=NULL)         {             printf("\n%d",trav->no);             temp=trav;             trav=trav->next;             free(temp);         }     } } void traverse() {     if(start==NULL)         printf("\nLinked-List is Empty");     else     {         link=start;         printf("\nLinked-List: ");         while(link!=NULL)         {             printf("  %d",link->no);             link=link->next;         }     } } void main() {     int ch,v;     do     {    do         {    clrscr();             printf("\n1. Insert\n2. Delete\n3. Sum of elements of the List");             printf("\n4. No. of Nodes\n5. Searching\n");             printf("6. Reverse the List\n7. Copy the List");             printf("\n8. Traversal\n9. Exit");             printf("\nEnter Your Choice: ");             scanf("%d",&ch);         }while(ch<1>9);         switch(ch)         {    case 1:                 insert();                 getch();                 break;             case 2:                 delet();                 getch();                 break;             case 3:                 sum();                 getch();                 break;             case 4:                 count_node();                 getch();                 break;             case 5:                 printf("Enter the Value: ");                 scanf("%d",&v);                 search(v);                 getch();                 break;             case 6:                 reverse_LL();                 getch();                 break;             case 7:                 copy_LL();                 getch();                 break;             case 8:                 traverse();                 getch();         }     }while(ch!=9); }  

//Add Two Polynomial Equation #include struct pol_eq {     int coef,exp;     struct pol_eq *next; }*fst1=NULL,*fst2=NULL,*link=NULL,*temp=NULL; int insert(int e) {     int pre_ex=10,co,ex;     do     {         printf("Enter Co-efficient: ");         scanf("%d",&co);         printf("Enter Exponent: ");         scanf("%d",&ex);         if(pre_ex>ex)         {             if(co!=0)             {                 pre_ex=ex;                 temp=(struct pol_eq *) malloc(sizeof(struct pol_eq));                 if(temp == NULL)                     printf("\nNo sufficient Memory");                 else                 {                     temp->coef=co;                     temp->exp=ex;                     temp->next=NULL;                     if(e==1)                     {                         if(fst1 == NULL)                             fst1=temp;                         else                         {                             link=fst1;                             while(link->next!=NULL)                             {                                 link=link->next;                             }                             link->next=temp;                         }                     }                     else if(e==2)                     {                         if(fst2 == NULL)                             fst2=temp;                         else                         {                             link=fst2;                             while(link->next!=NULL)                             {                                 link=link->next;                             }                             link->next=temp;                         }                     }                 }             }         }         else         {             if(e==1)             {                 if(fst1!=NULL)                 {                     while(fst1->next!=NULL)                     {                         link=fst1;                         fst1=fst1->next;                         free(link);                     }                     free(fst1);                     fst1=NULL;                 }             }             else if(e==2)             {                 if(fst2!=NULL)                 {                     while(fst2->next!=NULL)                     {                         link=fst2;                         fst1=fst1->next;                         free(link);                     }                     free(fst2);                     fst2=NULL;                 }             }             return 0;         }     }while(ex>0);     return 1; } void show(int e) {     if(e==1)     {         if(fst1==NULL)             printf("\nFirst Equation is 0");         else         {             printf("\nThe First Equation: ");             if(fst1->coef > 1)                 printf(" %d",fst1->coef);             else if(fst1->coef < -1)                 printf("- %d",fst1->coef * -1);             else if(fst2->coef == 1)                 printf("+ ");             else if(fst2->coef == -1)                 printf("- ");             if(fst1->exp != 1 && fst1->exp != 0)                 printf("x^%d ",fst1->exp);             else if(fst1->exp == 1)                 printf("x ");             link=fst1->next;             while(link!=NULL)             {                 if(link->coef > 1)                     printf("+ %d",link->coef);                 else if(link->coef < -1)                     printf("- %d",link->coef * -1);                 else if(link->coef == 1)                     printf("+ ");                 else if(link->coef == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");                 link=link->next;             }         }     }     else if(e==2)     {         if(fst2==NULL)             printf("\nSecond Equation is 0");         else         {             printf("\nThe Second Equation: ");             if(fst2->coef > 1)                 printf(" %d",fst2->coef);             else if(fst2->coef < -1)                 printf("- %d",fst2->coef * -1);             else if(fst2->coef == 1)                 printf("+ ");             else if(fst2->coef == -1)                 printf("- ");             if(fst2->exp != 1 && fst2->exp != 0)                 printf("x^%d ",fst2->exp);             else if(fst2->exp == 1)                 printf("x ");             link=fst2->next;             while(link!=NULL)             {                 if(link->coef > 1)                     printf("+ %d",link->coef);                 else if(link->coef < -1)                     printf("- %d",link->coef * -1);                 else if(link->coef == 1)                     printf("+ ");                 else if(link->coef == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");                 link=link->next;             }         }     } } void add() {     int c;     link=fst1;     temp=fst2;     printf("\nThe Addition: ");     while(link!=NULL && temp!=NULL)     {         if(link->exp == temp->exp)         {             c=link->coef + temp->coef;             if(c != 0)             {                 if(c > 1)                     printf("+ %d",c);                 else if(c < -1)                     printf("- %d",c * -1);                 else if(c == 1)                     printf("+ ");                 else if(c == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");             }             link=link->next;             temp=temp->next;         }         else if(link->exp > temp->exp)         {             if(link->coef > 1)                 printf("+ %d",link->coef);             else if(link->coef < -1)                 printf("- %d",link->coef * -1);             else if(link->coef == 1)                 printf("+ ");             else if(link->coef == -1)                 printf("- ");             if(link->exp != 1 && link->exp != 0)                 printf("x^%d ",link->exp);             else if(link->exp == 1)                 printf("x ");             link=link->next;         }         else         {             if(temp->coef > 1)                 printf("+ %d",temp->coef);             else if(temp->coef < -1)                 printf("- %d",temp->coef * -1);             else if(temp->coef == 1)                 printf("+ ");             else if(temp->coef == -1)                 printf("- ");             if(temp->exp != 1 && temp->exp != 0)                 printf("x^%d ",temp->exp);             else if(temp->exp == 1)                 printf("x ");             temp=temp->next;         }     }     if(link!=NULL)     {         while(link !=NULL)         {             if(link->coef > 1)                 printf("+ %d",link->coef);             else if(link->coef < -1)                 printf("- %d",link->coef * -1);             else if(link->coef == 1)                 printf("+ ");             else if(link->coef == -1)                 printf("- ");             if(link->exp != 1 && link->exp != 0)                 printf("x^%d ",link->exp);             else if(link->exp == 1)                 printf("x ");             link=link->next;         }     }     else     {         while(temp != NULL)         {             if(temp->coef > 1)                 printf("+ %d",temp->coef);             else if(temp->coef < -1)                 printf("- %d",temp->coef * -1);             else if(temp->coef == 1)                 printf("+ ");             else if(temp->coef == -1)                 printf("- ");             if(temp->exp != 1 && temp->exp != 0)                 printf("x^%d ",temp->exp);             else if(temp->exp == 1)                 printf("x ");             temp=temp->next;         }     } } void main() {     int a;     clrscr();     do     {         a=insert(1);         if(a==0)         {             printf("Invalid Equation\n");             getch();             clrscr();         }     }while(a==0);     printf("First Equation is Inserted\n");     getch();     clrscr();     do     {         a=insert(2);         if(a==0)         {             printf("Invalid Equation\n");             getch();             clrscr();         }     }while(a==0);     printf("Second Equation is Inserted\n");     getch();     clrscr();     show(1);     show(2);     add();     getch(); } 

//Subtract Two Polynomial Equation #include struct pol_eq {     int coef,exp;     struct pol_eq *next; }*fst1=NULL,*fst2=NULL,*link=NULL,*temp=NULL; int insert(int e) {     int pre_ex=10,co,ex;     do     {         printf("Enter Co-efficient: ");         scanf("%d",&co);         printf("Enter Exponent: ");         scanf("%d",&ex);         if(pre_ex>ex)         {             if(co!=0)             {                 pre_ex=ex;                 temp=(struct pol_eq *) malloc(sizeof(struct pol_eq));                 if(temp == NULL)                     printf("\nNo sufficient Memory");                 else                 {                     temp->coef=co;                     temp->exp=ex;                     temp->next=NULL;                     if(e==1)                     {                         if(fst1 == NULL)                             fst1=temp;                         else                         {                             link=fst1;                             while(link->next!=NULL)                             {                                 link=link->next;                             }                             link->next=temp;                         }                     }                     else if(e==2)                     {                         if(fst2 == NULL)                             fst2=temp;                         else                         {                             link=fst2;                             while(link->next!=NULL)                             {                                 link=link->next;                             }                             link->next=temp;                         }                     }                 }             }         }         else         {             if(e==1)             {                 if(fst1!=NULL)                 {                     while(fst1->next!=NULL)                     {                         link=fst1;                         fst1=fst1->next;                         free(link);                     }                     free(fst1);                     fst1=NULL;                 }             }             else if(e==2)             {                 if(fst2!=NULL)                 {                     while(fst2->next!=NULL)                     {                         link=fst2;                         fst1=fst1->next;                         free(link);                     }                     free(fst2);                     fst2=NULL;                 }             }             return 0;         }     }while(ex>0);     return 1; } void show(int e) {     if(e==1)     {         if(fst1==NULL)             printf("\nFirst Equation is 0");         else         {             printf("\nThe First Equation: ");             if(fst1->coef > 1)                 printf(" %d",fst1->coef);             else if(fst1->coef < -1)                 printf("- %d",fst1->coef * -1);             else if(fst2->coef == 1)                 printf("+ ");             else if(fst2->coef == -1)                 printf("- ");             if(fst1->exp != 1 && fst1->exp != 0)                 printf("x^%d ",fst1->exp);             else if(fst1->exp == 1)                 printf("x ");             link=fst1->next;             while(link!=NULL)             {                 if(link->coef > 1)                     printf("+ %d",link->coef);                 else if(link->coef < -1)                     printf("- %d",link->coef * -1);                 else if(link->coef == 1)                     printf("+ ");                 else if(link->coef == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");                 link=link->next;             }         }     }     else if(e==2)     {         if(fst2==NULL)             printf("\nSecond Equation is 0");         else         {             printf("\nThe Second Equation: ");             if(fst2->coef > 1)                 printf(" %d",fst2->coef);             else if(fst2->coef < -1)                 printf("- %d",fst2->coef * -1);             else if(fst2->coef == 1)                 printf("+ ");             else if(fst2->coef == -1)                 printf("- ");             if(fst2->exp != 1 && fst2->exp != 0)                 printf("x^%d ",fst2->exp);             else if(fst2->exp == 1)                 printf("x ");             link=fst2->next;             while(link!=NULL)             {                 if(link->coef > 1)                     printf("+ %d",link->coef);                 else if(link->coef < -1)                     printf("- %d",link->coef * -1);                 else if(link->coef == 1)                     printf("+ ");                 else if(link->coef == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");                 link=link->next;             }         }     } } void subtract() {     int c;     link=fst1;     temp=fst2;     printf("\nThe Addition: ");     while(link!=NULL && temp!=NULL)     {         if(link->exp == temp->exp)         {             c=link->coef - temp->coef;             if(c != 0)             {                 if(c > 1)                     printf("+ %d",c);                 else if(c < -1)                     printf("- %d",c * -1);                 else if(c == 1)                     printf("+ ");                 else if(c == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");             }             link=link->next;             temp=temp->next;         }         else if(link->exp > temp->exp)         {             if(link->coef > 1)                 printf("+ %d",link->coef);             else if(link->coef < -1)                 printf("- %d",link->coef * -1);             else if(link->coef == 1)                 printf("+ ");             else if(link->coef == -1)                 printf("- ");             if(link->exp != 1 && link->exp != 0)                 printf("x^%d ",link->exp);             else if(link->exp == 1)                 printf("x ");             link=link->next;         }         else         {             if(temp->coef > 1)                 printf("+ %d",temp->coef);             else if(temp->coef < -1)                 printf("- %d",temp->coef * -1);             else if(temp->coef == 1)                 printf("+ ");             else if(temp->coef == -1)                 printf("- ");             if(temp->exp != 1 && temp->exp != 0)                 printf("x^%d ",temp->exp);             else if(temp->exp == 1)                 printf("x ");             temp=temp->next;         }     }     if(link!=NULL)     {         while(link !=NULL)         {             if(link->coef > 1)                 printf("+ %d",link->coef);             else if(link->coef < -1)                 printf("- %d",link->coef * -1);             else if(link->coef == 1)                 printf("+ ");             else if(link->coef == -1)                 printf("- ");             if(link->exp != 1 && link->exp != 0)                 printf("x^%d ",link->exp);             else if(link->exp == 1)                 printf("x ");             link=link->next;         }     }     else     {         while(temp != NULL)         {             if(temp->coef > 1)                 printf("+ %d",temp->coef);             else if(temp->coef < -1)                 printf("- %d",temp->coef * -1);             else if(temp->coef == 1)                 printf("+ ");             else if(temp->coef == -1)                 printf("- ");             if(temp->exp != 1 && temp->exp != 0)                 printf("x^%d ",temp->exp);             else if(temp->exp == 1)                 printf("x ");             temp=temp->next;         }     } } void main() {     int a;     clrscr();     do     {         a=insert(1);         if(a==0)         {             printf("Invalid Equation\n");             getch();             clrscr();         }     }while(a==0);     printf("First Equation is Inserted\n");     getch();     clrscr();     do     {         a=insert(2);         if(a==0)         {             printf("Invalid Equation\n");             getch();             clrscr();         }     }while(a==0);     printf("Second Equation is Inserted\n");     getch();     clrscr();     show(1);     show(2);     subtract();     getch(); } 

//Write a Program to Multiply Two Polynomials in two variables #include #include #include #include struct polymulti {     char sign;     int coeff;     int expo;     struct polymulti *next; }*temp=NULL,*first1=NULL,*first2=NULL,*first3=NULL,*trav1=NULL,*trav2=NULL;  struct polymulti * insert(struct polymulti *fst) {     int node,i;     clrscr();     printf("\nenter total node:");     scanf("%d",&node);     for(i=0;isign);         printf("\nenter coefficienct:");         scanf("%d",&temp->coeff);         printf("\nenter exponent:");         scanf("%d",&temp->expo);         temp->next=NULL;         if(fst==NULL)         {              fst=temp;              trav1=temp;         }         else         {             trav1=fst;             while(trav1->next!=NULL)                 trav1=trav1->next;             trav1->next=temp;             temp->next=NULL;         }      }      return fst; } void display(struct polymulti *fst) {     struct polymulti *trv;     trv=fst;      while(trv!=NULL)      {         if(trv->expo==0)             printf("%c %d",trv->sign,trv->coeff);         else             printf("%c %d%c^%d ",trv->sign,trv->coeff,'x',trv->expo);         trv=trv->next;      }      printf("\n"); } void multiplication() {     int n1,n2;     struct polymulti *trv;     n1=1;     n2=1;     trav1=first1;     trav2=first2;     if(trav1==NULL && trav2==NULL)     {         printf("\nlist does't exist");     }     else     {         while(trav1!=NULL && trav2!=NULL)         {             temp=(struct polymulti *)malloc(sizeof(struct polymulti));             temp->next=NULL;             if((trav1->sign=='-' && trav2->sign=='-')||(trav1->sign=='+' && trav2->sign=='+'))             {                 temp->sign='+';                 temp->coeff=trav1->coeff*trav2->coeff;                 temp->expo=trav1->expo+trav2->expo;             }             else             {                 temp->sign='-';                 temp->coeff=trav1->coeff*trav2->coeff;                 temp->expo=trav1->expo+trav2->expo;             }             if(first3==NULL)             {                 first3=temp;                 trv=temp;             }             else             {                 trv=first3;                 while(trv->next!=NULL)                 {                     trv=trv->next;                 }                 trv->next=temp;                 temp->next=NULL;             }             trav1=trav1->next;             trav2=trav2->next;            }            if(trav1==NULL)            {              while(trav2!=NULL)              {             temp=(struct polymulti *)malloc(sizeof(struct polymulti));             temp->sign=trav2->sign;             temp->coeff=trav2->coeff;             temp->expo=trav2->expo;             temp->next=NULL;             trv=first3;             while(trv->next!=NULL)             {                 trv=trv->next;             }             trv->next=temp;             temp->next=NULL;             trav2=trav2->next;              }            }           else if(trav2==NULL)            {              while(trav1!=NULL)              {             temp=(struct polymulti *)malloc(sizeof(struct polymulti));             temp->sign=trav1->sign;             temp->coeff=trav1->coeff;             temp->expo=trav1->expo;             temp->next=NULL;             trv=first3;             while(trv->next!=NULL)             {                 trv=trv->next;             }             trv->next=temp;             temp->next=NULL;             trav1=trav1->next;              }            }           display(first3);      } } void main() {     clrscr();     first1=insert(first1);     display(first1);     first2=insert(first2);     display(first1);     display(first2);     multiplication();     getch(); } 

//Multiply Two Polynomial Equation #include struct pol_eq {     int coef,exp;     struct pol_eq *next; }*fst1=NULL,*fst2=NULL,*link=NULL,*temp=NULL; int insert(int e) {     int pre_ex=10,co,ex;     do     {         printf("Enter Co-efficient: ");         scanf("%d",&co);         printf("Enter Exponent: ");         scanf("%d",&ex);         if(pre_ex>ex)         {             if(co!=0)             {                 pre_ex=ex;                 temp=(struct pol_eq *) malloc(sizeof(struct pol_eq));                 if(temp == NULL)                     printf("\nNo sufficient Memory");                 else                 {                     temp->coef=co;                     temp->exp=ex;                     temp->next=NULL;                     if(e==1)                     {                         if(fst1 == NULL)                             fst1=temp;                         else                         {                             link=fst1;                             while(link->next!=NULL)                             {                                 link=link->next;                             }                             link->next=temp;                         }                     }                     else if(e==2)                     {                         if(fst2 == NULL)                             fst2=temp;                         else                         {                             link=fst2;                             while(link->next!=NULL)                             {                                 link=link->next;                             }                             link->next=temp;                         }                     }                 }             }         }         else         {             if(e==1)             {                 if(fst1!=NULL)                 {                     while(fst1->next!=NULL)                     {                         link=fst1;                         fst1=fst1->next;                         free(link);                     }                     free(fst1);                     fst1=NULL;                 }             }             else if(e==2)             {                 if(fst2!=NULL)                 {                     while(fst2->next!=NULL)                     {                         link=fst2;                         fst1=fst1->next;                         free(link);                     }                     free(fst2);                     fst2=NULL;                 }             }             return 0;         }     }while(ex>0);     return 1; } void show(int e) {     if(e==1)     {         if(fst1==NULL)             printf("\nFirst Equation is 0");         else         {             printf("\nThe First Equation: ");             if(fst1->coef > 1)                 printf(" %d",fst1->coef);             else if(fst1->coef < -1)                 printf("- %d",fst1->coef * -1);             else if(fst2->coef == 1)                 printf("+ ");             else if(fst2->coef == -1)                 printf("- ");             if(fst1->exp != 1 && fst1->exp != 0)                 printf("x^%d ",fst1->exp);             else if(fst1->exp == 1)                 printf("x ");             link=fst1->next;             while(link!=NULL)             {                 if(link->coef > 1)                     printf("+ %d",link->coef);                 else if(link->coef < -1)                     printf("- %d",link->coef * -1);                 else if(link->coef == 1)                     printf("+ ");                 else if(link->coef == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");                 link=link->next;             }         }     }     else if(e==2)     {         if(fst2==NULL)             printf("\nSecond Equation is 0");         else         {             printf("\nThe Second Equation: ");             if(fst2->coef > 1)                 printf(" %d",fst2->coef);             else if(fst2->coef < -1)                 printf("- %d",fst2->coef * -1);             else if(fst2->coef == 1)                 printf("+ ");             else if(fst2->coef == -1)                 printf("- ");             if(fst2->exp != 1 && fst2->exp != 0)                 printf("x^%d ",fst2->exp);             else if(fst2->exp == 1)                 printf("x ");             link=fst2->next;             while(link!=NULL)             {                 if(link->coef > 1)                     printf("+ %d",link->coef);                 else if(link->coef < -1)                     printf("- %d",link->coef * -1);                 else if(link->coef == 1)                     printf("+ ");                 else if(link->coef == -1)                     printf("- ");                 if(link->exp != 1 && link->exp != 0)                     printf("x^%d ",link->exp);                 else if(link->exp == 1)                     printf("x ");                 link=link->next;             }         }     } } void mul() {     struct pol_eq *start=NULL,*link2=NULL,*link3=NULL;     int c,e;     link=fst1;     while(link!=NULL)     {         link2=fst2;         while(link2 != NULL)         {             c=link->coef * link2->coef;             e=link->exp + link2->exp;             if(start==NULL)             {                 temp=(struct pol_eq *) malloc(sizeof(struct pol_eq));                 if(temp == NULL)                     printf("\nNo sufficient Memory");                 else                 {                     temp->coef=c;                     temp->exp=e;                     temp->next=NULL;                     start=temp;                 }             }             else             {                 link3=start;                 while(link3->next!=NULL)                 {                     if(link3->exp == e)                     {                         link3->coef +=c;                         break;                     }                     else                         link3=link3->next;                 }                 if(link3->next == NULL && link3->exp == e)                 {                     link3->coef +=c;                 }                 else if(link3->next == NULL && link3->exp != e)                 {                     temp=(struct pol_eq *) malloc(sizeof(struct pol_eq));                     if(temp == NULL)                         printf("\nNo sufficient Memory");                     else                     {                         temp->coef=c;                         temp->exp=e;                         temp->next=NULL;                         link3=start;                         while(link3->next!=NULL && link3->next->exp > e)                         {                             link3=link3->next;                         }                         temp->next=link3->next;                         link3->next=temp;                     }                 }             }             link2=link2->next;         }         link = link->next;     }     printf("\n\nThe Multiplication: ");     link=start;     while(link!=NULL)     {         if(link->coef > 1)             printf("+ %d",link->coef);         else if(link->coef < -1)             printf("- %d",link->coef * -1);         else if(link->coef == 1)             printf("+ ");         else if(link->coef == -1)             printf("- ");         if(link->exp != 1 && link->exp != 0)             printf("x^%d ",link->exp);         else if(link->exp == 1)             printf("x ");         link=link->next;     } } void main() {     int a;     clrscr();     do     {         a=insert(1);         if(a==0)         {             printf("Invalid Equation\n");             getch();             clrscr();         }     }while(a==0);     printf("First Equation is Inserted\n");     getch();     clrscr();     do     {         a=insert(2);         if(a==0)         {             printf("Invalid Equation\n");             getch();             clrscr();         }     }while(a==0);     printf("Second Equation is Inserted\n");     getch();     clrscr();     show(1);     show(2);     mul();     getch(); }