Algorithm Design: Greedy Algorithms

Algorithm Design: Greedy Algorithms

Lecture #15: A Greedy Algorithm to Minimize a Sum of Completion Times When Processing Times are Distinct

• Lecture Notes
• Review Questions

Tutorial Exercise #15: A Greedy Algorithm for Making Change with Sensible Denominations of Coins

• Problems To Be Solved

Lecture #16: Greedy Algorithms — Unweighted Activity Selection

• Lecture Notes
• Supplement: Additional Details about the Algorithms in This Lecture
• Review Questions

Tutorial Exercise #16: Minimizing the Sums of Completion Times when Processing Times are not (Necessarily) Unique

• Problems To Be Solved

Lecture #17: Greedy Algorithms — Data Compression and Huffman Trees

• Lecture Notes

Tutorial Exercise #17: A Greedy Algorithm for Hiking the Appaladhian Trail

• Problems To Be Solved

Lecture #18: Greedy Algorithms — Minimizing Cache Misses for Online Hashing

• Lecture Notes

Tutorial Exercise #18: The Fractional Knapsack Problem

• Problems To Be Solved

cpsc 413 computer science faculty of science u of c

CPSC 413 Introduction Analysis of Algorithms Divide and Conquer Dynamic Programming Greedy Algorithms Computational Complexity Information about Assignments Information about Tests