Data Structure Implementation for an Ice Cube Manufacturing System

This report details the implementation of various data structures to optimize the operations of an ice cube manufacturing company in Singapore. It analyzes three key operations: ordering and delivery, product replenishment, and managing damaged orders. For the ordering and delivery system, a graphical data structure is utilized to manage customer details and delivery routes efficiently, using a spanning tree algorithm to minimize costs and delivery times. Product replenishment employs a hierarchical data structure, organizing data into categories for easy storage and retrieval. The management of damaged orders uses a queue data structure, prioritizing the handling of damaged products based on incoming events and celebrations. Each operation's algorithm is presented in pseudo-code, along with a complexity analysis to evaluate performance. The goal is to demonstrate how appropriate data structure implementation can improve efficiency and resource management in the ice cube manufacturing process. Desklib provides access to this and many other solved assignments.

DATA STRUCTURE

Contents
Introduction.........................................................................................................................................2
Detail analysis problem.......................................................................................................................2
Operation 1 ordering and delivery system.........................................................................................2
Description of the data structure and justification.......................................................................2
Algorithm in Pseudo code format to fulfil the Operation.............................................................3
Complexity Analysis of the Selected Data Structures and Algorithm.........................................4
Operation 2 product replenishment...................................................................................................4
Description of the data structure and justification.......................................................................4
Algorithm in Pseudo code format to fulfil the Operation.............................................................4
Complexity Analysis of the Selected Data Structures and Algorithm.........................................5
Operation 3 damages order manufacturing system..........................................................................5
Description of the data structure and justification.......................................................................5
Psudocode.........................................................................................................................................5
Complexity Analysis of the Selected Data Structures and Algorithm.........................................6
Conclusion............................................................................................................................................6

Introduction
The objective of this project is to implement the ice cube manufacturing company in
Singapore, which uses graphical data structure and performs each operation. The graphical
data structure is used for the ice cube manufacturing on essential relationships of the existing
data that can be storage on the graphical data structure. The operation of the ice cube
manufacturing is to analyze the ice supply to the customer. Ice cube manufacturing and
transportation can execute the economic issue and the government operation. Amongst the
consumers, there is increase in consumption of the ice cube and this entails adequate
production, to fulfil the increasing demand, hence levelling the curve. For accurate and
timely delivery of the information, a necessity to process a real time system is seen. The
scope of this report is the analysis on manufacturing of ice cube and it ensures to resolve the
problem. Moreover, the specified operations and data structure has been used for the pseudo
code's time complexity. The investigation is on the manufacturing company which can
perform the three stages of operation that are used in the data structure such as, linear data
structure, graphical data structure, hierarchical data structure on the linked list.
Detail analysis problem
Quick responses in any business operation is a key factor for the success. For many
businesses, achieving this becomes a challenge since most operations are done manually. In
the real world, decision making is expected to be within the shortest time possible and this
calls for the use of an information system's Ice cube which needs to be managed well, since it
is a delicate property (Mastorakis, 2011).
Operation 1 ordering and delivery system
Description of the data structure and justification
The customer orders the ice cube manufacturing system on a daily basis. The
customer can enter the individual details and fulfils the details. Given that, the process is
done at a random overview, the graphical data structure will be the appropriate structure in
storing the customer’s details into the developed system. Given the various types of data
structures in the graphical type, the system registration process's implementation will be
easily achieved with the use of the undirected graphical data structure, since the customers
will be randomly located in the supply centres. Hence, there is no specific direction in
registration. The customer enters the input of the product and ensures ice to be delivered to

the customer. The customers enter the input system easily and with no prior conditions
relsyed to the order of location. The spanning tree gives us the real implementation of the
graphical data structure, by using the graphical search algorithm (O'Neil, 2014).
Algorithm in Pseudo code format to fulfil the Operation
Customer input system
{
Enter the details loop form start
Print the customer product order list (A);
consol.write (B);
Enter product code:
Check product description, capacity
Order list(C);
Order store data:
Add the product list (D);
Remove the product list ();
Date(x);
Time (E);
Customer list (A);
Deliver time(A);
Delivery person: check details (Driver, name, contact no, driving licence number)
Product: delivery to customer (list (F));
End
The graphical data structure of the ice cube order's delivery system.
A B
E
C
F
D

Complexity Analysis of the Selected Data Structures and Algorithm
By following the above algorithm, it is possible to finally arrive at the point where a
spanning tree with a minimum edge is obtained as seen from the distance. With the truck
drivers on the move, this algorithm with cut the weight and the cost for all the processes. The
customers will be located from the shortest distance to allow the maximum utilization of the
time factor. Space on the other hand, is factored in from the travel distance before a new
customer is added to the system (Searle and Gruber, n.d.).
Operation 2 product replenishment
Description of the data structure and justification
This data structure is chosen for this implementation since all the related data are kept
together in several categories, hence it allows well storage and easy retrieval of information.
The links aid in achieving this stated property while on the other building the referential data
integrity for the child records through the automatic enforcement with the already existing
parent nodes in the database.
Algorithm in Pseudo code format to fulfil the Operation
Sub trucks (A)
For supply = 1 to 60
Print number = True
If supply is ice replenishment (B)
Print "ice cube(c)”
Print number = False
End If
If supply is delivery schedules (D)
Print "Buzz"
Print number = False
End If
If print number = True Then print supply
Print a newline
Next supply
End Sub
Graphical data structure of the ice cube's order delivery system.

Complexity Analysis of the Selected Data Structures and Algorithm
The type of the product is easily identified by checking the preceding node, and the
other below stated node. In this case, the execution time of the algorithm is lowered down
while maximizing the memory space, hence providing a proper analysis platform for
optimization the complexities.
Operation 3 damages order manufacturing system
Description of the data structure and justification
This process follows a successful delivery of the ice cube. Once the stock re-order
level is reached, a notification is sent to the responsible personnel and the following process
occurs. All the truck's refrigerators are refilled and the stock level is updated respectively.
The delivery of the ice cube to the customer shows that the product can order the demand
based on the incoming events, festive celebrations, marathons, national scale celebration on
the data analysis to use the data structure (SILBERSCHATZ., 2019).
Psudocode
Damage product = 0
Set customer= LinkedList.top
Set Front Node= celebration
Set Rear Node= NULL
While demageproduct < > null
Set new Node -next = customer
Demageproduct + = nodes (check product out)
Truck
Count Schedule Supply Replenish
Supplier in Customer Check Product Damage based the
incoming event
out

First –in first out
Last in Last out
Complexity Analysis of the Selected Data Structures and Algorithm
The complexity analysis can be used for damage based on the incoming events and
celebration of the data in one-time process, where one truck is refilled at a time and this is
done simultaneously to the trucks in queue. Using the queue data structure, the array list
formed will provide the essential elements to be used for the general process. In this regard,
the ice cube supply will be greatly improved and all the related datasets will be managed
effectively.
Conclusion
The objective of this project to successfully implement the ice cube manufacturing
company in Singapore, with the help of graphical data structure and the operations are
performed. The graphical data structure is used for the ice cube manufacturing on essential
relationships of the existing data, which can store the graphical data structure is completed.
The investigation on the manufacturing company performs three stages of operation with the
data structure that includes the linear data structure, graphical data structure, hierarchical data
structure on the linked list is completed.

References
Mastorakis, N. (2011). Pathway modeling and algorithm research. Hauppauge, N.Y.:
Nova Science Publishers.
O'Neil, P. (2014). Database. Elsevier Science.
Searle, S. and Gruber, M. (n.d.). Linear models.
SILBERSCHATZ. (2019). DATABASE SYSTEM CONCEPTS. [Place of publication not
identified]: MCGRAW-HILL EDUCATION.