Question

you’ll write a program to illustrate how Linked list and structure are used in practice, we’ll develop a program that maintains a database of information about parts stored in a warehouse. The program is built around the database stored in linked list and structures, with each structure containing information - part number, name, and quantity – about one part. • The program tracks parts stored in a warehouse. • Contents of each structure: – Part number – Name – Quantity • Your program should do the following: 1. Add a new part number, part name, and initial quantity on hand (Inserting a node) 2. Given a part number, print the name of the part and the current quantity on hand (search or find) 3. Given a part number, change the quantity on hand (update) 4. Display all information in the database (print) 5. Terminate program execution (quit) • The codes i (insert), s (search or find), u (update), p (print), and q (quit) should be used to represent these operations • Inventory should point to the first node in the list: struct part *inventory = NULL; • The part structure should contain a pointer to the next node: struct part { int number; char name[NAME_LEN+1]; int on_hand; struct part *next; }; • Keep the nodes in the inventory list sorted by part number. • find_part should return a pointer to the node that contains the desired part number. If it doesn’t find the part number, find_part should return a null pointer. Note: Advantages of using a linked list: – No need to put a limit on the size of the database. – The database can easily be kept sorted by part number.

Answer 1

Please find the answer below with single linked list which search, update, print and insert options.

Note: While quitting we have deleted all the node by free.

Program:

#include<stdlib.h>
#include<stdio.h>
#include<string.h>

#define NAME_LEN 35
/* List Structure */
struct part{
   int number;
   char name[NAME_LEN+1];
   int on_hand;
   struct part *next;
};

typedef struct part Part;

Part *head = NULL;   // Head node to keep track of linked list

/* Recursion Function for forward Printing Linked List */
void print(Part *p)
{
   if(p->next != NULL)
   {
      printf("%d %15s %15d\n", p->number, p->name, p->on_hand);
      print(p->next);
   }
   else
   {
      printf("%d %15s %15d\n", p->number, p->name, p->on_hand);
   }
   return;
}
/* read user input */
void userInput(char buffer[], int n)
{

   int ch, i = 0;

   while (isspace(ch = getchar()));

   while (ch != '\n' && ch != EOF) {
      if (i < n)
         buffer[i++] = ch;
      ch = getchar();
   }

   buffer[i] = '\0';
   return;
}

Part * find_part(int pno)
{
   Part *temp = head;

   while(temp != NULL)
   {
      if(pno == temp->number)
      {
         return temp;
      }

      temp = temp->next;
   }
   return NULL;
}
/*same api to search the part and to update the quantity of part number */
void search(int upd_flag )
{
   int pno =0;
   int pqn =0;

   printf("Enter Part Number: ");
   scanf("%d", &pno);
   /* update the quanity of part number */
   if(upd_flag)
   {
      Part *temp = head;

      if(find_part(pno))
      {
         printf("Enter Part quantity to be modified: ");
         scanf("%d", &pqn);

         while(temp != NULL)
         {
            if(pno == temp->number)
            {
               temp->on_hand = pqn;
               printf("Updated the part number Quantity\n");
            }

            temp = temp->next;
         }
      }
      else
      {
         printf("Part number %d not found.\n", pno);
      }
   }
   else
   {
      Part *temp = find_part(pno);
      if (temp)
      {
         printf("Part Number\tPart Name\tQuantity\n");
         printf("%d %15s %15d\n", temp->number, temp->name, temp->on_hand);
      }
      else
      {
        printf("Part number %d not found.\n", pno);
      }
   }

}
/* Function for Inserting nodes in sorted way */
void insert(void )
{
   int pno =0;
   int pqn =0;
   char pname[NAME_LEN+1]= {'\0'};

   printf("Enter Part Number: ");
   scanf("%d", &pno);

   printf("Enter the Quantity: ");
   scanf("%d", &pqn);
   getchar();
   printf("Enter Part Name: ");
   scanf("%[^\n]%*c", pname);

   /* Declaring node */
   Part *temp = (Part*)malloc(sizeof(Part));
   temp->number = pno;
   temp->on_hand = pqn;
   strncpy(temp->name, pname, strlen(pname));
   temp->next = NULL;

    /* Special case for the head end */
    if (head == NULL || head->number >= temp->number)
    {
        temp->next = head;
        head = temp;
    }
    else
    {
        /* insert the partnumber based on sorting. Insert in ascending order */
        Part *temp1 = NULL;
        temp1 = head;

        while (temp1->next!=NULL &&
               temp1->next->number < temp->number)
        {
            temp1 = temp1->next;
        }
        temp->next = temp1->next;
        temp1->next = temp;
    }
}
/* Main method */
int main()
{
   int n =0;
   char buffer[50] = {'\0'};
   for (;;)
   {
      printf("Insert by Part Number: i\n");
      printf("Search by Part Number: s\n");
      printf("Update by Part Number: u\n");
      printf("Print the Inventory details: p\n");
      printf("Quit: q\n");

      printf("Enter operation code: ");
      userInput(buffer,1);

      if(!strncmp(buffer, "s", 1))
      {
         search(0);
      }
      else if(!strncmp(buffer, "i", 1))
      {
         insert();
      }
      else if(!strncmp(buffer, "u", 1))
      {
         search(1);
      }
      else if(!strncmp(buffer, "p", 1))
      {
         printf("Part Number\tPart Name\tQuantity\n");
         print(head);
      }
      else if(!strncmp(buffer, "q", 1))
      {
         printf("Quiting...\n");
         Part *temp = head, *temp1;

         /* delete all node when quitting */
         while(temp != NULL)
         {
            temp1 = temp->next;
            temp = temp->next;
            free(temp1);
         }
         sleep(1);
         return 0;
      }
      else
      {
         printf("Incorrect Input. Try again..\n");
         continue;
      }
   }

   return 0;
}

Output:

USER1>./inventory.exe
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: i
Enter Part Number: 123
Enter the Quantity: 12
Enter Part Name: Net
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: p
Part Number     Part Name       Quantity
123              Net               12
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: i
Enter Part Number: 122
Enter the Quantity: 11
Enter Part Name: Bolt
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: p
Part Number     Part Name       Quantity
122             Bolt               11
123              Net               12
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: s
Enter Part Number: 123
Part Number     Part Name       Quantity
123              Net               12
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: p
Part Number     Part Name       Quantity
122             Bolt               11
123              Net               12
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: u
Enter Part Number: 123
Enter Part quantity to be modified: 178
Updated the part number Quantity
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: p
Part Number     Part Name       Quantity
122             Bolt               11
123              Net              178
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: s
Enter Part Number: 122
Part Number     Part Name       Quantity
122             Bolt               11
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: s
Enter Part Number: 124
Part number 124 not found.
Insert by Part Number: i
Search by Part Number: s
Update by Part Number: u
Print the Inventory details: p
Quit: q
Enter operation code: q
Quiting...
USER1>

Screen Shot: