MA103 TOPICS IN CONTEMPORARY MATH

Tom Lada

 

Lecture 1        Preference Ballots:plurality, Borda count

Lecture 2        Plurality with Elimination, Pairwise Comparison

Lecture 3        Ranking

Lecture 4        Weighted Voting Systems

Lecture 5        Banzhaf Power Index

Lecture 6        Shapley Shubik Power Index

Lecture 7        Chapter 1 & 2 Review

Lecture 8        Chapter 1 & 2 Review

Lecture 9        Fair Division: Divider Choose and Lone Divider

Lecture 10      Lone Chooser, Last Diminisher

Lecture 11      Sealed Bids

Lecture 12      Method of Markers

Lecture 13      Apportionment: HamiltonÕs Method

Lecture 14      JeffersonÕs, AdamÕs Methods

Lecture 15      WebsterÕs Method

Lecture 16      Review of Chapter 3 & 4

Lecture 17      Introduction Graph Theory

Lecture 18      Euler paths and circuits

Lecture 19      Eulerization

Lecture 20      Hamilton Circuits

Lecture 21      Traveling Salesman Problem: Brute Force Method Nearest Neighbor Algorithm

Lecture 22      Repetitive Nearest Neighbor Algorithm and Cheapest Link Algorithm

Lecture 23      Graph Coloring

Lecture 24      Review of Chapter 5 & 6

Lecture 25      Spanning Trees; KruskalÕs Algorithm

Lecture 26      Steiner Points

Lecture 27      Steiner Points

Lecture 28      Scheduling, Decreasing Time Algorithm

Lecture 29      Critical Path Algorithm

Lecture 30      Independent Tasks, Bin Packing

Lecture 31      Review of Chapter 7 & 8

Lecture 32      Review of Chapter 7 & 8

Lecture 33      Fibonacci Numbers

Lecture 34      Gnomons

Lecture 35      Linear Growth

Lecture 36      Exponential Growth and Compound Interest

Lecture 37      Exponential Growth and Compound Interest

Lecture 38      Fractals

Lecture 39      Final Review