## Course Description :

Contents:

Preference Ballots: plurality Borda Count - Plurality with Elimination - Ranking - Weighted Voting Systems - Banzhaf Power Index - Shapley Shubik Power Index - Fair Division: Divider Choose ane Lone Divider - Lone Choose Last Diminisher - Sealed Bids - Method of Markers - Apportionment: Hamilton's Method - Jefferson's, Adam's Method - Webster's Method-Review of Chapters 3 and 4 - Introduction Graph Theory - Euler Paths and Circuits

Eulerization - Hamilton Circuits - Traveling Salesman Problem: Brute Force Method Nearest Neighbor Algorithm - Repetitive Nearest Neighbor Algorithm and Cheapest Link Algorithm - Graph Coloring -Spanning Trees Kruskal's Algorithm - steiner Points - Scheduling, Decreasing Time Algorithm - Critical Path Algorithm - Independent Tasks Bin Packing - Fibonacci Numbers - Gnomons - Linear Growth -Exponential Growth and Compound Interest - Fractals - Final Review

## Other Resources :

### Citation |

## Other Mathematics Courses

- Introduction to Probability and Statistics,Fall 2011 by UC Berkeley
- Miscellaneous Mathematics by Other
- Pre-algebra by Khan Academy
- Discrete Structures by IIT Madras
- Graph Theory by IISc Bangalore
- Computational Science and Engineering I by MIT
- Convex Optimization by IIT Kanpur
- Mathematics for Finance and Actuarial Studies 2 by Other
- Discrete Mathematics and Probability Theory by UC Berkeley
- Linear Algebra - Khan Academy by Khan Academy

### » check out the complete list of Mathematics lectures