 |
DISCRETE MATHEMATICS
UNIT 1: SET THEORY (Sets, Venn Diagrams, and Logic)
|
UNIT 2: DECISION-MAKING (Election Theory, Group Decision Making)
|
UNIT 3: MATRIX APPLICATIONS (Coding, Graphics, Game Theory)
|
UNIT 4: GRAPH THEORY (Euler Circuits, Networks, Map Coloring)
|
UNIT 5: CARTOGRAPHY/MAPMAKING (Map Projections, Polyhedral Models, Cartograms)
|
UNIT 6: RECURSION/ITERATION (Fractals, Algorithms)
|
Course Summary:
Discrete mathematics is the study of mathematical topics which deal with things that can be counted using whole numbers, rather than continuous sets of numbers (like those covered in Algebra, Trigonometry and Calculus). The focus of this course will be on practical applications of discrete mathematics, particularly to issues of social choice and decision-making, logic and mapping. Students will explore the connections among mathematical topics and real-life events and situations, while sharpening their problem solving, mathematical reasoning and communication skills.
Text:
Discrete Mathematics Through Applications, WH Freeman Press, 2006.
Recommended Supplies:
- TI 83,84 or Nspire graphing calculator
- Notebook or section of a notebook for classnotes and occasional homework. Folder/binder for handouts.
Grading:
Your grade in this course will determined primarily by satisfactory completion of classwork, activities, and projects and active participation in class. Homework will be assigned on an occasional basis and a test will be given on each unit. Students who maintain a A- or above average for the course and who have not exceeded the maximum number of allowable absenses for a semester course will be exempt from the final exam. All students will be required to complete a final project. Marking period weights:
40% Classwork, Activities, Homework
10% Class Participation
50% Quizzes/Tests
** Final Exam/Project (20% of your course grade)
| |
