## CSE 321: Discrete Structures

Spring 2001

Paul Beame

## Personnel

## Schedule

Lectures: MWF 10:30-11:20, Thompson 125
Quiz AA, Th 1:30-2:20, BLD 286

Quiz AB, Th 2:30-3:20, BLD 286

## Homework:

Homework and worksheets are intended to be a
major portion of the course.
Assignments will be due approximately weekly, usually on Friday.
It is expected that homework solutions represent original work.

Assignment #1

Assignment #2

Assignment #3

Assignment #4

Assignment #5

Assignment #6

Assignment #7

Assignment #8

## Handouts:

Supplementary Logic Notes
in Postscript and
in PDF format.

Induction for Recursely Defined Sets
in Postscript and
in PDF format.

Average case analysis of Insetion Sort
in Postscript and
in PDF format.

## The Mailing List

The class mailing list is
cse321@cs.washington.edu
We will use this list for announcements of general interest
to the class. Students should also feel free to use it to
ask questions, post information, or initiate discussions
of general interest to the class. (On the other hand, posting answers to
HW problems before they are due is a no-no.) Questions or comments that are
not of general interest should instead be directed to the TAs
and instructor directly.

Threaded Mailing List Archive
(Last update:**
.**)

Instructions on how to subscribe to the cse321
mailing list directly can be found here.

We will assume that all students in the class are on the
mailing list, and that you read your email regularly.

**Anonymous Feedback**:

Anonymous feedback form to tell
us how things are going.

### Text Book

The text for the course is Rosen, **
Discrete Mathematics and Its Applications**. The ** Fourth Edition** of the
text will be used. The Second and Third Editions are very close but the
exercises differ somewhat between editions
of the text, so you will need to consult the fourth edition to make sure
that you are solving the appropriate problems.

### Grading:

The course grade will be based on worksheets, homework,
class participation, a midterm, and a final exam. The approximate
weighting of the components
is 45-55% worksheets/homework, 15-20% midterm and 30-35% final exam.

### Topics:

Chapters 1-7 will be covered. The main topics will
be logic (1.1-1.3), the integers (2.3), methods of proof (3.1-3.3),
counting and probability (4.1-4.5), relations (6.1-6.4), and
graph theory (7.1-7.5,7.7-7.8).

### Midterm

Monday, May 7, in class. Closed book, no notes, no calculators.
Old midterm questions

### Final Exam

Monday, June 4, 8:30-10:20 am, in class. Closed book, no notes, no
calculators.
Old final exam questions

### 321 Webs From Previous Quarters:

cse321-request@cs.washington.edu
(Last Update:
)