The proposed project is about the CRUD (Create, Read, Update, delete) based Food-Panda Management system in which customers can get orders from the nearby Food-Panda store. The store has a main-branch in F7 and sub-branches in different sectors. The customers can buy products from the store by first selecting the product category. The available product categories in the stores include Chicken-Burger (Rs. 200), Andy-wala Burger (Rs.150), Small-Sized-Pizza (Rs. 400), Large-Sized-Pizza (Rs.750), Fries (Rs. 100), One-Liter-Coke (Rs. 120) and Shuwarma (Rs.150).
Once the user selects the required product category, the system will check that whether the selected product category stock is available at the shop. If the stock for the selected category is available, the user will be directed to products screen. In case the stock is unavailable for that category, user will be referred to the nearest store where the selected product category is available.
The available products are shown to user to buy the desired product. The details of the product include Order Id, Order name, Order price, Customer name, Customer Mobile number.
Four major data structures is used in the project to implement:
-
- Linkedlist
-
- AVL Trees
-
- Stack
-
- Graphs
-
- Arrays
Linkedlist is used for the storage of orders. Orders are purchased, checked, updated, cancelled and delivered using linkedlist.
AVL Trees are used as a storage of delivered orders. It is used to store the history of all the orders that have been delivered. It helps in checking how much sale is done for a day.
Stack is used to store the feedbacks of the customers. Program takes the feedback from the customer (when his orders are delivered) and store it in the stack. When the user checks the feedback, it displays orders from the stack on the basic of LIFO (Last-In-First-Out).
Graphs are used to store the information of customers destinations that are chosen from different sectors. The main shop (source) of the graph is F7 and user can get his order in I9, I8, H8, H6, I10, and F8. Dijistra's algorithm is used to calculate the shortest path between the source and the destination.
Different arrays of different data types are used in the program. For example, an array of type string is used to store all the sectors, an 2D array of type int is used to implement graph and an array of string type is used to store feedbacks in the stack.
💬 All the project is fully Open-Sourced. Show some love by giving it a STAR🌟.