Printed Syllabus; see also notes below.
Assignment 1, due Friday 9/13 in class. Answer Key.
Assignment 2, due Friday 9/20 in class. Answer Key.
Assignment 3, due Friday 9/27 in class; the longer assignment 4 is due the following Friday 10/4. Answer Key.
Assignment 4 by itself, no change from above, again due Friday 10/4. Answer Key.
Assignment 5, due Friday 10/25. Answer Key (plaintext).
Assignment 6, due Friday 11/1. Answer Key.
Assignment 7, due Friday 11/8. Answer Key (plaintext).
Assignment 8, due Friday 11/15. Answer Key ( plaintext).
Assignment 9 (the last), due Friday 12/6.
Answer Key (
plaintext).
Course Description This course teaches fundamental mathematics for understanding computation. As calculus is vital to understanding and engineering analog systems, discrete mathematics is the stuff of digital systems. The course begins with the elements of symbolic logic and set theory, and continues with parts of number theory used for instance in cryptography. Then it covers clever methods of counting---permutations and combinations---and basic discrete structures, such as graphs and trees. The two most important skills that should result from this course, using the ABET accreditation wording, are:
These outcomes will be measured by grades on exams and written homeworks, and participation in recitations and lectures.
Bill Rapaport's CSE191 Page. My syllabus, order of lectures, grading policy, and course organization will be ``similar but a little different.'' For instance, I will have 2 prelim exams in place of one midterm, and the coverage of Chapter 1 (Logic) will be somewhat quicker.
Bill Rapaport's Lecture Calendar---it has online notes in rough parallel with my lectures.
UB Accessibility Resources Office, as discussed in class and in private.
Week I Reading Assignment: Text, up through section 1.6. This will be tied to a quiz in lecture on Friday, Sept. 6. The quiz will be closed-book, closed-notes, 15 minutes.
There is a lot of "FYI" material in the early sections, and I won't "officially cover" them all, though they are useful to read. For example, I've already alluded to the fact that notation like Quarterback(x) is used in "logic programming" and other AI applications---if this helps motivate pages 51-52 then fine as FYI, but coverage of Prolog itself (where it would be "quarterback(X)") is left to CSE305. Particular topics where it's useful to know what they are before my lectures do (more) things with them: