Discrete Mathematics: MAT210
Fall '11
math.conncoll.edu/mat210

Instructor: Bridget Baird Fanning 309 x2008 bbbai@conncoll.edu Class Mon, Wed: 10:25-11:40

Office Hours: Mon, Wed: 9:00-10:00; Tu: 2:00-3:00 Other times by appointment

Text: Discrete Mathematics Chartrand and Zhang, Waveland Press, 2011

Discrete mathematics is a beautiful subject that looks at finite collections of objects and how to manipulate, count and generate them. Patterns and algorithms play an important role. How to solve problems, think logically, reason clearly and prove results are also fundamental to the course. Some of the kinds of collections and applications that are examined are number systems, relations, functions, sets, boolean algebras, combinations, permutations, graphs and trees. Many of the topics in discrete mathematics are applicable to computer science. In exploring these topics basic mathematical tools such as logic, rules of inference, properties of numbers, induction and recursion are used. For each of these topics we will look at applications, problem-solving strategies and proofs.

We will cover most of chapters 1-8, 12,13. Assignments will be given frequently and will generally involve exercises that are combinations of problem-solving, applications and proofs. There will be a project. You will sign up for a topic. There will be two exams during the semester and a final, self-scheduled exam. The exams are listed on the syllabus and consist of two parts: an in-class and a take-home section. All of these will be open-book. The project will count as one of the tak-home exams. The course objectives are on the Web and should be consulted. Each class period you should come having read over the new material in the text and you should be prepared to ask questions about material or exercises you don't understand. Try to place what you are learning in the context of math or computer courses you may have taken or any of your other courses. If you are looking, you will start to find discrete mathematics in many places. Every class day you should have at least one question or comment.

Participation in class is crucial and necessary. This means active participation: contributing to class discussion, asking questions. Attendance is also important and is a prerequisite for participation; absences will be noted. Homework assignments will count for 45% of the grade; each of the three tests 15%; the project 10% (part of one of the tests) and class participation 10%. There will be points deducted for late homework and in any case assignments will not be accepted more than a day late.

Discrete mathematics is a delightful branch of mathematics with problems that are intriguing, applicable to many contemporary situations, and generally easy to state but often hard (or impossible) to solve. It is at the opposite end of the spectrum from calculus and notions of continuity. Many of the important applications of discrete mathematics are in computer science. The practical applications you learn in this class and the tools of logic and formal reasoning will be useful for a wide range of courses and situations. I hope you find the topics interesting, engrossing, and fun.

Note to all students: If you have a physical or mental disability, either hidden or visible, which may require classroom, test-taking, or other reasonable modifications, please see me as soon as possible. If you have not already done so, please be sure to register with the Office of Student Disability Services. You can do so by going to the Office of Student Disability Services which is located in Crozier Williams, Room 221, or by contacting the Office at Campus Extensions 5428 or 5240, or by email to barbara.mcllarky@conncoll.edu or lillian.liebenthal@conncoll.edu.