Learning Path Java Data Structures & Algorithms With Java 9

What you'll learn
Understand the fundamentals of algorithms, data structures, and complexity measurement
Find out what general-purpose data structures are, including arrays, linked lists, double-ended linked lists, and circular lists
Gain a better understanding of the concept of trees, queues, and graphs
See how to use recursive functions and immutability while understanding them in terms of recursion
Use binary search, sorting, and efficient sorting— quicksort and merge sort
Handle reactive programming and its related data structures
Requirements
Working knowledge on Java is a must
Description
Java 9 data structures and algorithms covers functional and reactive data structures thereby giving you the power to understand computational complexity, solve problems, and write efficient code. So if you are a Java developer who wish to learn data structures and algorithms, then go for this Learning Path.
Packt's Video Learning Paths are a series of individual video products put together in a logical and stepwise manner such that each video builds on the skills learned in the video before it.
The highlights of this Learning Path are
Complete coverage of reactive and functional data structures
Get to know the fundamentals of algorithms, data structures, and complexity measurement
Gain a better understanding of the concept of trees, queues, and graphs
Master important concept such as dynamic programming
Let's take a quick look at your learning journey. You will begin with understanding the basics of Java algorithms and data structures. You will then be introduced to concepts such as arrays, linked lists, stacks, and queues. Next, you will go through the basics of functional programming so that you get used to thinking recursively. This Learning Path provides plenty of examples along the way to help you understand each concept clearly. Finally, you will get a clear picture of reactive programming, binary searches, sorting, search trees, undirected graphs, and a whole lot more.
By the end of this Learning Path, you will be well-versed with data structures and algorithms in Java 9.
Meet Your Experts
We have the best work of the following esteemed author to ensure that your learning journey is smooth
Debasish Ray Chawdhuri is an established Java developer and has been in the industry for the last eight years. He has developed several systems, from CRUD applications to programming languages and big data processing systems. He provided the first implementation of an extensible business reporting language specification, and a product around it, to verify company financial data for the Government of India while he was employed at Tata Consultancy Services Ltd. In Talentica Software Pvt. Ltd., he implemented a domain-specific programming language to easily implement complex data aggregation computations that compiled to Java bytecode. Currently, he leads a team developing a new high-performance structured data storage framework to be processed by Spark. The framework is named Hungry Hippos and will be open-sourced very soon. He also blogs about Java and other computer science-related topics. He has worked for Tata Consultancy Services Ltd., Oracle India Pvt. Ltd., and Talentica Software Pvt. Ltd.
Overview
Section 1: Basic Data Structures and Algorithms in Java 9
Lecture 1 The Course Overview
Lecture 2 The Performance of an Algorithm
Lecture 3 Analysis of Asymptotic Complexity
Lecture 4 Optimizing Our Algorithm
Lecture 5 Arrays
Lecture 6 Linked List
Lecture 7 Doubly Linked List
Lecture 8 Circular Linked List
Lecture 9 Stack
Lecture 10 Queue
Lecture 11 Double-Ended Queue
Lecture 12 Recursive Algorithms
Lecture 13 Lambda Expressions in Java
Lecture 14 Functional Data Structures
Lecture 15 Monads
Lecture 16 Analysis and Performance
Lecture 17 Search Algorithms
Lecture 18 Sorting
Lecture 19 Problem with Recursive Calls
Section 2: Advanced Data Structures and Algorithms in Java 9
Lecture 20 The Course Overview
Lecture 21 Quicksort
Lecture 22 Mergesort
Lecture 23 A Tree Data Structure
Lecture 24 The Tree Abstract Data Type
Lecture 25 Binary Tree
Lecture 26 Binary Search Tree
Lecture 27 Self-Balancing Binary Search Tree
Lecture 28 Red-Black Tree
Lecture 29 Hash Tables
Lecture 30 Priority Queue ADT and Heap
Lecture 31 Linked Heap
Lecture 32 Binomial Forest
Lecture 33 Sorting Using a Priority Queue and In-Place Heap Sort
Lecture 34 What is a Graph?
Lecture 35 The Graph ADT and Adjacency Matrix
Lecture 36 Adjacency List
Lecture 37 Producer-Consumer Model
Lecture 38 Functional Way of Reactive Programming
This Learning Path is targeted at Java developers who wish to learn data structures and algorithms to write Java code efficiently.


Homepage

https://www.udemy.com/course/learning-pathjava-data-structures-algorithms-with-java-9/