ITEC 104 REVIEW

a collection of elements, each of which is unique.

• Set

• Union

• HashMap

• Subset

The union of two (2) sets (A ∪ B) is the set that contains all the elements in either set.

Example: {1, 3, 5, 7} ∪ {2, 3, 4, 5} = {1, 2, 3, 4, 5, 7}

• Intersection

• Union

• Difference

• Subset

The intersection of two (2) sets (A ∩ B) is the set that contains only the

elements common to both sets.

Example: {1, 3, 5, 7} ∩ {2, 3, 4, 5} = {3, 5}

• Instersection

• Difference

• Subset

• Union

The difference of sets A and B (A – B) is the set that contains the elements that

are in A but not in B.

Example: {1, 3, 5, 7} – { 2, 3, 4, 5} = {1, 7}

• Subset

• Union

• Intersection

• Difference

Set A is a subset of set B (A ⊂ B) if every element of set A is also an element of

set B.

Example: {1, 3, 5, 7} ⊂ {1, 2, 3, 4, 5, 7} = true

• Union

• Set

• Subset

• Intersection

This stores its elements in a hash table without a guaranteed order

upon iteration. This is the best-performing implementation.

• Empty Set

• LinkedHashSet

• HashSet

• TreeSet

This stores its elements in a special type of tree where elements are

sorted (natural or custom) during iteration.

• TreeSet

• LinkedHashSet

• HashSet

• EmptySet

is a collection of ordered

pairs in which the elements are

referred to as keys (identifiers) and

values (content).

• Map

• HashMap

• HashSet

• Set

A map cannot contain duplicate keys.

• True

• False

three (3) general-purpose map

implementations in Java:

• HashMap, TreeMap, and LinkedHashMap

• HashMap, SubSet, and TreeMap

• TreeMap, HashSet, and HashMap

• HashMap, LinkedHashMap, and TreeSet