Data Structures in Java Course

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

We have several options for you to join this course:

1. Virtual In-house 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.

• Example 1: Course with 8 students taught remotely via video conference, price is €2976. Price per student is €372.
• Example 2: Course with 12 students taught remotely via video conference, price is €3516. Price per student is €293.
• Example 3: Course with 24 students taught remotely via video conference, price is €6756. Price per student is €281.

Please contact us if you have any questions.

2. In-person In-house Course:

Presented at your company in-person by one of our Certified JavaSpecialist Instructors. Price is €4380 for up to 10 students, above that is an additional €400 per student, plus the travel expenses of the instructor. Note that for in-person in-house courses, we need a minimum of three consecutive training days.

• Example 1: Course with 8 students taught on-site at your company, price is €4380. Price per student is €547.
• Example 2: Course with 12 students taught on-site at your company, price is €5180. Price per student is €431.
• Example 3: Course with 18 students taught on-site at your company, price is €7580. Price per student is €421.

Please contact us if you have any questions.

2. Open Enrollment Classroom Course:

We occasionally offer this course as a classroom course in Chania on the Island of Crete. Price for the course is €949 per student.

We also offer this course as an open enrollment live remote course that you can attend from anywhere. Price is €649 per student.

Please contact us if you have would like to make a booking or if you have any questions.

4. Self-Paced Course:

This course is also available as a self-paced course.

Please contact us if you have any questions.

* Prices exclude EU VAT and withholding taxes where applicable. Please contact us for an exact quote for your country.

Open Courses

All our courses are offered as in-house courses. Please contact us on heinz@javaspecialists.eu.

* 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:

• 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