Course Details
Textbooks
 |
Discrete Mathematics, Seventh Edition by Richard Johnsonbaugh, 2009 Michigan State University, MI Find this text on Amazon |
Overview
An introduction to the mathematics of discrete objects. Topics include: combinatorics, recurrence relations and the analysis of algorithms, and an introduction to graph theory.Disabilities
Centenary assures students with disabilities equal opportunity to reach the same level of achievement as other students. Strict confidentiality will be maintained on students with disabilities. Services for students with disabilities are available through the Counseling Center, located on the ground floor of Rotary Residence Hall, phone (318) 869-5424.Honor Code
All students are bound by the Honor System. The Honor System is applicable to all academic work. See the Centenary College Handbook for the complete Honor Code. All code you write and turn in for a grade is understood to be pledged. You may discuss topics with other students and tutors, but all code you write must be your own, and you must be able to explain to me how it works. In this course, it is a violation of the honor code to look at code from previous semesters or in other students' directories.Extensions
Extensions and rescheduling for labs, projects, exams and quizzes are only given when circumstances beyond your control (e.g. being sick, choir or sports travel) prevent you from completing a project on time. You must notify me either by email or phone of your circumstances well in advance of the due date. No extensions are given for requests made within three days of the due date.Quizzes and Participation
You are encouraged to attend class and participate in discussions every day. Sporadically throughout the semester, there will be short quizzes covering material from the previous class. These quizzes will serve as records of your attendance, and in total they will comprise 5% of your final grade. Active participation in class discussions will comprise another 5% of your final grade. This will be awarded for answering questions, asking questions, presenting material, etc.
You will be expected to sign up for a Twitter account and
use it regularly to post status updates about the class and your progress in labs and projects
with the #math310 hashtag.
Syllabus
We will be using pieces from our textbook.
We will also be using additional supplemental material such as
relevant web-pages
and background material for the lab assignments.
Readings will be assigned before material will be covered in class. You are expected
to review the material and come to class prepared. As readings are assigned,
they will be posted here.
- Week 1-2 : 1 -3 Review of Transitions
- Week 3 : 6 - Permutations and Combinations
- Week 4 : 6 - Pigeonhole Principle
- Week 5 : 7 - Recurrence Relations
- Week 6 : 4 - Algorithmic Analysis
- Week 7 : ? - Generating Functions
- Week 8 : 8 - Graphs
- Week 9 : 9 - Trees
- Week 10: ? - Combinatorial Games
- Week 11: 10 - Networks
Homework
Much of your experience with discrete mathematics in this course will be through weekly homeworks, which will comprise 50% of your final grade. You are required to present this work in class through a writeup on the board and discussion with other students.- HW1 - Review of Chapters 1-3
(hw1.tex, homework.sty, newalg.sty) - HW2 - Chapter 6.1-6.3
- HW3 - Chapter 6.7-6.8
- HW4 - Chapter 7.1-7.2
- HW5 - Chapter 8.1-8.2
- HW6 - Chapter 8.3-8.6
Exams
There will be three exams, the first two worth 13% of your final grade, the final exam worth 14%. They will consist of an oral exam and written work.- Exam 1: February 25th - 29th
- Exam 2: March 25th - 28th
- Exam 3: ???
Grading
Your final grade for this course will be based on the Labs, Projects, Quizzes, Exams and Participation described above.
|
| ||||||||||||||||||||||||||
© Mark Goadrich, Centenary College of Louisiana