MATH 6, Spring 2002
Finite Mathematics
Syllabus
Course description: This course will introduce students to several topics in finite mathematics. We will see many applications of finite mathematics including counting and probability, Markov processes, graph theory, voting theory and game theory. In exploring these topics we'll develop basic set theory, counting techniques and matrix algebra.
Instructor: Barry Balof Grader: Matt DeLellis
Office: 1L Bradley Hall
Location: TBA Time: MWF 11:15-12:20 Tu 12:00-12:50
Textbook: Finite Mathematics & Its Applications, 7th Ed., by Goldstein, Schneider and Siegel
Homework: Homework will be posted here
As a courtesy to the grader, please staple your homework.
LATE HOMEWORK IS NOT PERMITTED FOR ANY REASON.
Your two lowest daily assignment grades will be dropped in figuring your final grade.
Tests: This class will have three exams.
First exam: On or around April 24th
Second exam: On or around May 15th
MiniProjects: Throughout the term there will be assigned five or six mini-projects. Each of these will be announced a week before they are due (usually an in depth exploration of a topic we go over in class).
Grading: Grading will be done on a 700 point scale, with points accumulated throughout the term as follows:
Midterm Examination 1 |
150 points |
Midterm Examination 2 |
150 points |
Final Examination |
200 points |
Homework Assignments |
100 points |
MiniProjects |
100 points |
Total |
700 points |
Honor Principle: Dartmouth students are expected to adhere to the honor principle. In this course that means that while homework can and should be worked on and discussed with others, the work you hand in must be your own. No copying from any source! Tests will be closed book and closed notes. No collaboration is allowed on these tests.
Special Needs: Any student with a disability for whom special accommodations would be helpful is encouraged to discuss this with the instructor as soon as possible.
|