CSCI/CMPE 3326 Spring Homework 3 Due

Transcription

1 Homework 3 Due Program 1: Make Carmax program. The program provides functions to manage customers and car inventory using MySQL. You can define any class, method, and database table if you need. (You may not want to use an object array for car and user data.) Note that you shouldyou re your own Google Cloud MySQL Server but not localhost MySQL. If you are not sure about your DB name, ID, and Password, please contact me. Note: 1. To send a SQL query for select, please use executequery( ) method of statement object. a. Example Connection conn = DriverManager.getConnnection(... ); Statement st = conn.createstatement(); String sqlstr = select * from cars ; Resultset rs = st.executequery(sqlstr); 2. To send a SQL query for insert, delete, and update, please use executeupdate( ) method of statement object. a. Example Connection conn = DriverManager.getConnnection(... ); Statement st = conn.createstatement(); String sqlstr = delete from cars where vin = 1234abcd ; Resultset rs = st.executeupdate(sqlstr); 3. The SQL ORDER BY clause can be used to sort the data in ascending or descending order, based on one or more columns. a. Example Connection conn = DriverManager.getConnnection(... ); Statement st = conn.createstatement(); String sqlstr = select * from cars ORDER BY price DESC; ; Resultset rs = st.executequery(sqlstr);

2 Example of the program and user interface Welcome to Carmax! 3.Exit Please input your choice: 2 Please input user id: dkim123 Please input password: 3948 Please input password again: 3948 Please input your first name: Dongchul Please input your last name: Kim Please input your dongchul.kim@utrgv.edu Thank you for your sign up! 3. Exit Please input your choice: 1 Please input your user id: dkim123 Please input password: 3948 Welcome back Dongchul Kim! 2. Sort cars 3. Log out Please input your choice: 1 1. New 2. Used Please input your choice: 2 2. Sort all cars (used and new) 3. Log out Please input your choice: 2 1. Sort by VIN 2. Sort by Brand 3. Sort by Model 4. Sort by Year 5. Sort by Mileage 6. Sort by Price 7. Sort by Color Please input your choice: 5

3 2. Sort cars 3. Log out Please input your choice: 3 Bye~ Dongchul Kim! 3. Exit Please input your choice: 1 Please input your user id: admin Please input password: adminpass Welcome back admin s_name! Please input: 1 Please input: 2 VIN: AB234K888 Brand: Audi Model: R8 Year: 2017 Mileage: 14 Price: Color: B New: Y VIN Brand Model Year Mileage Price Color AB234K888 Audi R B Successfully this car has been added.

4 Please input: 3 Please input VIN: AB234KXAZ Successfully this car has been deleted. Please input: 4 Please input VIN: XX55JKA31 1. Update brand 2. Update model 3. Update year 4. Update mileage 5. Update price 6. Update Color Please select option: 5 Please input price: It s updated. Thank you. XX55JKA31 Ford F B Y

5 Please input: 5 Please input: 6 Please input user id: usia123 Please input password: 8873 Please input password again: 8873 Please input your first name: Emmett Please input your last name: Tomai Please input your emmett.tomai@utrgv.edu usia Emmett Tomai emmett.tomai@utrgv.edu Please input: 7 usia Emmett Tomai emmett.tomai@utrgv.edu Please input ID: usia123 usia123 has been deleted! Please input: 8

6 Please input ID: dkim Update password 2. Update first name 3. Update last name 4. Update Please input: 2 Please input new first name: Daniel dkim Daniel Kim dongchul.kim@utrgv.edu Please input: 9 3. Exit Please input your choice: 3 Thank you!

7 Program 2: Two empty water buckets A and B with different capacities. These water buckets can be repeatedly filled with water and emptied in order to fill the water buckets with the desired amount of water. There is no way to accurately measure the amount except using the water buckets. There are three possible types of tasks. [F(x): Fill x]: Water bucket x is fully filled with water. (Before filling, the water bucket x may be empty or not) [E(x): Empty x]: make water bucket x empty [M(x,y): Move water from x to y)]: Pour water from bucket x into bucket y. If the amount of water in the water bucket x is less than or equal to the space remaining in the water bucket y, we can pour the whole water in the water bucket x into the water bucket y. If the amount of water in the bucket x is greater than the empty space remaining in the bucket y, we can pour as much as possible to fill the water bucket y, and leave the rest in the water bucket x. For example, let's say that the capacity of water buckets A and B is 2 liters and 5 liters, respectively. If you want to leave 2 liters of water in the bucket A and 4 liters of water in the bucket B, you can reach the desired state with 8 operations in total as follows. (0,0) [F(B)] (0,5) [M(B,A)] (2,3) [E(A)] (0,3) [M(B,A)] (2,1) [E(A)] (0,1) [M(B,A)] (1,0) [ F(B)] (1,5) [M(B,A)] (2,4) However, if the work order is as follows, the total number of jobs required is 5 times. (0,0) [F(A)] (2,0) [M(A,B)] (0,2) [F(A)] (2,2) [M(A,B)] ( 0,4 ) [F(A)] (2,4) Write a program that receives the capacity of both buckets and the desired final state as input, and then finds the minimum number of jobs/operations to reach the final state desired. It starts from the state that both buckets are empty. Input format Number of test case Capacity_of_bucket_A Capacity_of_bucket_B Desired_state_of_Bucket_A Desired_stateof_Bucket_B Output format Number of operations Example of input file (input.txt) Example of output 9 5-1