Question

The question is in the provided image, if there is something you can't see clearly please inform me. ElectronicStore Class: You will have to update the existing ElectronicStore class and add in additional state/methods. The final ElectronicStore class will keep track of both Product objects and Customer objects. The base code for this assignment contains some initial code for an electronic store program. This code includes an ElectronicStore class, a Product class, and a number of descendants of the Product class representing specific types of products. The ElectronicStore class currently uses an array to store up to MAX_PRODUCTS products. Within this assignment, you will be modifying the ElectronicStore to make use of ADTs for storage. You will also be adding customers into this program and implementing some additional functionality. The remainder of this document outlines the changes you should make to the existing code and the functionality. 1. Change the existing code so that it uses ADTs for expandable storage of Product objects instead of a fixed-size array. 2. Add a method to the ElectronicStore. It should not be possible to add two customers with the same name (i.e., the customer names within a store are unique). This method should return true if the Customer was added successfully and false otherwise. 3. Update the boolean addProduct(Product) method in the included code to work with your test classes provided on the assignment page that you should use to test your methods. For the purposes of this assignment, two products should be considered identical if their toString() methods return the same strings. 4. Add a List<Customer> getCustomers() method that returns a List of Customer objects that are registered with the ElectronicStore. This list does not need to be sorted in any way but should only contain one copy of each Customer registered within the store. 5. Add a List<Product> searchProducts(String x) method. This method should return a list of matching Product objects in the ElectronicStore. A Product should match the search query if the toString() method of the Product contains the given String x. This search should be done in a case-insensitive manner (e.g., "DO" matches a product with toString() of "dog"). 6. Add a List<Product> searchProducts(String x, double minPrice, double maxPrice) method. This method will work like the searchProducts(String x) method but must only include Product objects where minPrice <= Product Price <= maxPrice. If the minPrice or maxPrice inputs are less than 0, they should be ignored. As one example, searchProducts("dog", 10, -1) would find all products containing "dog" in the toString that have a price of 10 dollars or more. 7. Add a boolean addStock(Product p, int amount) method. If the given product exists in the store, this method should increase the stock amount of that product by the included amount. The method should return true to indicate that the product stock was updated and false otherwise. 8. Add a boolean sellProduct(Product p, Customer c, int amount) method. This should simulate selling the given amount of units of Product p to Customer c. The method should return false if the sale was not successful (p is not in store, c is not registered with the store, and/or there are not enough units in stock to complete the sale) and true if the sale was successful. 9. Add a List<Customer> getTopXCustomers(int x) method. This method must return a list of the x customers that have spent the most money at the store. This list should also be sorted from the highest to lowest amount spent. If x <= 0, return an empty list. If x is greater than the number of customers in the store, return a list with all customers sorted from highest to lowest amount spent. The above methods must be implemented following the given specifications. Note, however, that you will have to add additional state/methods into the Customer class to support the history for the customer. 10. Create a boolean saveToFile(String filename) method that saves the entire store state. Return true if the store was successfully saved and false otherwise. You are free to use any of the file input/output options covered in the lectures. 11. Create a static ElectronicStore loadFromFile(String filename) method that loads a store and its associated customers/products from a file with the given name. The method should return the loaded ElectronicStore object if the store is successfully loaded. If any errors occur during the loading process, the method should return.

          The question is in the provided image, if there is something you can't see clearly please inform me.

ElectronicStore Class: You will have to update the existing ElectronicStore class and add in additional state/methods. The final ElectronicStore class will keep track of both Product objects and Customer objects. The base code for this assignment contains some initial code for an electronic store program. This code includes an ElectronicStore class, a Product class, and a number of descendants of the Product class representing specific types of products. The ElectronicStore class currently uses an array to store up to MAX_PRODUCTS products. Within this assignment, you will be modifying the ElectronicStore to make use of ADTs for storage. You will also be adding customers into this program and implementing some additional functionality. The remainder of this document outlines the changes you should make to the existing code and the functionality.

