22 oct 2010
Recursive programming and memoization
47 minutes
Podcast · Inglés
Algorithm Design and Analysis
Dan Gusfield
The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.
Episodios
Ordenados por fecha de publicación.
20 oct 2010
Correctness of Kruskal's algorithm.
26 minutes
18 oct 2010
Start of minimum spanning tree problem
49 minutes
15 oct 2010
Dijkstra's shortest path algorithm
51 minutes
14 oct 2010
Greedy algorithms: The classroom scheduling problem
16 minutes
13 oct 2010
Greedy algorithms: Picking largest set of non-overlapping intervals
50 minutes
11 oct 2010
Expected number of comparisons in randomized select
50 minutes
8 oct 2010
More on randomized selection and median finding
52 minutes
6 oct 2010
Fast integer multiplication, randomized selection and median finding
48 minutes
4 oct 2010
Counting inversions; Fast integer multiplication
48 minutes
1 oct 2010
A more complex recurrence relation and counting inversions
52 minutes
29 sept 2010
Time analysis of Mergesort
49 minutes
27 sept 2010
Big-Oh, Omega and Theta notation
48 minutes
24 sept 2010
Introduction to the course and algorithm complexity
49 minutes
23 sept 2010
Introduction to the videos
2 minutes
Más podcasts relacionados
Otros podcasts de Technology.