UMBC Training Centers logo

Design and Analysis of Algorithms

 

Course Description | Course Outline | Software Development | IT Training

 

Outline

  Asymptotic Notation

Summations

Recurrences

Master Theorem

Heap Sort

Quicksort

Lower bounds on Sorting

Linear-time selection

Hashing

Red-Black Trees

Dynamic Programing

Greedy Algorithms

Graphs

Depth-First Search

Topological Sort and Strongly Connected Components

Minimum Spanning Trees and Disjoint Set Union

Shortest Paths

Maximum Flow