Unit 4': OLD Greedy Algorithms Methods (4.5 hours)
           ppt, steps, practice, practice sol
           These are the simplest possible algorithms. Proving they work,
           however, is hard.

02 Formal vs Informal
23 Greedy Algorithms
29 Proving with Loop Invariants
22 Three Players making Change
30 Maintaining the Loop Invariant
45 Event Scheduling (HTA 162)
01 Review and Don'ts
41 Minimum Spanning Tree (HTA 1623; CLRS 23)
15 Adaptive Greedy
19 Interval Point Cover
60 Communication and Entropy
08 Forced Horn Clauses
Practice Solutions
- 1 23 Fractional-Knapsack
- 3 105 49 River Stone Jumping
- 4 34 Event Multiple Room

Unit 5': OLD Dynamic Programming (6 hours)
           ppt, steps, practice, practice sol
           A harder instance is solved by filling out a table of solutions for
           easier sub-instances.

42 All Pairs Shortest Paths (HTA 196; CLRS 25)
09 Best Path
Steps:
03 A Sequence of Decisions
13 The Little Bird & Friend
08 Recursive Backtracking
13 Memoization
08 Set of Sub-Instances
02 Tracing Dyn. Prog. Alg
15 Communication
14 Code
12 Reversing
12 Speeding Up Running Time
01 Multiple Opt Solutions
03 Review
15 Question for Little Bird
06 23 Optimal Substructure
38 Printing Neatly
39 Longest Common Subsequence (HTA 191)
50 Knapsack Problem
15 The Event Scheduling Problem (HTA 193)
23 Parsing (HTA 198)
Satisfiability
Practice Solutions
- 4 87 Stock Market

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.