Instructional Video5:33
Curated Video

C++ Standard Template Library in Practice - Course Review

Higher Ed
The user would like to catch up on what was learned in this section. • Review the topics covered • Show excerpts of the previous slides • Thank the audience for watching This clip is from the chapter "C++ 20 Preview" of the series "C++...
Instructional Video14:39
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Count Trees, Print Range and Is BST

Higher Ed
Count the number of structurally unique binary trees that can be built with N nodes, print the nodes within a certain range in a binary search tree and check whether a certain binary tree is a binary *search* tree. This clip is from the...
Instructional Video14:35
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Depth First - Pre-OrderTraversal

Higher Ed
Depth first traversal can be of 3 types based on the order in which the node is processed relative to its left and right sub-trees. Pre-order traversal processes the node before processing the left and then the right sub trees. This clip...
Instructional Video8:09
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Representing A Graph In Code

Higher Ed
The graph interface allows building up a graph by adding edges and traversing a graph by giving access to all adjacent vertices of any vertex. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures &...
Instructional Video2:55
Economics Explained

High Frequency Trading (Hfts): Reactionary Algorithm

9th - Higher Ed
The New York Stock Exchange is the world's largest and most liquid securities market. It's where many of world's largest companies list their shares to be traded amongst millions of investors worldwide; ranging from small individual...
Instructional Video7:57
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Thank you for taking the course and next steps

Higher Ed
Start building the set_val method and introduce python's hash function This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3: Project-based Python, Algorithms, Data Structures".null
Instructional Video9:19
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - BST - Deleting nodes with 1 child node

Higher Ed
Replace the while loop built in the iterative solution in the prior video with recursive function calls to achieve the same goal This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3:...
Instructional Video9:17
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Intro to search - Linear, Bisection/Binary search

Higher Ed
Modify set_val method to include update functionality This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3: Project-based Python, Algorithms, Data Structures".null
Instructional Video2:50
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Recursion mini-project 3 - Fibonacci series

Higher Ed
Get the list size and range of ints for each list element from the user during program execution This clip is from the chapter "Algorithms - Sort, performance, complexity and big O notation" of the series "Python 3: Project-based Python,...
Instructional Video7:28
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - A look at the recursive divide function

Higher Ed
Implement Quicksort algorithm step by step This clip is from the chapter "Algorithms - Sort, performance, complexity and big O notation" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about...
Instructional Video11:48
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Performance measures - deep dive with a programmatic view

Higher Ed
Analyze execution context and frames created by recursive divide function in-depth This clip is from the chapter "Algorithms - Sort, performance, complexity and big O notation" of the series "Python 3: Project-based Python, Algorithms,...
Instructional Video5:05
Curated Video

C++ Standard Template Library in Practice - Auxiliary Iterator Functions

Higher Ed
We want to know what functions are available for making working with iterators simpler. • Learn what functions are available to make working with iterators more generic • Learn what these different functions can do • Show them in action...
Instructional Video11:11
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Binary Search - search quickly through a sorted list

Higher Ed
Binary search is a pretty nifty way to search through a sorted list in O(Log N) time. This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and...
Instructional Video8:51
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Find The Minimum Element In A Stack In Constant Time

Higher Ed
Learn to keep track of the minimum element of a stack as it changes. This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we build stack function in Java,...
Instructional Video8:43
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Kruskal's Algorithm For a Minimal Spanning Tree

Higher Ed
Kruskal's algorithm is another greedy algorithm to find a minimal spanning tree. This clip is from the chapter "Spanning Tree Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Prim's algorithm is very similar...
Instructional Video12:39
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Introduction To Shortest Path In An Unweighted Graph - The Distance Table

Higher Ed
Graphs with simple edges (directed or undirected) are unweighted graphs. The distance table is an important data structure used to find the shortest path between any two vertices on a graph. This clip is from the chapter "Shortest Path...
Instructional Video15:41
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Introducing The Graph

Higher Ed
Study of graphs and algorithms associated with graphs forms an entire field of study called graph theory. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces you...
Instructional Video7:22
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - Types Of Graphs

Higher Ed
A graph with directed edges forms a Directed Graph and those with undirected edges forms an Undirected Graph. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces...
Instructional Video23:52
Globalive Media

Beyond Innovation: Episode 4

Higher Ed
A startup makes insurance a snap, entrepreneurs go globetrotting and a software platform democratizes design. Plus, Anthony and Michael explore a way to make money from playing video games. Hosted by venture capitalist Anthony Lacavera...
Instructional Video3:41
Fun Robotics

Understanding Confusion Matrix

Higher Ed
Explains how to read a confusion matrix
Instructional Video23:59
Globalive Media

Beyond Innovation: Episode 16

Higher Ed
A cyborg startup blends man with machine, an algorithm masters audio recordings and robots manage a vegetable garden. Plus, Anthony and Michael speak with a scientist pioneering batteries that are safe to eat. Hosted by venture...
Instructional Video14:14
Curated Video

Python 3: Project-based Python, Algorithms, Data Structures - Reading from and writing to files

Higher Ed
Detailed look at string concatenation, indexing and slicing 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 Video8:15
Curated Video

Complete Modern C++ - Algorithms - Part I

Higher Ed
This video is an introduction to common algorithms. This clip is from the chapter "Standard Template Library" of the series "Complete Modern C++".This section is the description of the standard template library.
Instructional Video11:23
Curated Video

From 0 to 1 Data Structures & Algorithms in Java - The Bellman Ford Algorithm Visualized

Higher Ed
Visualize how the Bellman Ford works to find the shortest path in a graph with negative weighted edges. This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this...