Introduction to Discrete Math (이산수학입문)
|
Class Number: Math 253-002 Dates: Sept 1 2015 - Dec 17 2015 Room: NS-213-2 Meeting time:
Prof: Mark Siggers Office Hours |
|
Syllabus
In this course we introduce discrete structures and counting techniques, and use them to introduce formal written proofs.Computational techniques are invesigated, but the emphasis is on proof techniques.
We will closely follow the text. Here is a tentative weekly schedule.
| Week | Sections | Topics |
| 1 | Chap 1 | Introduction and basic concepts |
| 2 | Chap 2 | Orderings |
| 3 | Chap 3.1 - 3.5 | Combinatorial Counting |
| 4 | Chap 3.7, 3.8, 4.1, 4.2 | Inclusion Exclusion and Intro to Graphs |
| 5 | Chap 4.3 - 4.7 | Graphs |
| 6 | Chap 5 | Trees |
| 7 | - | Test 1 |
| 8 | Chap 6 | Planar graphs |
| 9 | Chap 7 | Double counting |
| 10 | Chap 8 | Counting Spanning Trees |
| 11 | Chap 9 | Projective Planes |
| 12 | Chap 10 | Probabilistic proofs |
| 13 | Chap 11 | Ramsey Theory |
| 14 | - | Test 2 |
Homework
There will be homework problems assigned for each class. You don't have to do them, but we will often have a quiz on a monday based on the homework of the previous week.Tests
There will be two tests. The first one will be Oct 19 or 23, and the final will be Dec 11 or 14. We will decide the date of the exams at least 2 weeks before the exam. About 70% of the questions on the test will be assigned homework problems. 20% will be challenge problems from the book. The remaining 10% will be a delightful surprise.Evaluation
Quizzes: 10%, Tests 2 x 45%. For the quiz mark, we will have upto 10 quizzes, each will be worth 1% of the total grade. You will get at least half the marks on a quiz for a blank quiz, so this is an attendence mark as well.Last Modified: Fri 13 Mar 2026 01:22:20 PM KST