Exercises
Exercises for Teaching Discrete MathematicsWelcome to the SIGCSE Committee on the Implementation of a Discrete Mathematics Course's collection of representative exercises. The Committee's task was to develop and disseminate models for a one-semester course for Computing Curriculum 2001's Discrete Structures area. Part of this effort included identifying exercises and examples that instructors can use in such courses. The Committee has identified the following set of exercises from the 5th edition of Kenneth Rosen's text Discrete Mathematics and Its Applications. These problems were chosen because they can be characterized as moderate to hard. Some of them are challenging enough to be assigned as group projects or take-home questions. Exercises similar to these can be found in any of the textbooks cited in the three models in the Committee's main report. (Rosen's text was chosen because it is the one most familiar to one of the co-facilitators, Bill Marion, who has used various editions over time.) The Committee is seeking copyright clearance to post the full text of the exercises here. In the mean time, we list exercise numbers and page numbers. Note that page numbers indicate the first page in each set of exercises. Exercises are organized according to the Computing Curriculum 2001 units within discrete structures, namely...
|
||
DS1. Functions, Relations, and Sets
DS2. Basic Logic
DS3. Proof Techniques
DS4. Basics of Counting
|
|
DS5. Graphs and Trees
DS6. Discrete Probability
|

