image University of Washington Computer Science & Engineering
  CSE 321Sp '09:  Discrete Structures
  CSE Home   About Us    Search    Contact Info 

Administrative
 Schedule & Reading
 Midterm Review
 Final Review
 Catalyst Gradebook
Course Email
 Subscription Options
 Class List Archive
 E-mail Course Staff
Assignments
 HW #1
 HW #2
 HW #3
 HW #4
 HW #5
 HW #6
 HW #7
 HW #8
Lecture Notes
 Lecture 1
 Lecture 2
 Lecture 3
 Lecture 4
 Lecture 5
 Lecture 6
 Lecture 7
 Lecture 8
 Lecture 9
 Lecture 10
 Lecture 11
 Lecture 12
 Lecture 13
 Lecture 14
 Lecture 15
 Lecture 17
 Lecture 18
 Lecture 19
 Lecture 20
 Lecture 21
 Lecture 22
 Lecture 23
 Lecture 24
 Lecture 26
 Lecture 27
 Lecture 28
 Lecture 29
   

Lecture:  EEB 037 (schematic) MWF 1:30- 2:20 
Section A:  EEB 025 (schematic) Th 1:30- 2:20 
Section B:  EEB 025 (schematic) Th 2:30- 3:20 
 
Office Hours Location Phone
Instructor:  Larry Ruzzo, ruzzo at cs  Tu 1:30- 2:20  CSE 554  206-543-6298
TAs:  Derek Cheng, imcheng at cs  Th 11:00- 11:50  CSE 216 
    F 11:30- 12:20  CSE 216 
  Aeron Bryce, paradoxa at cs  F 12:30- 1:20  CSE 216 

Course Email: cse321a_sp09@u.washington.edu. Use this list to ask and/or answer questions about homework, lectures, etc. The instructor and TAs are subscribed to this list. All messages are automatically archived.  Questions not of general interest may be directed to the instructor and TAs: cse321-staff, or just to the instructor: ruzzo at cs. You will probably want to change your subscription options.

Catalog Description: Fundamentals of set theory, graph theory, enumeration, and algebraic structures, with applications in computing.

Prerequisite: CSE 143; either MATH 126, MATH 129, or MATH 136.

Credits: 4

Standard Syllabus: CSE 321 Syllabus

Grading: Homework, Midterm, Final. Overall weights: HW 55%, midterm 15%, final 30%, roughly.

Late Policy: Assignments are due at the start of class on the due date. 20% off per day thereafter (day = business day, e.g., Monday = Friday + 1).

Extra Credit: Assignments may include "extra credit" sections. These will enrich your understanding of the material, but at a low points per hour ratio. Do them for the glory, not the points, and don't start extra credit until the basics are complete.

Collaboration: Homeworks are all individual, not group, exercises. Discussing them with others is fine, even encouraged, but you must produce your own homework solutions. Follow the "Gilligan's Island Rule": if you discuss the assignment with someone else, don't keep any notes (paper or electronic) from the discussion, then go watch 30+ minutes of mind-numbing TV (Gilligan's Island reruns especially recommended) before you continue work on the homework by yourself. You may not look at other people's written solutions to these problems, not in your friends' notes, not in the dorm files, not on the internet, ever. If in any doubt about whether your activities cross allowable boundaries, tell us before, not after, you turn in your assignment. See also the UW CSE Academic Misconduct Policy, and the links there.

Textbook: Discrete Mathematics and Its Applications, (sixth edition) by Kenneth Rosen, McGraw-Hill, 2006. Errata. (Available from U Book Store, Amazon, etc.)


Portions of the CSE 321 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 321 Web: © 1993-2009, Department of Computer Science and Engineering, University of Washington.

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX