FINAL PROJECT OF DATA STRUCTURES AND ALGORITHMS

Course: ALGORITHMS AND DATA STRUCTURES

Proyecto: Aplicación para venta y despacho (delivery) de productos electrónicos.

I. Objectives:
The student must prepare a report that meets the required formats and standards in the
Preparation of a professional report (APA format).
The student must apply the data structures learned in the course for development.
a business application.

II. Report Content:

1. Introduction
2. Expected student outcomes achieved with the project
3. Project Gantt
4. Graphical representation of the ADTs and data structures used in the project.
5. Conclusions
6. Teamwork Report
7. Bibliography (as many as needed)
8. Demo (application in JAVA)

III. Tools for application

Netbeans
Internet
MySQL database
Course material
IV. Application Development:
1. Data model.
ORDER

2. Application start:

The information from the Product table must be loaded into the binary product tree.
The information from the District table must be loaded into the district graph.

The information from the Order table must be loaded into the dispatch queue.

3. Sales interface:

a) Search Product Button: This button searches the binary tree of products. Once it
find the product, capture the associated information, and display it on the screen. If the
Product does not exist, please register the product in the 'Register product' option.
b) Search Client Button: This button searches the client database. If the client exists, it
they show the names and surnames. If it does not exist, indicate to register the customer in the
option "Register customer".
c) Route Cost Button: This button searches for the graph of districts for the shortest route to the destination.

assume that the starting point is the district of 'La Molina'. Once the
shortest distance, apply a shipping cost of S/.0.50 per kilometer.
d) Confirm Order button: This button validates that the greeting is correctly written. It is
saying through a stack must validate that the signs: ¿?, {}, [], () are present
correctly written in quantity and order. After that, send the dispatch to a queue
of dispatches
4. Dispatch interface:

a) Next dispatch button: This button dequeues the next order from the dispatch queue.

5. Records interface:

a) Register products: This option adds a record to the product database and a
node to the binary tree products. Remember that the tree after insertion must be
balanced (AVL).
b) District registrar: This option adds a record to the district database and a node
to the graph districts. The following data must be entered: origin district, destination district and
the distance between the two.
c) Register client: This option adds a record to the customer database.
V. Data structures used in the project:

a) AVL TREES:
Balanced binary search tree to store and organize products.

b) BATTERIES:

Each order, apart from the customer's name, must contain a greeting that will arrive at
recipient. When the "CONFIRM ORDER" button is clicked, the message must be sent.
for a filter to see if the question marks, parentheses, braces or brackets in
quantity and order are correct.

c) GRAPHS:
When choosing the destination of the dispatch, the graph should be consulted for the shortest route.

short, starting from the warehouse located in 'La Molina'.

The nodes are the districts and the edges are the distance in kilometers. It is assumed that the
the outbound distance is the same as the return distance. It is also assumed that the distance to

The destination point will be the same for any direction within the district.
Example:
Almacén La Molina => Los Ficus = 5km
Almacén La Molina => Ovalo Santa Anita = 5 km
This does not limit the student from improving the solution by making it more accurate in the

distribution.
The network must have at least 20 nodes (there are 43 districts in Lima) and 40 edges.
 d) COLAS
Each office takes a time 'X' to attend. Therefore, after clicking on the
The "CONFIRM DISPATCH" button becomes part of the "DISPATCHES" queue.
In another window called 'Warehouse', the pending shipments should appear and when
the storekeeper clicks the button 'NEXT DISPATCH' a dispatch is unqueued.

VI. Evaluation:

The project represents -according to the 2016-02 syllabus of the course- 12.5% of the final grade in the course.

The rubric of the report and the presentation is attached.

VII. Entregables y Fechas:

The submission of the final project (deliverable 1 and 2) must be presented through the Virtual Campus.

in a task enabled where each group will upload the report and the developed source codes
(only in the second deliverable), the report must meet the following characteristics:
Arial font and size 11
Paragraph line spacing of 1.5
Cover with the group's information
Cualquier copia o intento de copia en el proyecto sea total o parcial será sancionado
with the cancellation of the grade

The content of each deliverable is as follows:

1st deliverable of the project (25%) Week 8

Content:
- Introduction: List of students, general description of the activities and
project assumptions.
- Expected student outcomes: Work objectives aligned with the
course objectives.
- Project Gantt: List of activities to be developed with the
responsible persons assigned for each one.

2nd deliverable of the project (75%) Week 14

Content:
- Graphic representation of ADTs and Data Structures: General representation or
modular of all the elements used, whether by class diagram, trees
binaries, graphs or any diagram they find appropriate.
- Conclusiones: Especificar las conclusiones a las que el grupo hay llegado, describir
the usefulness and application in real cases of the tools used.
- Teamwork report: Each member will describe in their own words the
interaction with your group in the activities carried out, then as a group
they will outline the conclusions they have reached and whether team cohesion was created or

no
- Bibliografía: referencias bibliográficas, todas las que fueron utilizadas
- Demo: The application and source code in Java