Ranked #1
Lecture 5: Binary Search Trees, BST Sort
Lecture 5: Binary Search Trees, BST Sort
In this lecture, binary search trees are introduced, and several operations are covered: insertion, finding a value, fin... Read more
7 Dec 2012
•
52mins
Ranked #2
Lecture 6: AVL Trees, AVL Sort
Lecture 6: AVL Trees, AVL Sort
7 Dec 2012
•
51mins
Similar Podcasts
Design and Analysis of Algorithms (2015)
Introduction to Algorithms (2005)
Advanced Data Structures
Mathematics for Computer Science (2015)
Mathematics for Computer Science (2010)
Computer System Engineering
OCW Scholar: Introduction to Computer Science and Programming
Programming Paradigms
Computer Systems Security
Artificial Intelligence
Introduction to Computer Science and Programming
Linear Algebra
Programming Methodology
Circuits and Electronics
Introduction to Computer Science and Programming in Python
Ranked #3
Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest pa... Read more
10 Dec 2012
•
52mins
Ranked #4
Recitation 2: Python Cost Model, Document Distance
Recitation 2: Python Cost Model, Document Distance
This recitation covers the Python cost model and looks at the code for document distance, including main and most functi... Read more
10 Dec 2012
•
52mins
Most Popular Podcasts
The Joe Rogan Experience
TED Talks Daily
The Tim Ferriss Show
The Daily
Stuff You Should Know
Oprah's SuperSoul Conversations
Armchair Expert with Dax Shepard
Ranked #5
Recitation 21: Dynamic Programming: Knapsack Problem
Recitation 21: Dynamic Programming: Knapsack Problem
This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time.
10 Dec 2012
•
1hr 9mins
Ranked #6
Lecture 8: Hashing with Chaining
Lecture 8: Hashing with Chaining
This lecture starts with dictionaries in Python, considers the problems with using a direct-access table, and introduces... Read more
7 Dec 2012
•
51mins
Ranked #7
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
This lecture introduces dynamic programming, in which careful exhaustive search can be used to design polynomial-time al... Read more
7 Dec 2012
•
51mins
Ranked #8
Recitation 22: Dynamic Programming: Dance Dance Revolution
Recitation 22: Dynamic Programming: Dance Dance Revolution
This recitation looks at player positions in the Dance Dance Revolution game, along the lines of the guitar fingering ex... Read more
10 Dec 2012
•
53mins
Ranked #9
Lecture 14: Depth-First Search (DFS), Topological Sort
Lecture 14: Depth-First Search (DFS), Topological Sort
This lecture covers depth-first search, including edge classification, and how DFS is used for cycle detection and topol... Read more
7 Dec 2012
•
50mins
Ranked #10
Recitation 16: Rubik's Cube, StarCraft Zero
Recitation 16: Rubik's Cube, StarCraft Zero
This recitation discusses the Rubik's cube problem from Problem Set 6, and then uses a graph model to find an optimal bu... Read more
10 Dec 2012
•
54mins
Ranked #11
Recitation 20: Dynamic Programming: Blackjack
Recitation 20: Dynamic Programming: Blackjack
This recitation revisits the perfect-information blackjack problem that was covered in lecture.
10 Dec 2012
•
52mins
Ranked #12
Recitation 5: Recursion Trees, Binary Search Trees
Recitation 5: Recursion Trees, Binary Search Trees
This recitation starts with a review of recursion trees and recurrences, and then discusses binary search trees.
10 Dec 2012
•
59mins
Ranked #13
Lecture 16: Dijkstra
Lecture 16: Dijkstra
This lecture shows how to find shortest paths in directed acyclic graphs (DAGs) using topological sort, and in graphs wi... Read more
7 Dec 2012
•
51mins
Ranked #14
Recitation 3: Document Distance, Insertion and Merge Sort
Recitation 3: Document Distance, Insertion and Merge Sort
This recitation continues to look at versions of the document distance code, and briefly discusses insertion and merge s... Read more
10 Dec 2012
•
54mins
Ranked #15
Lecture 9: Table Doubling, Karp-Rabin
Lecture 9: Table Doubling, Karp-Rabin
This lecture covers table resizing, amortized analysis, string matching with the Karp-Rabin algorithm, and rolling hashe... Read more
7 Dec 2012
•
52mins
Ranked #16
Lecture 20: Dynamic Programming II: Text Justification, Blackjack
Lecture 20: Dynamic Programming II: Text Justification, Blackjack
This lecture starts with a five-step process for dynamic programming, and then covers text justification and perfect-inf... Read more
7 Dec 2012
•
52mins
Ranked #17
Recitation 9: Rolling Hashes, Amortized Analysis
Recitation 9: Rolling Hashes, Amortized Analysis
This recitation mostly covers rolling hashes, with a short discussion of amortized analysis at the end.
10 Dec 2012
•
1hr 1min
Ranked #18
Recitation 6: AVL Trees
Recitation 6: AVL Trees
This recitation covers insertion, deletion, and rebalancing of AVL trees.
10 Dec 2012
•
53mins
Ranked #19
Lecture 17: Bellman-Ford
Lecture 17: Bellman-Ford
This lecture reviews shortest path notation, considers a generic shortest path algorithm, and then describes and proves ... Read more
7 Dec 2012
•
48mins
Ranked #20
Recitation 11: Principles of Algorithm Design
Recitation 11: Principles of Algorithm Design
This recitation discusses principles of algorithm design, using example problems from previous final exams.
10 Dec 2012
•
58mins
