Dr Heinz M. Kabutz – JGym.IO Live – Data Structures in Java – 9-10 February 2021

Java has an overwhelming number of interfaces and classes in the java.util.** packages. It comes equipped with Collection, Map, List, Queue, Deque, BlockingQueue, Iterator and Iterable. And those are just some of the interfaces. We have a bunch of abstract classes, plus the implementations that we all know and love: HashMap and ArrayListPurchase Dr Heinz M. Kabutz – JGym.IO Live – Data Structures in Java – 9-10 February 2021 courses at here with PRICE $497 $92Dr Heinz M. Kabutz – JGym.IO Live – Data Structures in Java – 9-10 February 2021Java has an overwhelming number of interfaces and classes in the java.util.** packages. It comes equipped with Collection, Map, List, Queue, Deque, BlockingQueue, Iterator and Iterable. And those are just some of the interfaces. We have a bunch of abstract classes, plus the implementations that we all know and love: HashMap and ArrayList. Java programmers typically use only a small number of these collection classes. Often they choose inappropriate ones.In this course, we explore all the interfaces and classes that Java offers in the latest JDK collection framework. We will look at what each collection costs in terms of memory and performance. At the end, you will have a much better idea of what collections to use and when. You will also know how to write your own collections. This course is also available for self-study or as a booked in-house course.Some of the questions we will answer include: Which is the best Collection to use in Java? When do you need to employ ConcurrentSkipListSet? What is the computational time complexity of WeakHashMap?This course includes two live sessions of 4 hours each on the 9th and 10th of February 2021 with Dr Heinz M. Kabutz. Each data structure has exercises to solve. Heinz shows model solutions and is always happy to answer your questions.What you’ll learn – and how you can apply itIs ArrayList better than LinkedList? What is the difference in space complexity between the two classes?When should we use LinkedList vs ArrayList vs CopyOnWriteArrayList?The memory footprint of various collections.By looking at hashing closely, we can learn how to spot bad hashes.We speed up hashing by 3x by using a good hash for HashMap and ConcurrentHashMap.We learn when to use which concurrent classes and which to avoid.Good techniques for measuring costs of collections.Computational time complexity of lookups and other operations.How biased locking affects our collection choices from Java 15 onwards.Why do we have UnsupportedOperationException.How ConcurrentModificationException came about and what to do about it.Choosing the correct collection can make our code more succinct. For example, the new List.of() syntax in Java 9 is better at creating immutable lists.Converting Maps to Sets.Compound operations on Maps.WeakHashMap, LinkedHashMap, LinkedHashSet, IdentityHashSet, ConcurrentSkipListSet and other collections we hardly use.How do these LIVE classes work?Our LIVE classes consist of two 4-hour sessions. They are highly interactive, with exercises, discussions, and walkthroughs of the solutions. Sessions are not recorded. We welcome questions at any time during the live session.Each 4-hour session runs from 7am to 11am Los Angeles Time.Once you enrol in this course, we will sign you up for the webinar. Our system will send you login details. These are personal to you so please do not share them (otherwise you might lose access to the course).LIVE Class Calendar Course Outline0: WelcomeWelcome to the course and how to get the most from your learning1: Introduction to Collections in Java1.1: ListsO(1), O(n), O(n2), O(log n), O(n * log n)1.2: ArraysPrimitive vs object arraysMemory usage and layoutMulti-dimensional arrays2: Lists2.1: ListsArrays.asList()Quick look at the List methodsOptional methodsasList() vs List.of()RandomAccess2.2: ArrayListAdding four seasonsindexOf() and contains()size() vs elementData.length in debuggerremoveIf()2.3: IterationEnumeration bugsFail fast collectionforEach()2.4: CopyOnWriteArrayListSafe iteration2.5: LinkedListNode memory usageAccessing middle of list3: Sorting3.1: Sorting list of Strings3.2: Sorting custom classes like StudentComparing ints and longsWriting Comparators as anonymous classes3.3: Comparators with extractor functionsType witnessesDeclared lambda parametersMethod references3.4: Sorting performance ArrayList vs LinkedListParallel sorting of ArrayList4: Sets4.1: SetsSet.of()union with addAll()intersection with retainAll() or stream/filter4.2: TreeSetSorted by natural orderRed-black treeUnbalanced tree O(n) vs O(log n)Counting maximum tree depth4.3: ConcurrentSkipListSetThread-safe sorted set4.4: CopyOnWriteArraySetFor very small sets5: Hashing5.1: HashingWriting very basic hashtableClashes and distribution% vs &5.2: HashSethashCode() vs identityHashCode()Pixel and good hash codeBucket collisionsMaking keys implement Comparable5.3: ConcurrentHashMap.newKeySet()6: Maps6.1: Mapsone-to-one dictionary6.2: HashMapHistory of hashing 1.2, 1.4, 1.8+Building a hash code with bit shifting Person(name,day,month,year)Cached hash code in StringsMapClashInspectorCreating maps of numberscomputeIfAbsent() for List of values6.3: ConcurrentHashMapAlways useCompound operations review6.4: TreeMaphashCode(), equals() and compareTo()Own Comparator6.5: ConcurrentSkipListMapParallel put into TreeMap vs ConcurrentSkipListMap6.6: LinkedHashMap and LinkedHashSet6.7: Highly Specialized CollectionsEnumSet, EnumMap, IdentityHashMap, Properties, WeakHashMap7: Queues and Deques7.1: Queues and DequesNot always FIFO7.2: ConcurrentLinkedQueue and ConcurrentLinkedDequeGeneral purpose MPMC queuessize() is O(n)7.3: ArrayDequeGrows, does not shrink7.4: BlockingQueues7.5: LinkedBlockingQueue and LinkedBlockingDequeLock splitting7.6: ArrayBlockingQueueCompact array structure7.7: Highly specialized queuesDelayQueue, SynchronousQueue, LinkedTransferQueue, PriorityQueue and PriorityBlockingQueue8: Collection Facadesjava.util.Collectionsjava.util.Arrays9: Wrap-UpCourse wrap-up and next stepsPreparationThis training is aimed at junior to intermediate Java programmers wanting to learn what Java data structures are available and how to best use them.Students should download and install the exercises found in the Resources chapter of the course materialRecommended ReadingSign up to The Java Specialists’ Newsletter for lots of tips on the latest Java developments: https://www.javaspecialists.eu/archiveYour InstructorDr Heinz M. KabutzHeinz Kabutz is the author of The Java Specialists’ Newsletter, a publication enjoyed by tens of thousands of Java experts in over 145 countries. His book “Dynamic Proxies (in German)” was #1 Bestseller on Amazon.de in Fachbücher für Informatik for about five minutes until Amazon fixed their algorithm. Thanks to a supportive mother, he has now sold 5 copies.Heinz’s Java Specialists’ newsletter is filled with amusing anecdotes of life on the Island of Crete. He is a popular speaker at all the best Java conferences around the world, and also at some of the worst. He teaches Java courses in classrooms around the world, where his prime objective is to make absolutely sure that none of his students fall asleep. He is not always successful.Sales PageArchive PagePurchase Dr Heinz M. Kabutz – JGym.IO Live – Data Structures in Java – 9-10 February 2021 courses at here with PRICE $497 $92