Fall 2014

General Information | Help Room Schedule | Important Dates | Lecture Notes | Review Material | Test Information | FAQ | Links

**KU course number:** 13161

**Meeting times:** MWF, 3:00-3:50 PM, Budig 120

**Syllabus**

**Instructor:** Prof. Jeremy Martin

**Office hours (Snow 623)**: Tue/Wed, 2:00-3:00 PM, or by appointment

**E-mail:** math105f14@ku.edu

**Teaching Assistants:**

Davut Ayan | ayan@ku.edu |

Oguzhan Batmaz | oguzhan@ku.edu |

Brendan Stevens | |

Zunwu Zhou | z185z632@ku.edu |

**Course Prerequisites:**
MATH 101 or MATH 104, or two years of
high school algebra and a score of 26 or higher on ACT mathematics,
or a qualifying score on the mathematics placement test. For questions about placement,
consult Lindsey Deaver, Mathematics Advising Specialist, ldeaver@ku.edu.

**Textbook:** *Excursions in Modern Mathematics*,
KU custom edition, by Peter Tannenbaum. Available at KU
Bookstore.

**Homework:** All homework assignments are to be done on the MyMathLab online system, which will be available on the first day of classes (August 25).
Homework can be accessed either from Blackboard
or the Math Department MyMathLab portal.
For help with login issues, see this page.
The best way to get help with homework is to come to the **Help Room (Snow 151).**

Monday | Tuesday | Wednesday | Thursday | Friday | |
---|---|---|---|---|---|

10-11 | Brendan | Zunwu | Brendan | Oguzhan | |

11-12 | Brendan | Davut | Brendan | Davut | Oguzhan |

12-1 | Zunwu | Davut | Zunwu | Davut | Zunwu |

1-2 | Davut | Davut | Zunwu | Davut | Zunwu |

2-3 | Davut | Prof. Martin (Snow 623) |
Prof. Martin (Snow 623) |
Davut | Davut |

3-4 | Class | Oguzhan | Class | Oguzhan | Class |

4-5 | Oguzhan | Oguzhan | Zunwu | Oguzhan | Brendan |

5-6 | Oguzhan | Oguzhan | Zunwu | Oguzhan | Brendan |

**Monday 8/25: First day of classes**- Wednesday 8/27: First homework assignment due
- Monday 9/1: No class (Labor Day)
**Friday 10/10: Test #1**- Monday 10/12: No class (Fall Break)
**Monday 11/24: Test #2**- Wednesday 11/26: No class (Thanksgiving)
- Friday 11/28: No class (Thanksgiving)
- Friday 12/12: Stop Day
**Thursday 12/18: Final exam (1:30-4:00 PM)**

Lecture notes for Chapter 6:

- Part 1 (Hamilton circuits and paths)
- Part 2 (complete graphs, Hamilton circuits in them, and the Traveling Salesman Problem)
- Part 3 (Brute-Force and Nearest-Neighbor Algorithms)
- Part 4 (Repetitive Nearest-Neighbor Algorithm)
- Part 5 (Cheapest-Link Algorithm)
- Part 6 (examples and conclusion)

**Fair-Divison Problems (Chapter 3):**

- Lone-Divider Method:
- Method of Sealed Bids:

- 1. Graph basics
- 2. Graph basics
- 3. Graphs as models
- 4. Determining whether a graph has an Euler path or circuit
- 5. Determining whether a graph has an Euler path or circuit
- 6. Find an Euler path
- 7. Find an Euler path
- 8. Find an Euler path
- 9. Find an Euler circuit
- 10. Applications of handshaking
- 11. Applications of handshaking

- Blackboard
- MyMathLab at KU (including help logging in)
- KU Mathematics Department
- KU Academic Achievement and Access Center, including test-taking tips and other academic success guides.
- KU Registrar
- KU Bookstore
- KU policies on academic misconduct
- Student Access Services (services for students with disabilities)

Last updated Wed 11/5/14 1:30 PM