Discrete mathematics is an exciting and rapidly growing area of mathematics which has important applications in computer science and in many high technology areas. For example, "secure" internet communication, efficient storage of data (e.g. jpeg) and robust communication networks are developed using techniques from discrete mathematics.
This course serves two main populations, students from mathematics and students from computer science. The course also has two distinct goals: one is to teach the basics of set theory, logic, combinatorics and graph theory. The other is to convey concepts essential to mathematics: absolute clarity and precision in definitions and statements of fact, and rigorous methods for establishing that a statement is true.
We will have weekly assignments, three midterms and a final exam. The midterms will be scheduled for Wednesdays, if not announced otherwise. For the weekly assignments, there will be a small number of problems (10 or so) which you should write up carefully. They will be graded and returned to you promptly (to the best of my ability).
I recommend that you do or at least attempt most of the exercises in the book. That is the best way to learn!
Point value for the work will be as follows (plus or minus 50 points)
| Weekly work | 200 |
| Test 1 | 150 |
| Test 2 | 150 |
| Test 3 | 150 |
| Final | 350 |
| Total | 1000 |