MA 103 - Topics in Contemporary Mathematics

North Carolina State University Course , Prof. Tom Lada

434 students enrolled

Overview

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

Lecture 15: Websters Method

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        Video title goes here Self hosted video. Commodo vitae, tempor eu, urna eu mi hendrerit. Maecenas eu erat condimentum.
        0 (0 Ratings)

        LECTURES



        Review


        0

        0 Rates
        1
        0%
        0
        2
        0%
        0
        3
        0%
        0
        4
        0%
        0
        5
        0%
        0

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment