This project simulates an Internet shopping system where users can electronically purchase items. The system handles customer requests, processes them in order of arrival, and prioritizes members over non-members. Each item is identified by an Item ID, name, and price per unit. Customer requests include credit card information for payment and the customer's home address for delivery.
The project is divided into three parts, each focusing on different aspects of data structures:
-
ADT Graphical Representation: Provide a graphical representation of the most suitable Abstract Data Type (ADT) for the problem.
-
ADT Specification: Provide a complete specification of the chosen ADT.
-
Implementation: Implement all required operations, utilizing previously studied ADTs and operations.
-
Simulation: Write a main program to simulate the system, including the computation of the average time for the operation of purchasing an item.
-
Binary Search Tree: Represent items stored in the Storage House as a Binary Search Tree.
-
Implementation: Implement all required operations, making use of previously studied operations.
-
Simulation: Write a main program to simulate the system using a Binary Search Tree and compute the average time for purchasing an item.
-
AVL Tree: Represent items stored in the Storage House as an AVL tree.
-
Implementation: Implement all required operations, making use of previously studied operations.
-
Simulation: Write a main program to simulate the system using an AVL tree and compute the average time for purchasing an item.
We welcome contributions to this project. If you would like to contribute, please follow the guidelines below:
- Fork the repository.
- Create a new branch for your contributions.
- Implement the changes or additions.
- Ensure that your code adheres to the coding standards.
- Submit a pull request with a detailed description of your changes.
Thank you for contributing to the Internet Shopping System project!