It would behoove you to understand the differences between the major Collection classes, but it is not essential to understand the underlying implementation of said classes. For example, it would be good to understand the difference between an ArrayList and a LinkedList, but you need not worry about how an ArrayList is implemented as compared to a LinkedList.
Honestly, I would say it is more important to understand the major interfaces that these classes implement, such as List, Set, and Map.
When you get the score card after the test, one of the section against which % rating given is "Collections", If you have K&B read the chapter thorough you are sure to clear 75% if not less.
Cheers<br /> <br />What's with the bottom line.<br />_ _ ____________________ _ _<br />SCJP 1.4, SCBCD 1.3, Prepping for SCEA.....
Joined: Feb 15, 2003
When you get the score card after the test, one of the section against which % rating given is "Collections", If you have K&B read the chapter thorough you are sure to clear 75% if not less. This is my exam experience, ofcourse i scored 100% in collections
I agree with Corey make sure you don't confuse interfaces and the classes when answering question. It may seem very easy, but under stress you may choose Map when question is asking "Which class ..." understand hashcode() and equals() very very very well. Know which collection to use when, iterators and enumerations. Know which collections are ordered, which are sorted, etc. I think it will help not to get confused if you know how ech collection is built (linked, hashed, tree, etc.) I don't think you need to know any algorithms (other than how hashing works and that tree means sorted), didn't see questions on algorithms in book or mock exams. I read K&B only, and got 100% on collections.
subject: Do we need to study Collection Algorithms?