Oreilly - Advanced Data Structures and Algorithms in Java 9
by Debasish Ray Chawdhuri | Released August 2017 | ISBN: 9781788624213
Explore the world of advanced algorithms with Java 9About This VideoThis video provides complete coverage of reactive and functional data structuresBased on the latest version of Java 9, this video illustrates the impact of its new features on data structuresMaster important concepts such as Dynamic ProgrammingIn DetailAdvanced Data Structures and Algorithms in Java 9 covers classical, functional, and reactive data structures, giving you the ability to understand computational complexity, solve problems, and write efficient code. This video is based on the Zero Bug Bounce milestone of Java 9.We start off with the basics of algorithms and data structures, helping you understand the fundamentals and measure complexity. You will also get a clear picture of reactive programming, binary searches, sorting, search trees, undirected graphs, and a whole lot more! Show and hide more
- Chapter 1 : Efficient Sorting – Quicksort and Mergesort
- The Course Overview 00:03:30
- Quicksort 00:07:57
- Mergesort 00:06:31
- Chapter 2 : Concepts of Tree
- A Tree Data Structure 00:10:01
- The Tree Abstract Data Type 00:02:09
- Binary Tree 00:06:52
- Chapter 3 : More About Search – Search Trees and Hash Tables
- Binary Search Tree 00:13:27
- Self-Balancing Binary Search Tree 00:10:28
- Red-Black Tree 00:11:12
- Hash Tables 00:05:19
- Chapter 4 : Advanced General Purpose Data Structures
- Priority Queue ADT and Heap 00:08:58
- Linked Heap 00:05:47
- Binomial Forest 00:11:53
- Sorting Using a Priority Queue and In-Place Heap Sort 00:03:35
- Chapter 5 : Concepts of Graph
- What is a Graph? 00:04:19
- The Graph ADT and Adjacency Matrix 00:17:49
- Adjacency List 00:16:21
- Chapter 6 : Reactive Programming
- Producer-Consumer Model 00:28:17
- Functional Way of Reactive Programming 00:11:58
Show and hide more