Inventory Management System Design with Data Structures and Algorithms

This report details the design of an inventory management system, focusing on the application of data structures and algorithms to efficiently manage household and food items. The system utilizes a database with various data types, keys, and ranges to store product information, including IDs, names, prices, and manufacturers. Operations such as insertion, deletion, sorting, and searching are implemented using algorithms like bubble sort and binary search to ensure optimal performance. The report also addresses system scalability, suggesting the use of merge sort and binary search for handling a larger volume of items after a business collaboration. The design emphasizes the importance of efficient algorithms and data structures in creating a robust and scalable inventory management system.

Running head: DATA STRUCTURE AND ALGORITHM
DATA STRUCTURE AND ALGORITHM
Name of the Student
Name of the University
Author Note

1DATA STRUCTURE AND ALGORITHM
Table of Contents
Introduction:...............................................................................................................................2
Scenario of the business:............................................................................................................2
Ranges, keys and variables:.......................................................................................................2
Operations needed in the Inventory management:.....................................................................4
The algorithms that are needed for the operations:....................................................................5
Changes needed for the inventory management system:...........................................................7
Conclusion:................................................................................................................................7
Bibliography:..............................................................................................................................8

2DATA STRUCTURE AND ALGORITHM
Introduction:
The purpose of this paper is to design an inventory system for an organisation. The
organisation deal with two types of products such as house hold items and food items. The
paper will focus on the ranges, keys and variables as well as algorithms that will be used for
making the inventory system. This paper will discuss the workings that will be assisted by the
inventory. There are 200 food related items as well as there are 300 household items which
the organisation needs to keep track.
Scenario of the business:
The organisation deal with two types of products such as household items and food
items. There are basically 200 items of food as well as there are 300 house hold related
systems that are needed to be kept as record. The items can be stored with several kind of
information such as type of product, product price, manufacturer of the product. For the food
related items as well as for the items that are related to the house hold. After some times, the
organisation collaborated with another company, both the organisations together were having
around 1500 food related items as well as 25000 household items.
Ranges, keys and variables:
The inventory system will be having a database; the database will be having the
product names as well as some of the other credentials that are needed to be recorded. The
inventory management system will also be having user experiences where the consumers will
be able to do all of the controls. There will be various kinds of keys, ranges as well as
variables in the database, where the ranges are needed to be enough for holding the number
of the products. The variables of the products are needed to be having several data types,
from the data types, the product details will be known. The type of the data will be having a

3DATA STRUCTURE AND ALGORITHM
unique ID, the data type of the ID will be integer type. The data type for the manufacturers of
the product will be varchar. The price of products will be also defined as integer data types.
The product names also seem to the under the varchar data type as the products will be
written as character and lastly the data type for the product manufacturer will be varchar as
the data type. The keys which will be utilized in the management system of inventory, for the
products that will be in the inventory the product ID will be written as the primary key. This
may be taken as one of the identifiers that is unique for every food related item as well as for
the household relate products.
There will be various data types, as there will be various types of the entities for the
food related items as well as same for the house hold related items. For the food related
products, the ID of the products will be having varchar type of product type, data type as
integer, integer type for the price of the products, the manufacturer of the products will be
character so that will be also varchar as the data type. On the other hand, for the house hold
related items. The variables of the products are needed to be having several data types, from
the data types, the product details will be known. The type of the data will be having a unique
ID, the data type of the ID will be an integer. The data type for the products of that will be
manufacturers will be alphanumeric. The price of the products will be also defined as the
integer data types. The product names also seem to the under the varchar data type as the
products will be written as character and lastly the type of data for the manufacturers of the
products will be varchar as the data type.
For the products that are related to the household, there will be having a range for the
variables that are taken in the inventory system. The ranges for the ID that is unique, for the
products the ranges will 20. The range that will be considered for the product names will be
40. The range of variables for the product price will be ten. The range that will be considered
for the manufacturer will be 20 as well as the range that will for the expiry will be twenty. On

4DATA STRUCTURE AND ALGORITHM
the other side the, for the food related items, for the products the ranges will 20. The range
that will be considered for the manufacturer will be 20 as well as the range that will for the
expiry will be 20. The range that will be considered for the product names will be 40. The
price range for the product price will be ten.
Food Items
Variable (Product) Data type Keys Range
ID Integer Primary key 10
Type varchar Not null 20
Name varchar Not null 30
Price integer Not null 20
Manufacturer Varchar Not null 30
Expiry Integer Not null 10
Household items
Variable (Product) Data type Keys Range
ID Integer Primary key 10
Type varchar Not null 20
Name varchar Not null 30
Price Integer Not null 20
Manufacturer varchar Not null 20
Operations needed in the Inventory management:
The management system of inventory will be having all of the items like house hold
related items and the food related items. Various kinds of operations will be supported by the

5DATA STRUCTURE AND ALGORITHM
inventory which will be utilized for storing the items in accord with the prices, types as well
as products. The operations that will be supported by the inventory will be as per following:
 Deleting the items from the entire database, the time when the items will be finished
or when the stocks will be cleared.
 Inserting all of the items in the database in accord with the ID of the product for the
items that are related to house hold and the food related products.
 Sort the items in accord with the ID that is unique for all the products that are present
in the inventory.
 Updating the database when fresh products will arrive in the inventory management
system.
 Search for a specific product in the system by an ID that is unique for all of the