1. Change the existing code so that it uses ADTs for expandable storage of Product objects instead of a fixed-size array. 
2. Add a method to the ElectronicStore. It should not be possible to add two customers with the same name (i.e., the customer names within a store are unique). This method should return true if the Customer was added successfully and false otherwise. 
3. Update the boolean addProduct(Product) method in the included code to work with your test classes provided on the assignment page that you should use to test your methods. For the purposes of this assignment, two products should be considered identical if their toString() methods return the same strings. 
4. Add a List<Customer> getCustomers() method that returns a List of Customer objects that are registered with the ElectronicStore. This list does not need to be sorted in any way but should only contain one copy of each Customer registered within the store. 
5. Add a List<Product> searchProducts(String x) method. This method should return a list of matching Product objects in the ElectronicStore. A Product should match the search query if the toString() method of the Product contains the given String x. This search should be done in a case-insensitive manner (e.g., "DO" matches a product with toString() of "dog"). 
6. Add a List<Product> searchProducts(String x, double minPrice, double maxPrice) method. This method will work like the searchProducts(String x) method but must only include Product objects where minPrice <= Product Price <= maxPrice. If the minPrice or maxPrice inputs are less than 0, they should be ignored. As one example, searchProducts("dog", 10, -1) would find all products containing "dog" in the toString that have a price of 10 dollars or more. 
7. Add a boolean addStock(Product p, int amount) method. If the given product exists in the store, this method should increase the stock amount of that product by the included amount. The method should return true to indicate that the product stock was updated and false otherwise. 
8. Add a boolean sellProduct(Product p, Customer c, int amount) method. This should simulate selling the given amount of units of Product p to Customer c. The method should return false if the sale was not successful (p is not in store, c is not registered with the store, and/or there are not enough units in stock to complete the sale) and true if the sale was successful. 
9. Add a List<Customer> getTopXCustomers(int x) method. This method must return a list of the x customers that have spent the most money at the store. This list should also be sorted from the highest to lowest amount spent. If x <= 0, return an empty list. If x is greater than the number of customers in the store, return a list with all customers sorted from highest to lowest amount spent. 

The above methods must be implemented following the given specifications. Note, however, that you will have to add additional state/methods into the Customer class to support the history for the customer. 

10. Create a boolean saveToFile(String filename) method that saves the entire store state. Return true if the store was successfully saved and false otherwise. You are free to use any of the file input/output options covered in the lectures. 
11. Create a static ElectronicStore loadFromFile(String filename) method that loads a store and its associated customers/products from a file with the given name. The method should return the loaded ElectronicStore object if the store is successfully loaded. If any errors occur during the loading process, the method should return.

the question is in the provided image if there is something you cant see clearly please inform me electronicstore class you will have to update the existing electronicstore class and add in 74012

Added by Amanda P.

