To implement a program that simulates vending machine Program plan: In the file “ Product.java ”, create a class “ Product”, Declare the variable. Define the constructor to constructs a Product object. Define the method “getDescription()” to get the description. Define the method “getPrice()” to get the price. Define the method “equals()” to determine of this product is the same as the other product. Define the method “toString()” to format the product's description and price. In the file “ VendingMachine.java ”, create a class “ VendingMachine”, Declare an “ArrayList”. Define the constructor to construct “VendingMachine” object. Define the method "getProductType()"to get the type of products in the vending machine. Define the method “addProduct()” to add a product to the vending machine. In the file “ VendingMachineMenu.java”, import necessary packages, and create a class “VendingMachineMenu”, Declare a Scanner variable. Define the constructor to create a Scanner object. Define the method “run()” to run the vending machine system. Execute for true value, Prompt the user to enter option. Get the user command from the user. Check if the input is “S”, show the products. Otherwise check if the input is “A”, get the product items, price, and quantity from the user. Otherwise, check if the input is “Q”, quit the application. Define the method “main()”, Call the method “run()” to run the application.

Question

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

Answer 1

Question

Chapter 12, Problem 1PP

Program Plan Intro

To implement a program that simulates vending machine

Program plan:

In the file “Product.java”, create a class “Product”,

Declare the variable.

Define the constructor to constructs a Product object.

Define the method “getDescription()” to get the description.

Define the method “getPrice()” to get the price.

Define the method “equals()” to determine of this product is the same as the other product.

Define the method “toString()” to format the product's description and price.

In the file “VendingMachine.java”, create a class “VendingMachine”,

Declare an “ArrayList”.

Define the constructor to construct “VendingMachine” object.

Define the method "getProductType()"to get the type of products in the vending machine.

Define the method “addProduct()” to add a product to the vending machine.

In the file “VendingMachineMenu.java”, import necessary packages, and create a class “VendingMachineMenu”,

Declare a Scanner variable.

Define the constructor to create a Scanner object.

Define the method “run()” to run the vending machine system.

Execute for true value,

Prompt the user to enter option.

Get the user command from the user.

Check if the input is “S”, show the products.

Otherwise check if the input is “A”, get the product items, price, and quantity from the user.

Otherwise, check if the input is “Q”, quit the application.

Define the method “main()”,

Call the method “run()” to run the application.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering