Discrete Math (이산수학입문 )

Class Info:

Class Number: Math 253-001
Dates: Aug 30 2010 - Dec 03 2010 (+ final)
Room: NS2 401
Meeting time:
Mon/Fri 5B-6B (1:30 - 2:45)

Text: Grimaldi's "Discrete and Combinatorial Mathematics: An Applied Introduction" (5th edition)
Prof: Mark Siggers
Office Hours: Wed 1:30-2:30, Fri 10:30-11:30
Links
Homework and Material covered

Syllabus

We will stay pretty close to the following schedule. The specific sections in the text that I intend to cover are listed on the homework page.
Week Topics
1 - 2 Fundamentals of counting, permutations, combinations
3 - 4 Formal logic: truth tables, logical equivalence and inference, proof by contradiction, quantification
5 - 6 Set theory: basic laws, Venn Diagrams, probability
7 Induction and recursion.
8 Midterm Exam
9 GCD, Euclidean Algoritm, Fundamental Theorem of Algebra
10 - 11 Recurrance relations
11 - 13 Graph Theory
14 Final Exam

Grading

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

Homework

There will be four required homework assignments. On top of this I will list 'suggested problems'. These are problems that you should at least look at and be able to do. Your test problems will be made up largely from these or similar problems. If you you would like input on your solutions to these problems you may hand them in.

Tests

You will have two tests, each covering about half of the covered material. One will be on Friday Oct 22 and the other will be on Friday Dec 10.
Last Modified: Fri 13 Mar 2026 01:22:19 PM KST