| (10 intermediate revisions by 10 users not shown) | |||
| Line 52: | Line 52: | ||
---- | ---- | ||
== Your turn! Student Projects == | == Your turn! Student Projects == | ||
| − | As per the syllabus, 5% of your grade will be based on contributing a Rhea page on a subject related to the course. To pick a subject, simply write your group name next to it | + | As per the syllabus, 5% of your grade will be based on contributing a Rhea page on a subject related to the course. To pick a subject, simply write your group name next to it. |
| − | + | Notes: | |
| + | * No more than one group per subject. | ||
| + | * Once a group has signed up with a project, this project is closed to other groups. | ||
| + | * A group cannot un-sign from a subject they signed up for. Signing up is permanent. | ||
| − | Deadline: Sunday before dead week | + | Your project page will be graded based on content as well as interactions with other people (page views, comments/questions on the page, etc.). The number of links to other courses and subjects will also be taken into account: the more the merrier! Do not simply copy the book and do not plagiarize. Read [[Rhea:Copyrights|Rhea's copyright policy]] before proceeding. |
| + | |||
| + | For some lovely contributions, see [[Honors Project]] 2011 by Daniel Lee. | ||
| + | |||
| + | Deadline: Sunday before dead week. No changes after that will be taken into account. | ||
{| border="1" class="wikitable" | {| border="1" class="wikitable" | ||
| Line 66: | Line 73: | ||
| 1 | | 1 | ||
| [[Walther_MA279_Spring2016_topic1|The Chinese Postman Problem (5.c)]] | | [[Walther_MA279_Spring2016_topic1|The Chinese Postman Problem (5.c)]] | ||
| − | | | + | | Group J |
|- | |- | ||
| 2 | | 2 | ||
| [[Walther_MA279_Spring2016_topic2|Swarm Intelligence (6.c)]] | | [[Walther_MA279_Spring2016_topic2|Swarm Intelligence (6.c)]] | ||
| − | | | + | | Group E |
|- | |- | ||
| 3 | | 3 | ||
| Line 78: | Line 85: | ||
| 4 | | 4 | ||
| [[Walther_MA279_Spring2016_topic4|Privacy and Social Networks (7.c)]] | | [[Walther_MA279_Spring2016_topic4|Privacy and Social Networks (7.c)]] | ||
| − | | | + | |Group F |
|- | |- | ||
| 5 | | 5 | ||
| [[Walther_MA279_Spring2016_topic5|Alternatives to Kruskal's algorithm (7.a)]] | | [[Walther_MA279_Spring2016_topic5|Alternatives to Kruskal's algorithm (7.a)]] | ||
| − | | | + | | Group C |
|- | |- | ||
| 6 | | 6 | ||
| [[Walther_MA279_Spring2016_topic6|P vs NP: a Clay Millennium Problem with economic flavor]] | | [[Walther_MA279_Spring2016_topic6|P vs NP: a Clay Millennium Problem with economic flavor]] | ||
| − | | | + | | Group I |
|- | |- | ||
| 7 | | 7 | ||
| [[Walther_MA279_Spring2016_topic7|Dijkstra's algorithm and its variants for shortest paths (7.b)]] | | [[Walther_MA279_Spring2016_topic7|Dijkstra's algorithm and its variants for shortest paths (7.b)]] | ||
| − | | | + | | Group D |
|- | |- | ||
| 8 | | 8 | ||
| [[Walther_MA279_Spring2016_topic8|Tournaments (8.c)]] | | [[Walther_MA279_Spring2016_topic8|Tournaments (8.c)]] | ||
| − | | | + | | Group B |
|- | |- | ||
| 9 | | 9 | ||
| [[Walther_MA279_Spring2016_topic9|The graph isomorphism problem: theory and applications]] | | [[Walther_MA279_Spring2016_topic9|The graph isomorphism problem: theory and applications]] | ||
| − | | | + | | Group A |
|- | |- | ||
| 10 | | 10 | ||
| [[Walther_MA279_Spring2016_topic10|Scheduling (Chapter 8)]] | | [[Walther_MA279_Spring2016_topic10|Scheduling (Chapter 8)]] | ||
| − | | | + | | Group G |
|- | |- | ||
| 11 | | 11 | ||
| [[Walther_MA279_Spring2016_topic11|The transportation problem: a glimpse into linear programming]] | | [[Walther_MA279_Spring2016_topic11|The transportation problem: a glimpse into linear programming]] | ||
| − | | | + | | Group H |
|- | |- | ||
| 12 | | 12 | ||
Latest revision as of 11:20, 23 January 2016
Contents
Rhea Section for MA279: "Modern Mathematics"
Professor Walther, Spring 2016
Welcome!
To edit: click on "user" and choose "log in" in the drop down menu. Enter Purdue ID and password. After logging in, click "actions" and select "edit". Then make the requisite changes in the editor you will see. Then click "save page" all the way down. Check that you wrote what you wanted.
Please write [[Category:MA279Spring2016Walther]] at the bottom of each of your pages,
OTHERWISE NO CREDIT !
(If you use the "Create a child page" button, this should happen automatically...)
Course Info
- Instructor: Prof. Walther
- Office: MATH 746
- email: walther at math dot purdue dot edu
- Office hours: Tue 1:30-2:30, Th 2:00-3:00.
- Class time and location: TTh 9:00-10:15, UNIV 217
- Book: Excursions in modern mathematics (P. Tannenbaum), 7th edition.
Important Links
Course Related Material
- Course Notes
- Discussion of Homework Problems (Just keep adding to it!)
Discussion
- post link to discussion page here
- post link to discussion page here
Other Links
- Math Club Homepage
- Rhea's Math Squad
- Study Abroad
- The Big 10 Graduate School Expo
- Math Internships and Research Opportunities (REU's)
- Math Game Competition
Your turn! Student Projects
As per the syllabus, 5% of your grade will be based on contributing a Rhea page on a subject related to the course. To pick a subject, simply write your group name next to it.
Notes:
- No more than one group per subject.
- Once a group has signed up with a project, this project is closed to other groups.
- A group cannot un-sign from a subject they signed up for. Signing up is permanent.
Your project page will be graded based on content as well as interactions with other people (page views, comments/questions on the page, etc.). The number of links to other courses and subjects will also be taken into account: the more the merrier! Do not simply copy the book and do not plagiarize. Read Rhea's copyright policy before proceeding.
For some lovely contributions, see Honors Project 2011 by Daniel Lee.
Deadline: Sunday before dead week. No changes after that will be taken into account.
| Topic Number | Topic Description | Team Name |
|---|---|---|
| 1 | The Chinese Postman Problem (5.c) | Group J |
| 2 | Swarm Intelligence (6.c) | Group E |
| 3 | DNA-based computing (6.b) | Name |
| 4 | Privacy and Social Networks (7.c) | Group F |
| 5 | Alternatives to Kruskal's algorithm (7.a) | Group C |
| 6 | P vs NP: a Clay Millennium Problem with economic flavor | Group I |
| 7 | Dijkstra's algorithm and its variants for shortest paths (7.b) | Group D |
| 8 | Tournaments (8.c) | Group B |
| 9 | The graph isomorphism problem: theory and applications | Group A |
| 10 | Scheduling (Chapter 8) | Group G |
| 11 | The transportation problem: a glimpse into linear programming | Group H |
| 12 | The economic impact of mathematical algorithms in society | Name |
