Arrays, collections and data structures

Author: AnghelLeonard

Chapter05/P108_VectorTerminology/README.md

@@ -0,0 +1,2 @@
+# Covering Vector API structure and terminology:
+Explain with examples the Vector API terminology. Cover notions such as element type, shape, species, lanes, and so on.

Chapter05/P109_SimpleSummingArrays/README.md

@@ -0,0 +1,2 @@
+# Summing two arrays via Vector API:
+Write an application that uses Vector API for summing up two Java arrays.

Chapter05/P109_SummingArrays/README.md

@@ -0,0 +1,2 @@
+# Summing two arrays via Vector API:
+Write an application that uses Vector API for summing up two Java arrays.

Chapter05/P110_SummingArraysUnrolled/README.md

@@ -0,0 +1,2 @@
+# Summing two arrays unrolled via Vector API:
+Write an application that uses Vector API for summing two Java arrays using the unrolled technique. 

Chapter05/P111_BenchmarkVectors/README.md

@@ -0,0 +1,2 @@
+# Benchmarking Vector API:
+Consider two given arrays, x[], y[]. Write an application that benchmark the computation z[] = x[] + y[], w[] = x[] * z[] * y[], k[] = z[] + w[] * y[] using plain Java and Vector API.

Chapter05/P112_VectorApiAndFma/README.md

@@ -0,0 +1,2 @@
+# Applying Vector API to compute FMA:
+Provide a Vector API implementation of the famous Fused Multiply Add (FMA).

Chapter05/P113_MultiplyingMatricesVectorApi/README.md

@@ -0,0 +1,2 @@
+# Multiplying matrices via Vector API:
+Write a Vector API implementation for multiplying two matrices. 

Chapter05/P114_NegativeEffectVectorApi/README.md

@@ -0,0 +1,2 @@
+# Hooking the image negative filter with Vector API:
+Write a program that uses Vector API to apply the negative filter to an image.

Chapter05/P115_FactoryMethodsForCollections/README.md

@@ -0,0 +1,2 @@
+# Dissecting factory methods for collections:
+Exemplify several approaches for creating unmodifiable/immutable maps, lists, and sets in Java.

Chapter05/P116_StreamToList/README.md

@@ -0,0 +1,2 @@
+# Getting a list from a stream:
+Provide several snippets of code useful for collecting Stream content into a Java List.

Chapter05/P117_newHashMap/README.md

@@ -0,0 +1,2 @@
+# Handling map capacity:
+Explain what the capacity of a Java Map is and how it can be used to control the number of effective mappings.

Chapter05/P118_SequencedCollectionsAddFirstLast/README.md

@@ -0,0 +1,2 @@
+# Tackling Sequenced Collections:
+Provide a deep dive into the JDK 21 Sequenced Collections API. Exemplify this API on your favorite Java collections and explain what the alternatives before this API are.

Chapter05/P118_SequencedCollectionsGetFirstLast/README.md

@@ -0,0 +1,2 @@
+# Tackling Sequenced Collections:
+Provide a deep dive into the JDK 21 Sequenced Collections API. Exemplify this API on your favorite Java collections and explain what the alternatives before this API are.

Chapter05/P118_SequencedCollectionsRemove/README.md

@@ -0,0 +1,2 @@
+# Tackling Sequenced Collections:
+Provide a deep dive into the JDK 21 Sequenced Collections API. Exemplify this API on your favorite Java collections and explain what the alternatives before this API are.

Chapter05/P118_SequencedCollectionsReverse/README.md

@@ -0,0 +1,2 @@
+# Tackling Sequenced Collections:
+Provide a deep dive into the JDK 21 Sequenced Collections API. Exemplify this API on your favorite Java collections and explain what the alternatives before this API are.

Chapter05/P119_TheRopeDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Rope data structure:
+Explain what the Rope data structure is and provide a Java implementation for its main operations (index, insert, delete, concatenation, and split).

Chapter05/P120_TheSkipListDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Skip List data structure:
+Explain and exemplify the Skip List data structure.

Chapter05/P121_TheKDTreeDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the K-D-trees data structure:
+Provide a brief introduction of K-D Trees and a Java implementation for 2-D Trees.

Chapter05/P122_TheZipperDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Zipper data structure:
+Explain and exemplify on a tree the Zipper data structure.

Chapter05/P123_TheBinomialHeapDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Binomial Heap data structure:
+Provide a deep coverage of a Binomial Heap data structure. Explain its main operations and exemplify them in a Java implementation.

Chapter05/P124_TheFibonacciHeapDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Fibonacci Heaps data structure:
+Explain and exemplify the Fibonacci Heap data structure.

Chapter05/P125_ThePairingHeapDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Pairing Heaps data structure:
+Explain and exemplify the Pairing Heap data structure.

Chapter05/P126_TheHuffmanCodingDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Huffman Coding data structure:
+The Huffman Coding algorithm was developed by David A. Huffman in 1950. Explain its usage and exemplify it via a Java implementation.

Chapter05/P127_TheSplayTreeDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Splay Tree data structure:
+A Splay Tree is a flavor of Binary Search Tree (BST). Explain what its particularities are and provide an implementation of its main operations.

Chapter05/P128_TheIntervalTreeDS/README.md

@@ -0,0 +1,2 @@
+# Introducing the Interval Tree data structure:
+An Interval Tree is another flavor of Binary Search Tree (BST). Highlight its usage and exemplify it via a Java implementation.

Chapter05/P129_TheUnrolledLinkedListDS_1/README.md

@@ -0,0 +1,2 @@
+# Introducing the Unrolled Linked List data structure:
+Explain and exemplify the Unrolled Linked List data structure.

Chapter05/P129_TheUnrolledLinkedListDS_2/README.md

@@ -0,0 +1,2 @@
+# Introducing the Unrolled Linked List data structure:
+Explain and exemplify the Unrolled Linked List data structure.

Chapter05/P130_TheJoinAlgorithms/README.md

@@ -0,0 +1,2 @@
+# Implementing joins algorithms:
+There are three famous join algorithms: Nested Loop Join, Hash Join, and Sort Merge Join. Explain and exemplify each of them on two tables that are involved in a one-to-many relationship.