Instructional Video13:02
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Design A Course Schedule Considering Pre-reqs For Courses

Higher Ed
Given a course list and pre-reqs for every course design a course schedule so pre-reqs are done before the courses. This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in Java".null
Instructional Video8:15
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Implementation Of Dijkstra's Algorithm

Higher Ed
The implementation of Dijkstra's algorithm in Java. This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We...
Instructional Video3:29
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Introduction To The Weighted Graph

Higher Ed
Graphs whose edges have a weight associated are widely used to model real world problems (traffic, length of path etc). This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...
Instructional Video6:19
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Implementation Of The Shortest Path In An Unweighted Graph

Higher Ed
Shortest path implementation in Java. This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We implement...
Instructional Video6:57
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Implementation Of Topological Sort

Higher Ed
Here is the code in Java to implement topological sort. This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Topological sort is an ordering of vertices in a graph where a...
Instructional Video17:54
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Graph Using An Adjacency List And Adjacency Set

Higher Ed
Learn about adjacency list and the adjacency set which are alternate ways to represent a graph. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces you to various...
Instructional Video15:25
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Graph Using An Adjacency Matrix

Higher Ed
The graph vertices are rows and columns of the matrix and the cell value shows the relationship between the vertices of a graph. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The...
Instructional Video17:43
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Heap Sort Phase II - The Actual Sort

Higher Ed
Phase II actually outputs the final sorted array. It involves removing the elements from the heap and placing it in a sorted array. This clip is from the chapter "Revisiting Sorting - The Heap Sort" of the series "From 0 to 1: Data...
Instructional Video16:35
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Insert And Remove From A Heap

Higher Ed
Learn to add and remove elements from a heap. This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we learn about Heap data structure, build a real heap in Java and...
Instructional Video12:40
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Meet The Binary Heap - It's A Tree At Heart

Higher Ed
The Binary Heap is logically a Binary Tree with specific constraints. The heap property and the shape property determine whether a Binary Tree is really a Heap. This clip is from the chapter "Heaps" of the series "From 0 to 1: Data...
Instructional Video17:16
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - The Heap Is Just The Best Way to Implement a Priority Queue

Higher Ed
Learn more about common operations on a Priority Queue are insertion, accessing the highest priority element and removing the highest priority element. This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures &...
Instructional Video4:38
Curated Video

Machine Learning Random Forest with Python from Scratch - Types of Learning

Higher Ed
Here, we will understand the learning types, including supervised and unsupervised machine learning algorithms. This clip is from the chapter "Introduction to Machine Learning" of the series "Machine Learning: Random Forest with Python...
Instructional Video3:02
Curated Video

No-Code Machine Learning Using Amazon AWS SageMaker Canvas - What Is SageMaker and How Is It Used for Machine Learning?

Higher Ed
In this video, we will understand SageMaker and how it is used for machine learning. This clip is from the chapter "Introduction to SageMaker" of the series "No-Code Machine Learning Using Amazon AWS SageMaker Canvas".In this section, we...
Instructional Video2:22
Curated Video

C++ 20 (2a) New Features - What’s New in Ranges

Higher Ed
Ranges do not act as a glue between containers and constrained algorithms. They provide composability and non-modifying views with lazy evaluation. • Define what a range is • Define the difference between a view and a container •...
Instructional Video11:59
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Dictionaries, sets and tuples

Higher Ed
Learning the basics of building a class from scratch and special __init__ method This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python...
Instructional Video6:27
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Lists - an in-depth look 2

Higher Ed
A quick look at using the command line/terminal window to navigate file directories This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python...
Instructional Video17:31
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Topological Sort In A Graph

Higher Ed
This video will make things easy to follow. Topological sort is widely used in real world problems. This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Topological sort is an...
Instructional Video3:13
Curated Video

Python for Deep Learning - Build Neural Networks in Python - What is Deep Learning?

Higher Ed
In this video, we will understand what deep learning is. This clip is from the chapter "Introduction to Deep Learning" of the series "Python for Deep Learning — Build Neural Networks in Python".In this section, we will take a quick...
Instructional Video11:48
Curated Video

Practical Data Science using Python - Introduction to Machine Learning

Higher Ed
This video introduces you to machine learning. This clip is from the chapter "Machine Learning" of the series "Practical Data Science Using Python".This section explains machine learning.
Instructional Video14:52
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Building if, elif, else blocks incrementally

Higher Ed
Take a program and build a function step by step This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python in-depth.
Instructional Video16:59
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Exploring Jupyter Notebooks interface (optional)

Higher Ed
A detailed look at using Jupyter Notebooks for developing Python code This clip is from the chapter "Development environment setup" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section describes the...
Instructional Video13:52
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Depth First - In-Order and Post-Order Traversal

Higher Ed
Depth first traversal can be of 3 types based on the order in which the node is processed relative to it's left and right sub-trees. This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures & Algorithms in...
Instructional Video14:11
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Meet The Queue - A Familiar Sight In Everyday Life

Higher Ed
Learn more about queues which are much more intuitive as there are plenty of real world examples where a queue is the fair and correct way of processing. This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data...
Instructional Video14:56
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Graph Traversal - Depth First And Breadth First

Higher Ed
Common traversal methods of trees apply to graphs as well. There is an additional wrinkle with graphs, dealing with cycles and with unconnected graphs. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures &...