The quiz will have three questions, and cover material through the end of the Set
topics we’ve gotten to so far.
In the first question, you will show your understanding of simple set theory and notation. For example:
Suppose A = {1, 2, 3} and B = {2, 4, 6}. What is A ∩ B?
{2}
In the second and third questions, you will write a short class or method according to a textual description. For example, a question might state:
Write a method public static <E> List<E> notIn(List<E> list, Set<E> set)
. notIn
should return a list that contains the elements present in list
but not present in set
.
The original list and set must not be modified. For full credit, your method must correctly use generics, and must not contain unnecessary method calls or loops, even if they do not otherwise impact correctness. You may assume List
, Set
, ArrayList
, and HashSet
are correctly imported from java.util
. You may not import other classes.
public static <E> List<E> notIn(List<E> list, Set<E> set) {
List<E> result = new ArrayList<>();
for (E e: list) {
if (!set.contains(e)) {
result.add(e);
}
}
return result;
}
or, if you are a little more fluent in the Java API:
public static <E> List<E> notIn(List<E> list, Set<E> set) {
List<E> result = new ArrayList<>(list);
result.removeAll(set);
return result;
}
Another question might state:
Write a generic class MyList<E>
that extends an existing implementation of List
. MyList
should include a method public List<E> reversed()
. reversed
returns a new list consisting of the elements of the current list in reverse order.
reversed
must not modify the list. For full credit, your method must correctly use generic types, and must not contain unnecessary method calls or loops, even if they do not otherwise impact correctness. You may assume List
and ArrayList
are correctly imported from java.util
. You may not import other classes.
public class MyList<E> extends ArrayList<E> {
public List<E> reversed() {
List<E> reversed = new ArrayList<>();
for (int i = size() - 1; i >= 0; i--) {
reversed.add(get(i));
}
return reversed;
}
}