Linked notes have this advantage over a raise for implementing collections?:

1. no capacity issues

2. faster access to elements in the collection

3. easier to program because they rely on pointers

4. none of the above

Assuming you have an initial list L = [x -> z -> y], what is the result of the following code? (Assume that x, z, y are objects contained in nodes, -> is a link between nodes, and y is the last element in a list.)

1. [x -> y -> d]

2. [x -> z -> y -> d]

3. [x -> z -> d]

4. [x -> z -> y]

Assuming you have a class called Cat that compiles correctly, what does the following code do? (You may select more than one answer). Cat kitty = new Cat();

1. It creates a Cat object in a reference variable that points to the object

2. It creates a reference variable that could point to a Cat object or any superclass of Cat

3. it creates a Cat object

4. it creates a reference variable that can point to a cat object or any subclass a Cat

Which statement is true about ArrayList?

1. automatically expand in size as needed [from the end-users programmer's perspective]

2. have to be declared with an initial size

3. can hold primitives

4. cannot be expanded in size once they have been created