Exercise 05: A Better Notebook

This week’s lab work is intended help you practice using loops.

Pre-lab

P1. Write a loop on paper that prints out all multiples of 5 between 10 and 95.

P2. Write a method called sumBetween that adds up all numbers between two numbers, a and b, that are passed into the method as parameters. Include a but not b in the sum.

P3. Assume you have a collection of students called imi1. The Student class has a method getFirstName and a method getSurname. Write a loop that prints out all students in the collection with the last name first, then a comma, then a blank, and then the first name, each on a line by itself.

P4. Write a method isPrime that uses a while loop to test if a number given in a parameter is prime or not. A number is prime when it is divisible with a remainder of 0 only by 1 and itself.

Post-Lab, AKA What To Turn In

Your completed assignment, submitted in Moodle as a pdf + zipped sources (that is 2 Files to upload: 1 pdf, one zip), should include:

The names and roles of any collaborators in any parts of the exercise.
A description of what you did during the lab, including a record of what worked, what problems you encountered, and answers to the questions as asked.
A copy of the final version of your Notebook code as well as the prelab-and-primes project, zipped in one archive.
A record of how long you needed for this lab and what you learned.

Lab assignments are due before your next lab at 22:00. They may, of course, be turned in earlier.

Assignment

A Better Notebook

Source Code for this exercise: https://github.com/htw-imi-info1/exercise05

You can use the notebook-gui which should ease testing. The Notebook.java file stays the same. If you use the GUI version you should start by adding the method signatures with empty method bodies (or you could return “not yet implemented”) until NotebookGUI compiles enabling you to start using the GUI for testing. You can, however, just use Notebook.java.

Using the provided class PreLabin the prelab-and-primes project, test that your prelab work in P1-P2 is correct. What test cases did you have to create?
printAll(): Adapt the notebook project you find in the repository to list all notes in a method called printAll(), as done in class. Create a notebook and add some notes, checking that this method works as intended.
getAll(): Now copy the method, name the copy getAll() and modify such that instead of printing all notes directly, it returns a string containing all notes with a new line ( “\n” ) in between. If you don’t like the idea of copying code rewrite the printAll() method to use getAll().
getAllNumbered() : copy and modify your getAll() method so that it adds a number in front of each note that corresponds to its index in the ArrayList. The new method should be called getAllNumbered().
getNotesWith(String searchString): implement a search method that returns a string with all the notes containing the search string, separated by “\n”.
removeNote(String searchString): Implement a Method removeNote() that removes all notes containing a searchString passed as parameter (as seen in class) i by using an iterator and the remove() of the iterator method. The removeNote method returns nothing; it modifies the notes collection.
removeNotesWithIndex(String searchString) Implement a second remove method without an Iterator, using a while loop with an index. The removeNote method returns nothing; it modifies the notes collection. Did you run into problems? If not, what may be the possible problems with this compared to the solution using an iterator?
Within a single execution of the two remove methods, the notes collection is asked repeatedly how many notes it is currently storing. Does the value returned by size vary from one check to the next? Rewrite your remove method so that the size is not checked unnecessarily, perhaps using a local variable. Check that your version gives the same results! What cases will you have to test?
Create a collection primes and use your prelab 4 to fill it with the prime numbers between 1 and 1000. Oops, this won’t work directly, because collections don’t take ints. You can use something called autoboxing to solve this. Look up Integer in the API and use this. How many prime numbers are there between 1 and 1000? Please use the method primesSmallerThan(int number) in the PreLab class for this, and have it return the number of primes you’ve found. There is also a method stub for isPrime already in the class.
(For the bored) Implement a search with ‘?’ as a joker standing for any character, and ‘*’ standing for any number of characters.
(For the really bored) Implement full regular expression search for the notebook.