Prerequisites

This course is aimed at junior to intermediate Java programmers wanting to learn what Java data structures are available and how to best use them.

Pricing Options

There are several options for you to attend this course:

1. In-house Course:

Presented at your company in-person by one of our Certified JavaSpecialist Instructors. Price is €3200 for up to 10 students, above that is an additional €300 per student, plus the travel expenses of the instructor, plus one teaching assistant. Please contact us if you have any questions.

Note: Due to the current COVID-19 pandemic, in person training is currently unavailable. Please choose Remote Instructor-Led Course instead.

2. Remote Instructor-Led Course:

Presented via video conference to your team of programmers by the author of the course. Price is €2976 for up to 10 students, above that is an additional €270 per student. Because of the extreme circumstances of COVID-19, we are also offering classes for six or more students. These are priced at €2300 for the first 6 students, thereafter an additional €283 per student. These prices are guaranteed until the 31st of May 2021.

Please contact us if you have any questions.

3. Self-Study:

Please see our self-study option for more information.

* Price is excluding EU VAT and withholding taxes where applicable. Please contact us for an exact quote for your country.

Open Courses

* Price is excluding EU VAT where applicable. Please contact us for an exact quote for your country.

Detailed Outline

The emphasis of this training workshop is to learn what data structures modern Java has to offer. Here is our outline:

Schedule

• 0. Welcome
• 1. Introduction to Collections in Java
  • Computational Time and Space Complexity
    • O(1), O(n), O(n²), O(log n), O(n * log n)
  • Arrays
    • Primitive vs object arrays
    • Memory usage and layout
    • Multi-dimensional arrays
• 2. Lists
  • Lists
    • Arrays.asList()
    • Quick look at the List methods
    • Optional methods
      • asList() vs List.of()
    • RandomAccess
  • ArrayList
    • Adding four seasons
    • indexOf() and contains()
    • size() vs elementData.length in debugger
    • removeIf()
  • Iteration
    • Enumeration bugs
    • Fail fast collection
    • forEach()
  • CopyOnWriteArrayList
    • Safe iteration
  • LinkedList
    • Node memory usage
    • Accessing middle of list
• 3. Sorting
  • Sorting lists
    • Sorting list of Strings
    • Sorting custom classes like Student
      • Comparing ints and longs
    • Writing Comparators as anonymous classes
    • Comparators with extractor functions
      • Type witnesses
      • Declared lambda parameters
      • Method references
    • Sorting performance ArrayList vs LinkedList
      • Parallel sorting of ArrayList
• 4. Sets
  • Sets
    • Set.of()
    • union with addAll()
    • intersection with retainAll() or stream/filter
  • TreeSet
    • Sorted by natural order
    • Red-black tree
      • Unbalanced tree O(n) vs O(log n)
      • Counting maximum tree depth
  • ConcurrentSkipListSet
    • Thread-safe sorted set
  • CopyOnWriteArraySet
    • For very small sets
• 5. Hashing
  • Hashing
    • Writing very basic hashtable
    • Clashes and distribution
    • % vs &
  • HashSet
    • hashCode() vs identityHashCode()
    • Pixel and good hash code
    • Bucket collisions
    • Making keys implement Comparable
  • ConcurrentHashMap.newKeySet()
• 6. Maps
  • Maps
    • one-to-one dictionary
  • HashMap
    • History of hashing 1.2, 1.4, 1.8+
    • Building a hash code with bit shifting Person(name,day,month,year)
    • Cached hash code in Strings
    • MapClashInspector
    • Creating maps of numbers
      • computeIfAbsent() for List of values
  • ConcurrentHashMap
    • Always use
    • Compound operations review
  • TreeMap
    • hashCode(), equals() and compareTo()
    • Own Comparator
  • ConcurrentSkipListMap
    • Parallel put into TreeMap vs ConcurrentSkipListMap
  • LinkedHashMap and LinkedHashSet
  • Highly Specialized Collections: EnumSet, EnumMap, IdentityHashMap, Properties, WeakHashMap
• 7 - Queues and Deques
  • Queues and Deques
    • Not always FIFO
  • ConcurrentLinkedQueue and ConcurrentLinkedDeque
    • General purpose MPMC queues
    • size() is O(n)
  • ArrayDeque
    • Grows, does not shrink
  • BlockingQueues
  • LinkedBlockingQueue and LinkedBlockingDeque
    • Lock splitting
  • ArrayBlockingQueue
    • Compact array structure
  • Highly specialized queues: DelayQueue, SynchronousQueue, LinkedTransferQueue, PriorityQueue and PriorityBlockingQueue
• 8 - Collection Facades
  • java.util.Collections
  • java.util.Arrays
• 9 - Wrap-up