products.
The algorithms that are needed for the operations:
The operations which the inventory may having support will be having various types
of the algorithms that are behind the operations for making the works for the operations
accordingly that too with error free work in the system. For making sort of the products that
are having a unique ID for all of the products, the bubble sort should be used as the
technique. The algorithm is based on the plan in which elements that will be provided as the
input file will be consumed in every repetition for finding the actual position in that the item
elements will be belonging to an array that is sorted. The bubble sort is basically an algorithm
which is on the basis of each of the pairs for all of the elements. The items will be sorted in
accord with the ID that is unique for all of the items. The actual ID that is unique for all of the
products, is needed to be compared with the ID that is adjacent as well as after that the

6DATA STRUCTURE AND ALGORITHM
biggest element will be exchanged. The similar functions are needed to be carried out as well
as after that the items are needed to be sorted in an order that is ascending.
Algorithm for the bubble sort:
Step1: Begin bubblesort (list)
Step 2: For all elements of list
Step 3: If list[i] > list [i+1}
Step 4: Swap (list [i], list [i+1])
Step 5: End if
Step 6: End for
Step 7: Return list
Step 8: End bubblesort.
For the deletion and insertion of the item that are contained in the database of the
management system of inventory, one of the balanced binary tree of searching will be on the
basis of the nodes as well as it will be kept automatically in tiny height which is basically
main face of the products which are arbitrary for the insert and delete of the products. Those
are some of the structures which can provide the implementations which are very much
efficient for the lists that are mutable which are used as well as ordered for the other type of
the data structures like the arrays which are priority queues, associative as well as set.
The searching for the products is one of the most important aspects that is for the
inventory management system. The technique for searching will be utilized that will be
having the ability for searching for the items that are existed in the inventory. The binary
searching technique will be utilized to search the items that are existed in the inventory

7DATA STRUCTURE AND ALGORITHM
management system. In this technique the items will be sorted in two types. In the first part,
all items will be search for as well as then the search will be stopped, if the product will not
be found in the first part then the item will be searched again in the second part. The
algorithm is based on the plan in which elements that will be provided as the input file will be
consumed in every repetition for finding the actual position in that the item elements will be
belonging to an array that is sorted. The bubble sort is basically an algorithm which is on the
basis of each of the pairs for all of the elements. The items will be sorted in accord with the
ID that is unique for all of the items. If the item that is searched for, will not be found in both
the parts then it can be surely said that the product is not existed in the inventory.
Algorithm:
Step 1: set i to 1
Step 2: if i > n then go to step 7
Step 3: if A[i] = x then goes to step 6
Step 5: go to step 2
Step 6: print element x found at index i and then go to step 8
Step 7: print element not found
Step 8: Exit.
Changes needed for the inventory management system:
The organisation has collaborated with one larger organisation. With having together,
the items of the company will be around 25000 of the house hold related products as well as
there will be 1500 food related items in total. There can be existed more of the products that
will be in the inventory, are needed to search by searching and sorting algorithms for search

8DATA STRUCTURE AND ALGORITHM
and sort the items that are existed in the inventory system. The insertion and deletion can be
done in a way that was not done before.
As the algorithm the marge sort can be used. In the worst cases, the products will be
divided into two parts. The technique for searching will be utilized that will be having the
ability for searching for the items that are existed in the inventory. The binary searching
technique will be utilized to search the items that are existed in the inventory management
system. In this technique the items will be sorted in two types. In the first part, all items will
be search for as well as then the search will be stopped, if the product will not be found in the
first part then the item will be searched again in the second part. The algorithm is based on
the plan in which elements that will be provided as the input file will be consumed in every
repetition for finding the actual position in that the item elements will be belonging to an
array that is sorted. The algorithm for the marge sort is as follows:
Step 1: if it is only one element in the record then it is already sorted, return.
Step 2: divide the records into two halves until it cannot be divided.
Step 3: merge the smaller list into a list which is new in the sorted order.
Conclusion:
Thus, it can be concluded from the report that the organisation deal with two types of
products such as food items and house hold items. There are basically 200 food related items
as well as there are 300 house hold related systems that are need to kept as record. The items
can be stored with several kind of information such as type of product, price of the product,
manufacturer of the product. After the collaboration with another company, the items of the
company will be around 25000 of the house hold related products as well as there will be
1500 food related items in total. The above mentioned algorithms will be used for making the
inventory management system.

9DATA STRUCTURE AND ALGORITHM

10DATA STRUCTURE AND ALGORITHM
Bibliography:
Friedman, J. (2018). An algorithm for finding best matches in logarithmic expected time (No.
SLAC-PUB-1549). SLAC National Accelerator Lab., Menlo Park, CA (United States).
Heydari, J., Tajer, A., and Poor, H. V. (2016). Quickest linear search over correlated
sequences. IEEE Transactions on Information Theory, 62(10), 5786-5808.
Marszałek, Z. (2017). Parallelization of modified merge sort algorithm. Symmetry, 9(9), 176.
Min, W. (2010, July). Analysis on bubble sort algorithm optimization. In 2010 International
Forum on Information Technology and Applications (Vol. 1, pp. 208-211). IEEE.
Mohammed, A.S., Amrahov, Ş.E. and Çelebi, F.V., 2017. Bidirectional conditional insertion
sort algorithm; An efficient progress on the classical insertion sort. Future Generation
Computer Systems, 71, pp.102-112.
Mussmann, S. and Liang, P., 2018. Generalized binary search for split-neighborly
problems. arXiv preprint arXiv:1802.09751.
Philipp, P., Tarrataca, L., & Boettcher, S. (2016). Continuous-time quantum search on
balanced trees. Physical Review A, 93(3), 032305.
Rahim, R., Nurarif, S., Ramadhan, M., Aisyah, S. and Purba, W., 2017, December.
Comparison Searching Process of Linear, Binary and Interpolation Algorithm. In J. Phys.
Conf. Ser (Vol. 930, No. 1, p. 012007).
Wild, T., 2017. Best practice in inventory management. Routledge.