Discrete Math (이산수학입문 )

Final Exam: Wednesday December 9, 10:30 - 12:30, NS2 401

Class Info

Class Number: Math 253-02
Dates: Aug 31 2009 - Dec 02 2009
Room: NS2 401
Meeting time:
Monday 9:00 - 10:15
Wednesday 10:30 - 11:45

Text: Richard Brualdi's "Introductory Combinatorics" (5th edition, Pearson Prentice Hall, 2010)
Links
Homework
Material covered

Syllabus

We will stay pretty close to the following schedule, covering about one chapter of the text per week.
Week Chapters Topics
1 1 What is Combinatorics?
2 2 Permutations and Combinations
3 3 The Pigeonhole Principle
4 4 Generation of Permutations and Combinations
5 5 Binomial Coefficients
6 6 Inclusion-Exclusion
7 - Midterm Exam
8 7.1 - 7.3,7.6 Generating Functions
9 7.4,7.5 Recurrence Relations
10 8 Special Counting Sequences
11 9 Systems of Distinct Representatives
12 10 Combinatorial Designs
13 11 Graph Theory
14 - Final Exam

Grading

We will have weekly homework assignments, one mid-term test, and a final exam.
The grades will be accorded the following weights.
Attendance 10%
Homework: 10%
Mid-term: 40%
Final: 40%

Homework

I will assign homework on Wednesday for the material covered that week.
It will be due to hand in on the following Wednesday.
Last modified: Mon Nov 30 16:27:19 KST 2009