CMSC 131 Quiz 5 Worksheet
The next quiz will be on Wednesday, Oct 27 (note the change from our normal quiz
day!) during your lab session (either at 10 am or 11 am). The following list provides
more information about the quiz:
• You will have 25 minutes to complete the quiz.
• It will be a written quiz (not using any computer).
• It will be closed-book, closed-notes, and no calculator is allowed.
• Answers must be neat and legible. We recommend that you use pencil and eraser.
• The quiz will be based on the exercises you will find below. The quiz will ask
you to write a class for a particular application.
The following exercises cover the material to be covered in Quiz #5. Solutions to these
exercises will not be provided, but you are welcome to discuss your solutions with TAs
and instructors during office hours.
When asked for a “piece of code” you do not need to provide an entire class definition or
even an entire method. Just present the Java statements and any variable declarations as
needed to make your solution clear.
Problem 1
Write a piece of code that determines whether two arrays of doubles have the same
elements, but perhaps in a different order. For example, given the following arrays:
int[] a = {1.0, 4.5, 8.9, 10.0};
int[] b = {4.5, 1.0, 10.0, 8.9};
int[] c = {1.0, 4.5};
we can see that a and b are the only arrays that have the same elements.
Problem 2
Write a piece of code that determines whether the elements of an array are contained in a
second array. For example, given the following two arrays:
int[] a = {10, 20}; int[] b = {5, 7, 20, 3, 10};
we can see that all the elements of a are present in b.
Problem 3
Write a piece of code that appends the contents of one array to the end of another. A new
array (with a length corresponding to sum of the lengths of the originals arrays) should be
created.
