No. | Date | Sections | Lecture | Assignment | ||
---|---|---|---|---|---|---|

Chapter 10 - The Mathematics of Finance | ||||||

1 | Mon, Jan 15 | Introduction | ||||

2 | Wed, Jan 17 | 10.2 | Simple Interest | |||

3 | Fri, Jan 19 | 10.3 | Compound Interest | |||

4 | Mon, Jan 22 | 10.3 | Building up an Annuity
(Financial Formulas) (Annuity Exercises) |
|||

5 | Wed, Jan 24 | Drawing down an Annuity | ||||

6 | Fri, Jan 26 | 10.4 | Installment Loans | |||

7 | Mon, Jan 29 | Inflation | ||||

Chapter 1 - The Mathematics of Elections | ||||||

8 | Wed, Jan 31 | 1.1 - 1.3 | The Plurality and Borda Count Methods | |||

9 | Fri, Feb 2 | 1.4 | The Plurality-with-Elimination Method | |||

10 | Mon, Feb 5 | 1.5 | The Pairwise-Comparison Method | |||

11 | Wed, Feb 7 | 1.6 | Arrow's Impossibility Theorem | |||

Chapter 2 - The Mathematics of Power | ||||||

12 | Fri, Feb 9 | 2.1 | Weighted Voting | |||

13 | Mon, Feb 12 | 2.2 | Banzhaf Power | |||

14 | Wed, Feb 14 | 2.3 | Shapley-Shubik Power | |||

Fri, Feb 16 | Test 1 | |||||

Chapter 3 - The Mathematics of Sharing | ||||||

15 | Mon, Feb 19 | 3.1 - 3.2 | The Divider-Chooser Method | |||

16 | Wed, Feb 21 | 3.4 | The Lone-Chooser Method | |||

17 | Fri, Feb 23 | 3.4 | The Lone-Chooser Method | |||

18 | Mon, Feb 26 | 3.5 | The Method of Sealed Bids | |||

Chapter 4 - The Mathematics of Apportionment | ||||||

19 | Wed, Feb 28 | 4.1 | Apportionment Problems | |||

20 | Fri, Mar 2 | 4.2 | Hamilton's Method | |||

Mon, Mar 5 | Spring Break | |||||

Wed, Mar 7 | ||||||

Fri, Mar 9 | ||||||

21 | Mon, Mar 12 | 4.3 | Jefferson's and Adams's Methods | |||

22 | Wed, Mar 14 | 4.4 | Webster's Method | |||

23 | Fri, Mar 16 | 4.5 | The Huntington-Hill Method - Version 1 | |||

24 | Mon, Mar 19 | 4.5 | The Huntington-Hill Method - Version 2 | |||

25 | Wed, Mar 21 | 4.6 | Apportionment Paradoxes | |||

Fri, Mar 23 | Test 2 | |||||

Chapter 5 - The Mathematics of Getting Around | ||||||

26 | Mon, Mar 26 | 5.2 - 5.2 | Street-Routing Problems | |||

27 | Wed, Mar 28 | 5.3 | Euler's Theorems | |||

30 | Fri, Mar 30 | 5.4 | Eulerization | |||

29 | Mon, Apr 2 | The Shortest-Path Algorithm | ||||

Chapter 6 - The Mathematics of Touring | ||||||

30 | Wed, Apr 4 | 6.1, 6.3 | The Traveling Salesman Problem | |||

31 | Fri, Apr 6 | 6.4 | The Nearest-Neighbor Algorithm | |||

32 | Mon, Apr 9 | 6.5 | The Cheapest-Link Algorithm | |||

Chapter 8 - The Mathematics of Scheduling | ||||||

33 | Wed, Apr 11 | 8.1 - 8.2 | Scheduling and Digraphs | |||

34 | Fri, Apr 13 | 8.3 | Priority List Scheduling | |||

35 | Mon, Apr 16 | 8.4 | The Decreasing-Time Algorithm | |||

36 | Wed, Apr 18 | 8.5 | The Backflow Algorithm | |||

Fri, Apr 20 | Test 3 | |||||

37 | Mon, Apr 23 | 8.5 | The Critical-Path Algorithm | |||

38 | Wed, Apr 25 | 8.5 | The Critical-Path Algorithm | |||

39 | Fri, Apr 27 | Summary and Review | ||||

Tue, May 1 | Final Exam (1:30 pm - 4:30 pm) |