General comments on the hour exam:

The first question on the exam will be similar to problem 1 in that it will ask you to produce a method to carry out some simple task that you can do in your head without much trouble. Your task will be to produce an algorithm that the computer can perform. You will be given numerical examples of the problem, the name of the method you are to write, and clues as to how to go about it.

The second question will ask you to form a class, using a constructor and the method of the first problem. A broad outline of the class, along with the "global" variables, will be provided.

The third question might ask you to test something about the class at this state. Or, it might ask you to add define a method to carry out some task suggested by the data at hand

The fourth and fifth questions will ask you to solve some questions suggested by the class and its variables. Be sure you know how to instantiate a class and how to construct an array of objects each of which is an instance of the class in question.

The question on the hour exam will deal with factoring an integer.

I provide this information now so you can think about how to go about doing this on a computer. I am also providing an applet that factors an integer into primes to acquaint you with factorization and give you time to think about what you do when you factor an integer into primes.

You will not be asked to write this applet. Rather, you will to asked to construct the class that would be used to do this. You will be given a good deal of information on how to do this

Do not ask your TAs to work out this problem for you. I have told them not to.

One definition that may be new to you: A "square free integer" is one that does not contain the second or higher power of any prime. For example,35 = 5*7 is square free, 48 = 2⁴*3 is not square free. Neither is 75 = 5²*3