Video description
Learn so you can see it with your eyes closed
About This Video
- Data Structures and Algorithms are best learnt visually - high-quality courses available at super low prices
In Detail
This is an animated, visual and spatial way to learn data structures and algorithms. Our brains process different types of information differently - evolutionary we are wired to absorb information best when it is visual and spatial i.e. when we can close our eyes and see it. More than most other concepts, Data Structures and Algorithms are best learnt visually. These are incredibly easy to learn visually, very hard to understand most other ways. This course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at Google, Microsoft and Flipkart What's Covered: Big-O notation and complexity, Stacks, Queues, Trees, Heaps, Graphs and Graph Algorithms, Linked lists, Sorting, Searching.
Who this book is for
Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they workYep! Experienced software engineers who are looking to refresh important fundamental concepts
Publisher resources
Table of contents
- Chapter 1 : What this course is about
- Chapter 2 : Data Structures And Algorithms - A Symbiotic Relationship
- Chapter 3 : Complexity Analysis and the Big-O Notation
- Chapter 4 : Linked Lists
- Chapter 5 : Stacks And Queues
- Chapter 6 : Sorting and Searching
- Chapter 7 : Binary Trees
- Chapter 8 : Binary Search Trees
- Chapter 9 : Binary Tree Problems
- Chapter 10 : Heaps
- Chapter 11 : Revisiting Sorting - The Heap Sort
- Chapter 12 : Heap Problems
- Chapter 13 : Graphs
- Chapter 14 : Graph Algorithms
-
Chapter 15 : Shortest Path Algorithms
- Introduction To Shortest Path In An Unweighted Graph - The Distance Table
- The Shortest Path Algorithm Visualized
- Implementation Of The Shortest Path In An Unweighted Graph
- Introduction To The Weighted Graph
- Shortest Path In A Weighted Graph - A Greedy Algorithm
- Dijkstra's Algorithm Visualized
- Implementation Of Dijkstra's Algorithm
- Introduction To The Bellman Ford Algorithm
- The Bellman Ford Algorithm Visualized
- Dealing With Negative Cycles In The Bellman Ford Algorithm
- Implementation Of The Bellman Ford Algorithm
- Chapter 16 : Spanning Tree Algorithms
- Chapter 17 : Graph Problems
Product information
- Title: From 0 to 1: Data Structures & Algorithms in Java
- Author(s):
- Release date: September 2017
- Publisher(s): Packt Publishing
- ISBN: 9781788626767
You might also like
book
Java Coding Problems
Develop your coding skills by exploring Java concepts and techniques such as Strings, Objects and Types, …
book
The Complete Coding Interview Guide in Java
Explore a wide variety of popular interview questions and learn various techniques for breaking down tricky …
video
React - The Complete Guide (Includes Hooks, React Router, and Redux) - Second Edition
**This course is now updated for the latest version of React—React 18** React.js is the most …
book
Java Challenges: 100+ Proven Tasks that Will Prepare You for Anything
Expand your knowledge of Java with this entertaining learning guide, which features 100+ exercises and programming …