| Chapter 1 - Getting Started With Data Structures and Algorithms | |||
| 001-The Course Overview-git.ir.mp4 | 5.09 MB | ||
| 002-Technology Setup-git.ir.mp4 | 8.56 MB | ||
| Chapter 2 - Creating Efficiency with Strings | |||
| 003-Using String Data Structures for Word Processing-git.ir.mp4 | 13.28 MB | ||
| 004-Searching Strings in Large Documents-git.ir.mp4 | 34.28 MB | ||
| 005-Sorting Strings to Organize Output-git.ir.mp4 | 24.35 MB | ||
| 006-Summary of String Data Structure and Related Algorithms-git.ir.mp4 | 2.19 MB | ||
| Chapter 3 - Working with Arrays | |||
| 007-Using the Array Data Structure to Track Student Grades-git.ir.mp4 | 26.45 MB | ||
| 008-Searching Arrays to Evaluate Grade Ranges-git.ir.mp4 | 51.16 MB | ||
| 009-Sorting Arrays to Optimize Performance-git.ir.mp4 | 30.25 MB | ||
| 010-Summary of Array Data Structure and Related Algorithms-git.ir.mp4 | 3.43 MB | ||
| Chapter 4 - Using Linked Lists | |||
| 011-Using the Linked List Data Structure to Create a Repository-git.ir.mp4 | 19.54 MB | ||
| 012-Searching Linked Lists for Matching Criteria-git.ir.mp4 | 29.32 MB | ||
| 013-Sorting Linked Lists to Optimize Performance-git.ir.mp4 | 17.39 MB | ||
| 014-Summary of the Linked Lists Data Structure and Related Algorithms-git.ir.mp4 | 4.52 MB | ||
| Chapter 5 - Sorting Stacks and Queues | |||
| 015-Using Stacks and Queues Data Structure to Demonstrate LIFO and FIFO Principles-git.ir.mp4 | 23.41 MB | ||
| 016-Searching Stacks and Queues to Determine the Next Appropriate Data for Processing-git.ir.mp4 | 18.01 MB | ||
| 017-Sorting Stacks and Queues to Optimize Performance-git.ir.mp4 | 16.12 MB | ||
| 018-Summary of Stacks and Queues Data Structure and Related Algorithms-git.ir.mp4 | 4.65 MB | ||
| Chapter 6 - Implementing Trees | |||
| 019-Using the Tree Data Structure to Store Hierarchical Information-git.ir.mp4 | 5.6 MB | ||
| 020-Inserting and Deleting Tree Nodes-git.ir.mp4 | 22 MB | ||
| 021-Searching Trees to Determine Hierarchy-git.ir.mp4 | 11.49 MB | ||
| 022-Summary of the Tree Data Structure and Related Algorithms-git.ir.mp4 | 4.72 MB | ||
| Chapter 7 - Hash Maps | |||
| 023-Using the Hash Map Data Structure to Demonstrate Key Value Pairs-git.ir.mp4 | 13.14 MB | ||
| 024-Searching Hash Maps to Determine Index Values-git.ir.mp4 | 36.38 MB | ||
| 025-Sorting Hash Maps to Optimize Performance-git.ir.mp4 | 11.79 MB | ||
| 026-Summary of Hash Map Data Structure and Related Algorithms-git.ir.mp4 | 4.3 MB | ||
| Chapter 8 - Graphs | |||
| 027-Using the Graph Data Structure to Store Relationships-git.ir.mp4 | 18.57 MB | ||
| 028-Traversing Graphs to Determine Relationships-git.ir.mp4 | 16.05 MB | ||
| 029-Shortest Path Algorithm-git.ir.mp4 | 13.06 MB | ||
| 030-Summary of Graph Data Structure and Related Algorithms-git.ir.mp4 | 4.47 MB | ||
| Chapter 9 - Advanced Topics | |||
| 031-Recursion to Implement a Fibonacci Function-git.ir.mp4 | 28.05 MB | ||
| 032-Big O Notation to Describe Performance-git.ir.mp4 | 5.99 MB | ||
| Exercise Files | |||
| 12801_Section 2 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section2 | |||
| Bubble.java | 1.33 KB | ||
| Bubble2.java | 1.85 KB | ||
| Finite.java | 2.5 KB | ||
| Insertion.java | 1.95 KB | ||
| KMP.java | 2.2 KB | ||
| LICENSE | 1.04 KB | ||
| NaiveStringMatching.java | 1.68 KB | ||
| README.md | 51 B | ||
| RabinKarp.java | 2.22 KB | ||
| Selection.java | 2.07 KB | ||
| StringDemo.java | 359 B | ||
| StringDemo2.java | 545 B | ||
| StringDemo3.java | 716 B | ||
| StringDemo4.java | 788 B | ||
| TimeDelta.java | 1.05 KB | ||
| _Template.java | 433 B | ||
| sourcefile.txt | 2.79 KB | ||
| 12801_Section 3 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section3 | |||
| Binary.java | 3.53 KB | ||
| DuplicateChecker.java | 3.27 KB | ||
| DuplicateChecker2.java | 4.98 KB | ||
| LICENSE | 1.04 KB | ||
| Merge.java | 1.58 KB | ||
| Merge2.java | 2.51 KB | ||
| Multiple.java | 2.2 KB | ||
| Quick.java | 6.11 KB | ||
| README.md | 51 B | ||
| Sequential.java | 5.22 KB | ||
| Sequential2.java | 5.28 KB | ||
| Shell.java | 5.77 KB | ||
| Single.java | 990 B | ||
| 12801_Section 4 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section4 | |||
| LICENSE | 1.04 KB | ||
| LinkedListDemo.java | 1.62 KB | ||
| LinkedListDemo2.java | 2.8 KB | ||
| NodeIndexExample.java | 1.97 KB | ||
| README.md | 51 B | ||
| Sequential.java | 2.16 KB | ||
| SortLinkedList.java | 1.92 KB | ||
| 12801_Section 5 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section5 | |||
| LICENSE | 1.04 KB | ||
| QueueSearchDemo.java | 1.14 KB | ||
| QueueSorter.java | 1.38 KB | ||
| QueueStudents.java | 3.46 KB | ||
| README.md | 51 B | ||
| StackCars.java | 1.67 KB | ||
| StackSearchDemo.java | 2.14 KB | ||
| StackSorter.java | 2.23 KB | ||
| 12801_Section 6 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section6 | |||
| LICENSE | 1.04 KB | ||
| README.md | 51 B | ||
| TreeDeletion.java | 2.89 KB | ||
| TreeDemo.java | 891 B | ||
| TreeInsertion.java | 1.74 KB | ||
| TreeSearch.java | 3.51 KB | ||
| 12801_Section 7 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section7 | |||
| CreateHashMap.java | 1.23 KB | ||
| HashMapSearch.java | 2.71 KB | ||
| HashMapSort.java | 3 KB | ||
| LICENSE | 1.04 KB | ||
| README.md | 51 B | ||
| 12801_Section 8 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section8 | |||
| GraphDemo.java | 2.17 KB | ||
| LICENSE | 1.04 KB | ||
| README.md | 51 B | ||
| ShortestPath.java | 3.07 KB | ||
| TraverseDemo.java | 2.35 KB | ||
| TraverseDemo2.java | 2.1 KB | ||
| 12801_Section 9 | |||
| Hands-On-Data-Structures-Algorithms-in-Java-11-Section9 | |||
| Demo1.java | 643 B | ||
| Demo2.java | 722 B | ||
| Demo3.java | 810 B | ||
| Demo4.java | 920 B | ||
| LICENSE | 1.04 KB | ||
| README.md | 51 B |
https://learning.oreilly.com/videos/hands-on-data-structures/9781789805819
Empower you to develop effective and efficient code within minutes
About This Video
Complete coverage of data structures and algorithms to manipulate them effectively and efficiently.
Clear instructions, hands-on activities, and real-world examples empower you to implement best practices in your everyday development work.
Features the Java programming language with support for the JDK 11 release.
In Detail
Programs are created from algorithms and data structures. Mastering these is an essential part of your development as a Java programmer. They are the main building blocks for each architectural pattern. Many tutorials treat data structures & algorithms as theoretical computer science topics. This course relates every technique back to real-world problems and situations you will face working as a programmer. The vision of the course is to get you acquainted with the core and advanced data structures and algorithms used for day-to-day applications. You’ll see how they work and how to use them effectively in your own programs. This course will be full of step-by-step instructions, revealing examples, and clear explanations that will help you understand the practical application of each algorithm with scenario trade-offs. You’ll learn to use querying binary search trees. The course will take you through heapsort, quicksort, recursion, and tail recursion algorithms. You’ll get familiar with multithreading and probabilistic algorithms. You’ll also understand the importance of advanced data structures and graph algorithms. This course will help you to gain in-demand knowledge of key data structures and algorithms and prepare you for the next stage in your career as a developer.
All the code and supporting files for this course are available on GitHub at https://github.com/PacktPublishing/Hands-On-Data-Structures-Algorithms-in-Java-11
All Comments