Program #6 Binary Search Trees (Please write in JAVA!) Objectives Write and use a linked implementation of a binary search tree. Problem Description In this assignment, you will practice solving a problem using a binary search tree. You will implement a Java application that could be used in a restaurant. You are asked to implement four classes: MenuItem, BSTNode, BST and Driver. Each of these classes is described below. Classes The method names, parameters and return types must match the specification exactly. You may add other methods if you wish. MenuItem Class The MenuItem class represents one item ordered from a menu. The MenuItem has three instance variables: name (of type String), qty (of type int) and price (of type double). Implement the following methods for the MenuItem class: A constructor to initialize all instance variables. A value for each instance variable will be passed as a parameter to the constructor. The parameters must be in the order (name, qty and price). The instance variable name will be used as the search key and as the instance variable that will determine the order in which the items are stored in the binary search tree. Getters for all instance variables. Setter methods for each instance variable. equals(): Implement the equals() method for your MenuItem where two MenuItems are considered equal when they have the same search key (name). Other instance variables must be ignored. Use the standard signature for the equals() method. Note that, the equality of String attributes should be case insensitive. For example, “MATH”, “math” and “Math” match each other. In order to compare strings in Java use the String's equalsIgnoreCase() method. For example, the following code should print true: String str1 = "Hello"; String str2 = "hello"; System.out.println(str1.equalsIgnoreCase(str2)); toString(): a method that returns a nicely formatted string description of the item. All items should be separated by tabs (use " ") and the entire MenuItem should be displayed on one line. In addition to name, price and qty, calculate the total value of the MenuItem (price * qty) and add it to the end of the string. Rice $1.50 3 $4.50 Use the NumberFormat or DecimalFormat class to display prices with exactly two digits following the decimal place. Implement the Comparable interface and the compareTo() method for MenuItem. compareTo() returns a negative number when the invoking object's search key (name) is less than the parameter's search key 0 when the two search keys (names) are equal a positive number when the invoking object's search key (name) is greater than the parameter's search key For example, "Ant".compareTo("bat") will return a negative number. Note that the comparison of String attributes should be case insensitive. For example, “MATH”, “math” and “Math” match each other. Base the comparison only on the search key. All other instance variables must be ignored. BSTNode Class Create a BSTNode class. You must create your own BSTNode class and you may not use any node classes from the Java library. The BSTNode instance variables consist of data and two links, left and right. The data instance variable must be of type MenuItem. The instance variables must be private. Implement a constructor with parameters data, left and right, in that order. Implement getters and setters for all instance variables. Your Tree class must be separate from your BSTNode class. You may implement a generic BSTNode class if you like. BST Class The MenuItems data must be stored in a recursive binary search tree data structure. This means the data is stored in order according to the binary search tree principles. You must create your own binary search tree class (separate from the BSTNode class) and implement the recursive methods you need. You must create your own BST class and you may not use any tree classes from the Java library. Be sure to implement encapsulation by having a clean separation between the node and binary search tree classes. Do this by making the instance variables private in both classes and by putting methods that manipulate more than one node in the BST class. Use a linked implementation. The BST class will have one private instance variable, root, which will hold a reference to the topmost node in the tree. The BST class methods must include these recursive methods: A no-arguments constructor that instantiates an empty binary search tree. void insert(MenuItem mi): a method that takes one input parameter, a MenuItem, and adds it to the binary search tree in the proper spot, preserving the binary search tree property. If the MenuItem is already in the tree, insert() will not add a new item to the tree but rather will increment the qty of the existing item by the new qty. If the MenuItem is not already in the tree, the method inserts the MenuItem in its correct position void preorder() – traverses the tree in pre-order (based on the search key) and prints the contents of each Node void postorder() - traverses the tree in post-order (based on the search key) and prints the contents of each Node void inorder() - traverses the tree in post-order (based on the search key) and prints the contents of each Node size(): a method that returns the number of nodes in the tree int depth(): returns the height (depth) of the tree. Note: An empty tree has a height of -1. A tree with one node has height of 0. getTotalQty(): an integer method that sums and returns the quantities of all MenuItems in the Tree MenuItem search(String name) – traverses the tree and returns a reference to a MenuItem with a search key (name) that matches the parameter. Returns null if not found. getTotalBeforeTax(): a method that calculates and returns the total value of all items in the tree. Remember to multiply the price by the quantity to get the total for each item. getTax(): a method with one parameter, taxRate (a double). getTax() calculates and returns a double representing the tax to be paid on the order getTip(): a method with one parameter, percentage (a double). getTip() calculates and returns a double representing the tip to be paid on the order's total before tax. toString(): a method that returns a string representation of all the MenuItems in the tree. The items will be displayed in alphabetical order. The String includes the following: a restaurant name and some header lines details of all the MenuItems, one per line the total of all the items in the tree before tax and tip been added the amount of tax to be added (use a fixed rate of 8%) the amount of tip to be added (use a fixed rate of 20%) the total after tax and tip have been added Sample of String returned from toString(): Downtown Cafe --------------------------------------------------- Item Price Qty Total --------------------------------------------------- Injera $2.50 1 $2.50 Rice $1.50 3 $4.50 Sambusa $5.80 4 $23.20 Sushi $8.25 2 $16.50 --------------------------------------------------- Total: $46.70 Tax: $3.74 Tip: $9.34 --------------------------------------------------- Grand total: $59.78 You are required to use the approach outlined in class with a public method with no arguments (one argument in the case of insert(), search(), getTax() and getTip()) and a private helper method. You may *not* directly access the root of the tree from the driver. You may *not* implement a public getRoot() method. With the exception of inorder(), preorder() and postorder(), the Tree class should not contain any print statements. All printing occurs in the Driver. Driver Use the Driver class to demonstrate that the BST class and its methods work properly. Create one or two BST trees. Add 20 to 25 MenuItems to the trees. Change the order of insertion to test different tree topologies. Do not add the items in alphabetical order or your tree will degenerate to a linked list. Call all the BST methods and display the results. Be sure to test the case where the MenuItem is already been in the tree (insert() causes the existing item's quantity to be changed). Print both orders in a nicely formatted output.

Sri K.

Question

Please give Ace some feedback