Write a Java program which takes as input the name of a file in the current...

 

Transcribed Image Text:

Write a Java program which takes as input the name of a file in the current directory. The first line of the file will contain an integer n, giving the number of posts along the river. The remaining n 1 lines of the file will contain the integers of the cost matrix, delimited by white space, omitting the unnecessary entries. For example, the matrix shown above could be represented by the following data file: 4 10 15 50 40 20 35 (Note that white space is not significant in the file.) Using a dynamic programming algorithm, your program will then compute the optimal costs of traveling between any two posts (i, j) where i <j. The goal is to determine the optimal cost for (0, n − 1). After performing that calculation, your program will print the optimal cost matrix: i.e. the optimal cost between any two posts (i, j) for all values 0 ≤ i ≤j≤n-1. Additionally, your program will print the actual sequence of rentals to be used for the route between posts 0 and n − 1 (not just its optimal cost). - Your program should use "good style". See the separate handout on style requirements for CS3310 programs. In particular, note that you should describe the algorithms you implement in sufficient detail to demonstrate your deep understanding of the algorithms in question. Additionally, you should create the following ordinary text files: ● README: Information on how to compile and run your program. • ANALYSIS: An analysis of your program, including: - A description of the (recursive) formula used to calculate the optimal costs be- tween posts A theoretical analysis of the run time of your program, formula Note that an empirical timing analysis is not required. based upon that recursive Write a Java program which takes as input the name of a file in the current directory. The first line of the file will contain an integer n, giving the number of posts along the river. The remaining n 1 lines of the file will contain the integers of the cost matrix, delimited by white space, omitting the unnecessary entries. For example, the matrix shown above could be represented by the following data file: 4 10 15 50 40 20 35 (Note that white space is not significant in the file.) Using a dynamic programming algorithm, your program will then compute the optimal costs of traveling between any two posts (i, j) where i <j. The goal is to determine the optimal cost for (0, n − 1). After performing that calculation, your program will print the optimal cost matrix: i.e. the optimal cost between any two posts (i, j) for all values 0 ≤ i ≤j≤n-1. Additionally, your program will print the actual sequence of rentals to be used for the route between posts 0 and n − 1 (not just its optimal cost). - Your program should use "good style". See the separate handout on style requirements for CS3310 programs. In particular, note that you should describe the algorithms you implement in sufficient detail to demonstrate your deep understanding of the algorithms in question. Additionally, you should create the following ordinary text files: ● README: Information on how to compile and run your program. • ANALYSIS: An analysis of your program, including: - A description of the (recursive) formula used to calculate the optimal costs be- tween posts A theoretical analysis of the run time of your program, formula Note that an empirical timing analysis is not required. based upon that recursive