A class such as ArrayList that takes a type parameter to indicate what kind of values will be used.

An object in java that accepts another type as part of itself

A collection that stores a list of elements in small object containers called nodes, which are linked together.

Strengths: excells in add/removes

Weaknesses:  No random access

A specification of a type of data and the operations that can be performed on it.

• Cannot be instantiated

A connection between two objects where one has a field that refers to the other. The contained object acts as part of the containing objects state.

What is the problem with the following code:

for (String s:Words)

{

     if (s.equals("hello"))

     {

         Words.add("goodbye");

     }

}

You cannot change the list in any way while iterating through it with the "for each"

What is the problem with the following code:

ArrayList numbers = new ArrayList();

Comparable

???? NEED MORE INFO ???

1. add(element)
2. addAll(collection)
3. clear()
4. contains()
5. containsAll()
6. isEmpty()
7. iterator()
8. remove(element)
9. removeAll(collection)
10. retainAll(collection)
11. size()
12. toArray()

1. hasNex()
2. next()
3. remove()

1. random access: an element can be accessed quickly
2. adding and removing at the end of the list is fast

1. adding and removing at either end is fast
2. fast add/remove suring a sequential access with an iterator
3. no need to expand an array when full
4. can be more easily used as a queue

1. binarySearch(list,value)
2. copy(destinationList, sourceList)
3. fill(list,value)
4. max(list)
5. min(list)
6. replaceAll(list,oldValue,newValue)
7. reverse(list)
8. rotate(list,distance)
9. shuffle(list)
10. sort(list)
11. swap(list,index1,index2)

1. extremely fast performance for add, contains, remove
2. can be used with any type of objects as its elements

1. elements are stored i sorted order
2. must be used with elements that can be compared.

1. union -- addAll
2. intersection  -- retainAll
3. difference -- removeAll
4. superset,subset -- containsAll

1. clear()
2. containsKey(key)
3. containsValue(value)
4. get(key)
5. isEmpty()
6. keySet()
7. put(key,value)
8. putAll(map)
9. remove(key)
10. size()
11. values()

Comparison of ADT and interface name

Lists:   What are the 2 implementations?

1. ArrayList
2. LinkedList

1. HashSet
2. TreeSet

1. HashMap
2. TreeMap

is an O(log N) searching algorithm that operated on a sorted dataset and sucessively eliminates half of the data until the target element is found.