## CSE 321: Discrete Structures

Autumn 1998

Paul Beame and Anna Karlin

## Personnel

## Schedule

Lectures: MWF 10:30-11:20, EE1 045
Quiz AA, Th 1:30-2:20, EE1 031

Quiz AB, Th 2:30-3:20, Loew 220

## Handouts:

Induction for recursively defined sets Postscript or Acrobat PDF or HTML formats

## 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.

## 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. 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:**
[an error occurred while processing this directive].**)

There should be no need for you to send an
initial "subscribe" request to cse321-request. Everyone registered
in the course will be automatically placed on the mailing list
by the end of the first week of the quarter.
If this does not work for you, 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 ** Third Edition** of the
text will be used. The Second Edition is very close but the exercises
differ somewhat between the second and third editions
of the text, so you will need to consult the third 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

Friday, November 6, in class. Closed book, no notes, no calculators.
Old midterms questions study guide

### Final Exam

Friday, December 11, 8:30-10:20 am, in class. Closed book, no notes, no
calculators.

### 321 Webs From Previous Quarters:

cse321-request@cs.washington.edu
(Last Update:
11/19/98
)