The mathematical tools of reasoning logically, thinking abstractly, and writing proofs are used extensively in computer science.  In this course, you will learn how to use these tools while studying graph theory, a field of mathematics which plays a central role in all areas of computer science.

Course web site:  All handouts, homework assignments, reading assignments, and important materials are available at www.gac.edu/~kaiser/mcs236/ .

Prerequisites: While there are no formal prerequisites for this course, I assume that you have some exposure to thinking abstractly.

Objectives:

• to learn to read and understand mathematical proofs, to see how these proofs may guide algorithm development, and to improve your abilities to think abstractly
• to become adept at logical reasoning
  
• to learn to write mathematical proofs
• to improve your problem solving abilities
• to learn the basics of graph theory

Text: A Friendly Introduction to Graph Theory, by Fred Buckley and Marty Lewinter.

Classes:  Classes will be used for lectures, problem solving, discussions, and other fun activities.  You should prepare for classes by doing the reading beforehand (reading assignments are posted on the Web), thinking about the problems in the text, and formulating questions of your own. You should also participate as much as possible in class.

Attendance, both physical and mental, is required.

Should you need to miss a class for any reason, you are still responsible for the material covered in that class. This means that you will need to make sure that you understand the reading for that day, that you should ask a friend for the notes from that day, and make sure that you understand what was covered. If there is an assignment due that day, you should be sure to have a friend hand it in or put it in my departmental mailbox (in Olin 324). You do not need to tell me why you missed a class unless there is a compelling reason for me to know.

Homework:
I will assign homework problems frequently and post them on the Web. These will involve problems to help your understanding and problems that involve writing proofs. The assignments will initially be collected twice a week and eventually be collected once a week.

You will also be expected to write one ``perfect proof'' for each type of proof that we study.  I assign particular problems and you may submit up to four revised versions of your first solution.

Finally, you will also be expected to write one expository paper.

In case you are sick or have some other emergency, you may hand in two homework assignments late, as long as they are no more than one week late and they are handed in before I hand back graded ones.  Any other late assignments will be heavily penalized.

March 8
April 23
May 21

Honor:
In this course, you are expected to adhere to the highest standards of academic honesty and to uphold the Gustavus Honor Code. This means that while you can discuss problems and their solutions, each of you should make a real effort to solve each problem by yourself, and you should give credit to any people or texts that helped you find solutions.  Needless to say,  you are expected to work completely by yourself on tests.

You will be expected to sign the honor pledge on every graded paper and test.  

A first violation of the honor code will result in a grade of 0 on the paper or test in question.  Any further violations will result in a grade of F for the course.  In all cases, I notify the office of the Dean of the Faculty.

Course grade:
 

Homework	40%
Proofs portfolio	10%
Paper	10%
Tests	40%

Accessibility:
Please contact me during the first week of class if you have specific physical, psychiatric, or learning disabilities and require accommodations. I will do my best to facilitate the  necessary arrangements.  All discussions will remain confidential.