Udemy - From 0 to 1: Data Structures & Algorithms in Java

Category: Technical

Tag: Java


Posted on 2019-08-24, by phaelx.

Description



Date: March 2019
Author: Loony Corn

Size: 2.3 GB
Format: MP4
Download     >>    https://usersdrive.com/xhxbdi9e3kjp.html
What you'll learn
   *Visualise - really vividly imagine - the common data structures, and the algorithms applied to them
   *Pick the correct tool for the job - correctly identify which data structure or algorithm makes sense in a particular situation
   *Calculate the time and space complexity of code - really understand the nuances of the performance aspects of code


Course content

What this course is about
   You, This course and Us

Data Structures And Algorithms - A Symbiotic Relationship
   You, This course and Us
   Why are Data Structures And Algorithms important?

Complexity Analysis and the Big-O Notation
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?

Linked Lists
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays

Stacks And Queues
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks

Sorting and Searching
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list

Binary Trees
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal

Binary Search Trees
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree

Binary Tree Problems
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST

Heaps
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap

Revisiting Sorting - The Heap Sort
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort

Heap Problems
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort
   Maximum Element In A Minimum Heap and K Largest Elements In A Stream

Graphs
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort
   Maximum Element In A Minimum Heap and K Largest Elements In A Stream
   Introducing The Graph
   Types Of Graphs
   The Directed And Undirected Graph
   Representing A Graph In Code
   Graph Using An Adjacency Matrix
   Graph Using An Adjacency List And Adjacency Set
   Comparison Of Graph Representations
   Graph Traversal - Depth First And Breadth First

Graph Algorithms
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort
   Maximum Element In A Minimum Heap and K Largest Elements In A Stream
   Introducing The Graph
   Types Of Graphs
   The Directed And Undirected Graph
   Representing A Graph In Code
   Graph Using An Adjacency Matrix
   Graph Using An Adjacency List And Adjacency Set
   Comparison Of Graph Representations
   Graph Traversal - Depth First And Breadth First
   Topological Sort In A Graph
   Implementation Of Topological Sort

Shortest Path Algorithms
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort
   Maximum Element In A Minimum Heap and K Largest Elements In A Stream
   Introducing The Graph
   Types Of Graphs
   The Directed And Undirected Graph
   Representing A Graph In Code
   Graph Using An Adjacency Matrix
   Graph Using An Adjacency List And Adjacency Set
   Comparison Of Graph Representations
   Graph Traversal - Depth First And Breadth First
   Topological Sort In A Graph
   Implementation Of Topological Sort
   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

Spanning Tree Algorithms
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort
   Maximum Element In A Minimum Heap and K Largest Elements In A Stream
   Introducing The Graph
   Types Of Graphs
   The Directed And Undirected Graph
   Representing A Graph In Code
   Graph Using An Adjacency Matrix
   Graph Using An Adjacency List And Adjacency Set
   Comparison Of Graph Representations
   Graph Traversal - Depth First And Breadth First
   Topological Sort In A Graph
   Implementation Of Topological Sort
   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
   Prim's Algorithm For a Minimal Spanning Tree
   Use Cases And Implementation Of Prim's Algorithm
   Kruskal's Algorithm For a Minimal Spanning Tree
   Implementation Of Kruskal's Algorithm

Graph Problems
   You, This course and Us
   Why are Data Structures And Algorithms important?
   Performance and Complexity
   The Big-O Notation
   What is the complexity of these pieces of code?
   The Linked List - The Most Basic Of All Data Structures
   Linked List Problems
   Linked Lists vs Arrays
   Meet The Stack - Simple But Powerful
   Building A Stack Using Java
   Match Parenthesis To Check A Well Formed Expression
   Find The Minimum Element In A Stack In Constant Time
   Meet The Queue - A Familiar Sight In Everyday Life
   The Circular Queue - Tricky But Fast
   Build A Queue With Two Stacks
   Sorting Trade-Offs
   Selection Sort
   Bubble Sort
   Insertion Sort
   Shell Sort
   Merge Sort
   Quick Sort
   Binary Search - search quickly through a sorted list
   Meet The Binary Tree - A Hierarchical Data Structure
   Breadth First Traversal
   Depth First - Pre-OrderTraversal
   Depth First - In-Order and Post-Order Traversal
   The Binary Search Tree - an introduction
   Insertion and Lookup in a Binary Search Tree
   Minimum Value, Maximum Depth And Mirror
   Count Trees, Print Range and Is BST
   The Heap Is Just The Best Way to Implement a Priority Queue
   Meet The Binary Heap - It's A Tree At Heart
   The Binary Heap - Logically A Tree Really An Array
   The Binary Heap - Making It Real With Code
   Heapify!
   Insert And Remove From A Heap
   Heap Sort Phase I - Heapify
   Heap Sort Phase II - The Actual Sort
   Maximum Element In A Minimum Heap and K Largest Elements In A Stream
   Introducing The Graph
   Types Of Graphs
   The Directed And Undirected Graph
   Representing A Graph In Code
   Graph Using An Adjacency Matrix
   Graph Using An Adjacency List And Adjacency Set
   Comparison Of Graph Representations
   Graph Traversal - Depth First And Breadth First
   Topological Sort In A Graph
   Implementation Of Topological Sort
   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
   Prim's Algorithm For a Minimal Spanning Tree
   Use Cases And Implementation Of Prim's Algorithm
   Kruskal's Algorithm For a Minimal Spanning Tree
   Implementation Of Kruskal's Algorithm
   Design A Course Schedule Considering Pre-reqs For Courses
   Find The Shortest Path In A Weighted Graphs - Fewer Edges Better


Sponsored High Speed Downloads
5906 dl's @ 2644 KB/s
Download Now [Full Version]
7449 dl's @ 3268 KB/s
Download Link 1 - Fast Download
6975 dl's @ 3067 KB/s
Download Mirror - Direct Download



Search More...
Udemy - From 0 to 1: Data Structures & Algorithms in Java

Search free ebooks in ebookee.com!


Links
Download this book

No active download links here?
Please check the description for download links if any or do a search to find alternative books.


Related Books


Comments

No comments for "Udemy - From 0 to 1: Data Structures & Algorithms in Java".


    Add Your Comments
    1. Download links and password may be in the description section, read description carefully!
    2. Do a search to find mirrors if no download links or dead links.
    Back to Top