timesquare-recruiter iview

Q: LinkedList ^ ArrayList

Q: what properties of an anonymous innerclass are accessible from outside

Q: why use multiple or custom class loaders?
A:

Q: delegate pattern?
A:

Q: why we need both hashCode() and equals()?
A ( now i think): hashCode() returns a int (instead of a boolean), which is used in more ways than comparing equality. Specifically, it can be used for HashMap.

Q: How does a hashmap grow in reaction to growing content? What parameters controll how it grows?
A: something like load factor

what's a finalizer

Q: what's unreachable by GC
A: (I now think) a /2-pronged/ approach {ref-counting, path-from-root }. Eevery object can be monitored for reference-count. Even if ref-count >=1, it may be unreachable from root-objects.


how does the GC detect an island

what's a mutex

what's a race condition? how do u deal with it?