Premium Support

Video Lectures Help

Having trouble viewing lectures? Try changing players. Your current player format is html5. Change to flash.

 I. TWO MOTIVATING APPLICATIONS (Week 1)

 II. SELECTED REVIEW FROM PART I (Week 1)

 III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)

 IV. A SCHEDULING APPLICATION (Week 1)

 V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)

 VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)

 VII. CLUSTERING (Week 2)

 VIII. ADVANCED UNION-FIND (Week 2)

 IX. HUFFMAN CODES (Week 2)

 X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)

 XI. THE KNAPSACK PROBLEM (Week 3)

 XII. SEQUENCE ALIGNMENT (Week 3)

 XIII. OPTIMAL BINARY SEARCH TREES (Week 3)

 XIV. THE BELLMAN-FORD ALGORITHM (Week 4)

 XV. ALL-PAIRS SHORTEST PATHS (Week 4)

 XVI. NP-COMPLETE PROBLEMS (Week 5)

 XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)

 XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)

 XIX. LOCAL SEARCH ALGORITHMS (Week 6)

 XX. THE WIDER WORLD OF ALGORITHMS (Week 6)

Loading Course Information...

Help Close Video Dialog Box