Best New Free Computer IT Training Tutorial Resources

October 11, 2005

Free Algorithms Training Course

This course teaches the design of algorithms according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.

The available training and learning content includes Lecture Videos, Lecture Notes, Problem Sets, and Handouts. The lecture videos are in Real Player format.

Free Algorithms Training Course:

Here is the Lectures and Courseware page:

Lecture Videos:

A high-speed mirror is available at The Internet Archive here:

Algorithms -- Overview:


Sorting II:

Searching & Data Structures:

Red-Black Trees:

Graph Algorithms I - Topological Sorting, Prim's Algorithm:

Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure:

Graph Algorithms III: Shortest Path:

Graph Alg. IV: Intro to Geometric Algorithms:

Geometric Algorithms: Graham & Jarvis:

Dynamic Programming I:

Dynamic Programming II:


Knapsack, Bandwidth Min. Intro: Greedy Algorithms:

Greedy Algs. II & Intro to NP Completeness:

NP Completeness II & Reductions:

NP Completeness III - More Reductions:

NP Completeness IV:

Approximation Algorithms:

Alternate Models of Computation:

Filed under: Best New Free Computer IT Training Tutorial Resources — computer_teacher @ 10:09 pm

Powered by WordPress