CARROLL COLLEGE
Department of Mathematics , Engineering, Physics,
and Computer Science
MA 328 Modern Applications of Discrete Mathematics Fall, 2000
9 - 9:50 p.m. MWF 114 SI
Instructor: Philip B. Rose
TEXT: Discrete Mathematics and its Applications by Kenneth Rosen, 4th ed., 1999, McGraw Hill.
COURSE OBJECTIVES:
The goals of a course in discrete mathematics are several. Discrete mathematics deals with processes that are made up of individual steps as opposed to the calculus, which studies processes which change continuously. Topics studied will be chosen from graph and tree theory, modern applications of number theory, combinatorics, algorithms and their analysis, Boolean algebra, logic, modeling computations and the design of computing machines. Our author interweaves five themes throughout the text: mathematical reasoning, combinatorial analysis, discrete structures, applications and modeling, and algorithmic thinking. This course will emphasize modern applications that are being used in today's world. We will study enough of the subject matter of each topic to be able to understand and appreciate some applications of it. We will do some work on computers using the program Mathematica and the graphing calculator (TI family).
GRADING PROCEDURE:
Collected Assignments ...................................................................................................... 20% of final grade
Three 1 Hour Exams .......................................................................................................... 60% of final grade
Comprehensive Final Exam................................................................................................ 20% of final grade
A: 90 - 100% B: 80 - 89% C: 70 - 79% D: 60 - 69% F: Below 60%
NOTES:
1. The schedule on the following page is very tentative. Firm dates for exams will be announced at least one week in advance. There will be no unannounced quizzes.
2. Due dates for homework that will be collected (not all homework will be collected; any work not collected will be gone over in class) and any special assignments or projects will be specified when the work is assigned. Late assignments will not be accepted.
3. The final exam is comprehensive.
4. I do not take role, except at first to see who is in the class and to try to get to know who you are. But attendance is strongly recommended. I expect students to be able to ask and answer questions on the assigned readings, to be actively involved in the classroom discussions and to participate in any group projects. Therefore, if you miss a class, first get the notes from a fellow student and then come in to see me during office hours with questions you might have over the material.
5. There will be no make-up exams except for the most stringent of reasons, such as death, plague, nuclear war, or invasion by aliens and these must be documented. Also, make up exams are always more difficult than scheduled exams.
6. The final exam is Wednesday, Dec 20, 2000 from 10 a.m. to 12 a.m.. Note that this exam date may not be changed or moved. Make your Christmas / travel plans accordingly. Yes, that is the next-to-last scheduled exam time, but you know that now, so plan accordingly. Re-read this paragraph now.
Tentative Schedule
Aug 28 M Chap. 1: The Foundations: Logic, Sets, and Functions
30 W Chap. 1: The Foundations: Logic, Sets, and Functions
Sep 1 F Chap. 1: The Foundations: Logic, Sets, and Functions
4 M Labor Day, no classes
6 W Chap. 1: The Foundations: Logic, Sets, and Functions
8 F Chap. 1: The Foundations: Logic, Sets, and Functions
11 M Chap. 1: The Foundations: Logic, Sets, and Functions
13 W Chap. 2: The Fundamentals: Algorithms, the Integers, and Matrices
15 F Chap 2: The Fundamentals: Algorithms, the Integers, and Matrices
18 M Chap 2: The Fundamentals: Algorithms, the Integers, and Matrices
20 W Chap 2: The Fundamentals: Algorithms, the Integers, and Matrices
22 F Chap 2: The Fundamentals: Algorithms, the Integers, and Matrices
25 M Chap 2: The Fundamentals: Algorithms, the Integers, and Matrices
27 W ***** Quiz 1 over chapters 1 and 2
29 F Chap 4: Counting
Oct 2 M Chap 4: Counting
4 W Chap 4: Counting
6 F Chap 4: Counting
9 M No Class - Fall Break
11 W No Class - Fall Break
13 F No Class - Fall Break
16 M Chap 7: Graphs and related topics
18 W Chap 7: Graphs and related topics
20 F Chap 7: Graphs and related topics
23 M Chap 7: Graphs and related topics
25 W Chap 7: Graphs and related topics
27 F Chap 7: Graphs and related topics
30 M ***** Quiz 2 over chapters 4 and 7 *****
Nov 1 W Chap 8: Trees
3 F Chap 8: Trees
6 M Chap 8: Trees
8 W Chap 8: Trees
10 F Chap 8: Trees
13 M Chap 8: Trees
15 W Chap 9: Boolean Algebra
17 F Chap 9: Boolean Algebra
20 M Chap 9: Boolean Algebra
22 W No Class – Thanksgiving break
24 F No Class – Thanksgiving break
27 M Chap 9: Boolean Algebra
29 W ***** Quiz 3 over chapters 8, 9 *****
Dec 1 F Chap 10: Modeling Computation
4 M Chap 10: Modeling Computation
6 W Chap 10: Modeling Computation
8 F Chap 10: Modeling Computation
11 M Chap 10: Modeling Computation
13 W Chap 10: Modeling Computation
Final Exam: Wednesday, December 20, 2000 from 10 a.m. to 12 noon. As noted above, this exam date may not be changed or moved. Make your Christmas / travel plans accordingly.