|
|
Recordings
|
Slides
|
|
Introduction - Part1
|
|
|
|
Introduction - Part2
|
|
|
|
Search Trees - Part1
|
|
|
|
Search Trees - Part2
|
|
|
|
Search Trees - Part3
|
|
|
|
Tree traversal analysis - Part1
|
|
|
|
Tree traversal analysis - Part2
|
|
|
|
Balanced Trees AVL - Part1
|
|
|
|
Balanced Trees AVL - Part2
|
|
|
|
AVL trees delete - Part1
|
no recording
|
|
|
AVL trees delete - Part2
|
|
|
|
Hashing - Part1
|
|
|
|
Hashing - Part2
|
|
|
|
Hashing: Chaining
|
|
|
|
Hashing: Open Addressing - Part1
|
|
|
|
Hashing: Open Addressing - Part2
|
|
|
|
Dynamic Tables - Part1
|
|
|
|
Dynamic Tables - Part2
|
|
|
|
Randomized Algorithms - Part1
|
|
|
|
Randomized Algorithms - Part2
|
|
|
|
Randomized Algorithms - Part3
|
|
|
|
Text search - Part1
|
|
|
|
Text search - Part2
|
|
|
|
Edit distances - Part1
|
|
|
|
Edit distances - Part2
|
|
|
|
Programming Languages and Software Engineering
|
|
|
|
Basic Terms - Part1
|
|
|
|
Basic Terms - Part2
|
|
|
|
Abstract Data Types - Part1
|
|
|
|
Abstract Data Types - Part2
|
|
|
|
Abstract Data Types - Part3
|
|
|
|
Abstract Data Types - Part4
|
|
|
|
The Word Problem - Part1
|
|
|
|
The Word Problem - Part2
|
|
|
|
The Word Problem - Part3
|
|
|
|
Satisfiability - Part1
|
|
|
|
Satisfiability - Part2
|
|
|
|
Database Foundation
|
|
|
|
Introduction
|
|
|
|
Relational Algebra - Part1
|
|
|
|
Relational Algebra - Part2
|
|
|
|
Relational Calculus
|
|
|
|
Formal Design - Part1
|
|
|
|
Formal Design - Part2
|
|
|
|
Transactions - Part1
|
|
|
|
Transactions - Part2
|
|
|
