Log in

goodpods headphones icon

To access all our features

Open the Goodpods app
Close icon
headphones
Algorithm Design and Analysis

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.
bookmark
Share icon

All episodes

Best episodes

Top 10 Algorithm Design and Analysis Episodes

Goodpods has curated a list of the 10 best Algorithm Design and Analysis episodes, ranked by the number of listens and likes each episode have garnered from our listeners. If you are listening to Algorithm Design and Analysis for the first time, there's no better place to start than with one of these standout episodes. If you are a fan of the show, vote for your favorite Algorithm Design and Analysis episode by adding your comments to the episode page.

Algorithm Design and Analysis - Unique-Decipherability. Graph algorithm  and proof of correctness
play

11/10/10 • 51 min

Lecture 20 deals with unique-decipherability: efficient graph-based algorithm and proof of correctness.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Introduction to the course and algorithm complexity
play

09/24/10 • 49 min

This is the course introduction about algorithm complexity, including what "worst case running time" means and how it is measured.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Big-Oh, Omega and Theta notation

Big-Oh, Omega and Theta notation

Algorithm Design and Analysis

play

09/27/10 • 48 min

In Lecture 2, Gusfield discusses Big-Oh, Omega and Theta notation. He describes Mergesort and Merge and the start of their time analysis.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Time analysis of Mergesort

Time analysis of Mergesort

Algorithm Design and Analysis

play

09/29/10 • 49 min

In Lecture 3, Gusfield gives the worst-case analysis of MergeSort by setting up a recurrence relation and solving it by unwrapping.
bookmark
plus icon
share episode
Algorithm Design and Analysis - A more complex recurrence relation and counting inversions
play

10/01/10 • 52 min

In Lecture 4, students learn about solving a more complex recurrence relation by unwrapping. Gusfield also addresses the problem of counting inversions in a permutation.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Greedy algorithms: The classroom scheduling problem
play

10/14/10 • 16 min

In Lecture 9A, Gusfield provides another scheduling problem to be solved by a greedy algorithm.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Dijkstra's shortest path algorithm

Dijkstra's shortest path algorithm

Algorithm Design and Analysis

play

10/15/10 • 51 min

In Lecture 10, students learn about Dijkstra's algorithm for shortest paths in a graph with non-negative edge weights.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Start of minimum spanning tree problem

Start of minimum spanning tree problem

Algorithm Design and Analysis

play

10/18/10 • 49 min

In Lecture 11, Gusfield covers Prim's algorithm and analysis, and Kruskal's algorithm.
bookmark
plus icon
share episode
Algorithm Design and Analysis - Correctness of Kruskal's algorithm.

Correctness of Kruskal's algorithm.

Algorithm Design and Analysis

play

10/20/10 • 26 min

In Lecture 12, Gusfield talks about the proof of correctness of Kruskal's algorithm.
bookmark
plus icon
share episode
Algorithm Design and Analysis - The unique-decipherability problem

The unique-decipherability problem

Algorithm Design and Analysis

play

11/08/10 • 52 min

Lecture 19 covers the unique-decipherability problem and gives definitions and the start of a graph-based solution.
bookmark
plus icon
share episode

Show more best episodes

Toggle view more icon

FAQ

How many episodes does Algorithm Design and Analysis have?

Algorithm Design and Analysis currently has 30 episodes available.

What topics does Algorithm Design and Analysis cover?

The podcast is about Computer Science, Podcasts, Technology and Analysis.

What is the most popular episode on Algorithm Design and Analysis?

The episode title 'Introduction to the course and algorithm complexity' is the most popular.

What is the average episode length on Algorithm Design and Analysis?

The average episode length on Algorithm Design and Analysis is 46 minutes.

How often are episodes of Algorithm Design and Analysis released?

Episodes of Algorithm Design and Analysis are typically released every 2 days.

When was the first episode of Algorithm Design and Analysis?

The first episode of Algorithm Design and Analysis was released on Sep 23, 2010.

Show more FAQ

Toggle view more icon

Comments