Discrete Math (이산수학입문 )

Class Info

Class Number: Math 253001
Dates: Sep 4 - Dec 7, 2012
Room: NS2 401
Meeting time:
Tuesday 9:00 - 10:15
Thursday 10:30 - 11:45

Text: Richard Brualdi's "Introductory Combinatorics" (5th edition, Pearson Prentice Hall, 2010)
Links
Homework
Material covered
Play the Game of Nim
Solve the Towers of Hanoi puzzle

This course is an introduction to Discrete Mathematics and basic Combinatorics.

Final Exam: December 13, 10:30 - 12:30, room NS2 401


The final exam is closed book. No written or electronic aids are allowed (nor needed).

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/Homework: 10%
Mid-term: 40%
Final: 50%

Homework

I will assign homework every Thursday for the material covered that week.
It will be due to hand in on the following Thursday.
Last modified: Fri Nov 30 14:49:23 KST 2012