| Instructor:
Dr. Su-Hui
Chiang (suhui at cs.pdx.edu) Office hours: MW 12:30-1:30 PM Office: FAB 120-09 |
TA:
Ralf Juengling
(juenglin at cs.pdx.edu)
Office hours: Thursday 8-10AM & Friday 8-9AM Location: In the CS tutor area |
Course overview: This is an introductory course in discrete structures. Topics include (1) sets, functions, recurrences, relations, and proof techniques; (2) graphs and trees; (3) counting and discrete probability. There is no prerequisite. See here for the official description of the course and objectives.
Required textbook:
"Discrete Structures, Logic, and
Computability", Third Edition, by James L. Hein. Jones and Bartlett,
2009.
(Only Chapters 1-5 will be covered in this course.)
Schedule: The schedule page contains the schedule of lectures, exams, and homeworks.
Course work:
There will be weekly homework problems, two midterm exams, and one
final exam.
Homework: See schedule page.
Class e-mailing list: cs250-listf09@cs.pdx.edu. Please subscribe to the list in the first week of the term, at https://mailhost.cecs.pdx.edu/mailman/listinfo/cs250-listf09. This list is for occasional class announcement. You can also email to the list for discussing general class information and material.
Grades: will be based on the following weights:
25% homework
45% for the two midterm exams
(20%, 25%)
30% final exam