Copy the the class Cell.java into a file Cell.java.
Compile and run the Program.
Try out the documentation tool:
Create a directory docu for the documentation
mkdir docu
Insert documentation comments for the methods (@return, @param) into class Cell (see
Language Fundamentals Summary, Slide 3)
Generate documentation for the class Cell using the documentation tool
javadoc -d docu Cell.java
Inspect the generated HTML page Cell.html in your Netscape Browser
Inspect the Java class documentation provided by the JDK. You will find it via the OOAD
home page (http://www.sts.tu-harburg.de/teaching/ws-98.99/OOA+D/entry.html) or directly at
(http://pc01.sts.tu-harburg.de/javadoc/api/packages.html). Search the classes Integer and Boolean which are direct
object counterparts to the primitive types int and boolean. Write a test program that converts an int value to an
Integer object (and vice versa) and an bool value to a Boolean object.
Write a program that defines variables for each primitve type (int, float, boolean,
char), carries out one of the described operations (see handout), and prints the results.
Write a program that prints values from one to 100. Avoid printing the values divisible
by 13 and let the program print the string "Bad Luck" instead.
Create a program to print the alphabet in lower case, explicitly marking the letters
which are contained in the words "java" or "programming". Note that
the letter 'a' is in both words. Nest a switch statement into a for loop for this purpose.
Write a program that computes the prime numbers less than 1000.
**Try to improve your programm by employing the Sieve of Eratosthenes:
The basic idea of the Sieve is to provide one boolean (or bit) for each number from 1 to n
(array of n booleans) when you want to compute all the prime numbers less than
n. Initially all these values are set to true. Whenever a prime number is discovered
the array entry related with this number and those related with its multiplicities are set
to false. Proceeding like this the next entry in the array equal to true is the next prime
number. Define a class Sieve to implement the sieve.
