## 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

- Complex Analysis by IIT Guwahati
- Convex Optimization by IIT Kanpur
- Combinatorics by IISc Bangalore
- Ordinary Differential Equations and Applications by IISc Bangalore
- Geometry by Khan Academy
- University Algebra by The University of New South Wales
- College Algebra by University of Missouri Kansas City
- Trigonometry by Khan Academy
- Formal Languages and Automata Theory by IIT Guwahati
- Graph Theory by IISc Bangalore

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