Java Programming - Objects and Collections - Discussion

In what way are they ordered?
I run:

java.util.ArrayList<Integer> al = new java.util.ArrayList<Integer>();
al.add(4);
al.add(3);
al.add(5);

for (Integer i : al) {
System.out.println(i);
}

And I get
4
3
5
as output. Is that ordered?

I think this question might have a wrong answer. I see no mention of ordering in the docs and as John says above testing it shows it not to be ordered.

In arrayList The colection are ordered in which order they are inserted.

Yes whatever david is exactly right.

Arraylist elements will not be in an order.

So, answer is wrong.

Yes, as @Rahul said the insertion order is preserved. So answer is correct.

ArrayList are meant for random access and they are not in ordered form.

ArrayList are not automatically sorted (unlike TreeSet).

ArrayList are ordered, it keep the same insertion order (unlike HashSet).

Saying that an ArrayList is ordered is wrong, or at least deceiving. The *insertion order* is preserved if you append an object by calling add (E) , but that's quite different, and the definition of "ordered", used in the question, usually refers to the element values (natural ordering).

I would also say that the statement "the elements in the collection are ordered" is deceiving or at least not very clear. They certainly keep their position as long as only insertions are performed on the list (which is of course not guaranteed and the question doesn't say anything about how it will be used). But they most certainly will not be in their natural ordering.

B and C are definitely false. So answer D seems the most correct. All elements have a unique key (namely their index). Although if we consider multiple int's with the same values, than perhaps this statement is a bit problematic as well.

The answer is D. ArrayList has a unique key access, and a key is index of array.

If test maker wants to get A for this question they need to clarify or change the test.