Computer Science 413: Greedy Algorithms

Greedy Algorithms

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

• Lecture Notes
• Questions for Review

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
• Supplemental Document: Additional Details about the Algorithms Introduced in Lecture #16
• Questions for Review

Tutorial Exercise #16: Minimizing the Sum 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 Strategy for Hiking the Appalachian Trail

• Problems To Be Solved

Lecture #18: Greedy Algorithms — Minimizing Cache Misses for Offline Caching

• Lecture Notes

Tutorial Exercise #18: The Fractional Knapsack Problem

• Problems To Be Solved

Assignment #4: Greedy Algorithms

• Problems To Be Solved

cpsc 413 computer science faculty of science u of c

CPSC 413 introduction and math review analysis of algorithms divide and conquer dynamic programming greedy algorithms complexity theory assignments tests