L
CSE 321
Discrete Structures
Winter Quarter, 2001
Organization
| |
Name |
Office Hours |
| Instructor |
Dieter Fox |
W 01:30-02:20 or by appointment |
| Teaching Assistant |
William Pentney |
M 02:30-03:20 or by appointment |
Lecture
- Times: MWF 11:30-12:20
- Location: EE1 037
Quiz
- Times: Th 01:30-02:20
- Location: MEB 248
Homework
Grading
The course grade will be based on homework, class participation, a midterm,
and a final exam. The approximate weighting of the components is 45-55%
homework, 15-20% midterm and 30-35% final exam.
Exams
Mailing List
To subscribe to the mailing list, send email to majordomo@cs with
an empty subject line and the text
subscribe cse321
as the body of the message. The address of the mailing list is
cse321@cs. Do not send subscription requests
to the list itself.
We will assume that all students in the class are on the
mailing list, and that you read your email regularly.
Threaded Mailing List Archive
Text Book and Topics
- The text for the course is Rosen, Discrete Mathematics and Its
Applications (fourth edition).
-
Syllabus
- 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).
Miscellaneous
The wumpus world :-)
Sample proof (problem from HW 2)
random.c - Simple pseudorandom number generator
Resources on proofs (select item 17 in menu)
The RSA Algorithm - public-key encryption demo using Javascript. Evidence that number theory can, in fact, be very useful :-)
The Monty Hall problem mentioned in class, here discussed in detail in the Straight Dope newspaper column. Some interesting exchanges on the subtleties of the problem.
Please email me if you have any
questions.