You may assume that the input file has no errors. In particular, you may assume that the file exists, that it is composed of pairs of lines, and that the second line in each pair will have exactly 70 characters that are either A, B or dash (although the A’s and B’s might be in either uppercase form or lowercase form or a combination). You may also assume that nobody has zero answers for a given dimension (it would be impossible to determine a percentage in that case).

The sample input and output files provide just a few simple examples of how this program works. We will be using a much more extensive file (big_input.txt) for testing your program. As mentioned earlier, we will include data from people in the class to make this file.

We will once again be expecting you to use good programming style and to include useful comments throughout your program. We are not specifying how to decompose this problem into methods, but we will be looking out for the quality of your decomposition. That means you will have to decide how to decompose the program into methods. You should keep in mind the ideas we have been stressing all semester. You don’t want to have any one method be overly long. You want to break the problem down into logical subproblems so that someone reading your code can see the sequence of steps it is performing. You want Main to be a concise summary of the program.

Previous Topic

Back to Lesson

Next Topic