Discrete Math (이산수학입문 )

Class Info

Class Number: Math 253-02
Dates: Aug 31 2010 - Dec 02 2010
Room: NS2 401
Meeting time:
Tuesday 10:30 - 12:00
Thursday 9:00 - 10:30

Text: Ralph P. Grimaldi "Discrete and Combinatorial Mathematics" (5th edition, Pearson Addison Wesley, 2004)
Links
Materials
Homework

Final Exam: Tuesday December 14, 10:30 - 12:30, NS218.

This is a closed book written test. The range is as shown in the syllabus until Chapter 4.5 of the textbook plus the lecture notes 23 and 24 on Graph Theory from the Materials.

Syllabus

We will stay pretty close to the following schedule, covering about two sections of the text per week.
Week Sections Topics
1 1.1-2 Principles of Counting, Permutations
2 1.3-4 Combinations
3 2.1-2 The Basics of Logic
4 2.3-4 Implication and Quantification
5 3.1-2 Basic Set Theory
6 3.3-4 Counting and Probability
7 - Midterm Exam
8 4.1-2 Induction and Recursion
9 4.3-5 Integer Factorization
10 10.1-2 Recurrence Relations
11 10.2-3 Second Order and Nonhomogeneous Recurrences
12 11.1-2 Basic Graph Theory
13 11.3-4 Eulerian and Planar Graphs
14 11.5-6 Hamiltonian Graphs and Coloring
15 - 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%
Mid-term: 40%
Final: 50%

Homework

I will assign homework on Thursday for the material covered that week.
It will be due to hand in on the following Thursday.
Last modified: Wed Dec 1 11:27:47 KST 2010