Discrete Mathematics (Spring Semester, 2011)*"Student-teacher relationships are based on trust. Acts, which violate this trust, undermine the educational process. Your classmates and the instructor will not tolerate violations of academic integrity"*Course Schedule & Lecture Notes |
* [March 03] Introduction Course Intro.
* [March 08] Ch.1 Puzzles, Patterns, and Mathematical Language Chapter01-1.ppt HW-1.ppt * [March 10] Ch.1 Puzzles, Patterns, and Mathematical Language Chapter01-2.ppt * [March 15] Ch.1 Puzzles, Patterns, and Mathematical Language Chapter01-3.ppt * [March 17] Ch.1 Puzzles, Patterns, and Mathematical Language Chapter01-4.ppt * [March 22] Ch.2 A Primer of Mathematical Writing Chapter02-1.ppt, HW-2.ppt * [March 24] Ch.2 A Primer of Mathematical Writing Chapter02-2.ppt * [March 29] Ch.2 A Primer of Mathematical Writing Chapter02-3.ppt * [March 31] Ch.2 A Primer of Mathematical Writing Chapter02-4.ppt * [April 05] Ch.3 Sets and Boolean Algebra Chapter02-5.ppt, Chapter03-1.ppt, HW-3.ppt * [April 07] Ch.3 Sets and Boolean Algebra Chapter03-2.ppt * [April 12] Ch.3 Sets and Boolean Algebra Chapter03-3.ppt * [April 14] Ch.3 Sets and Boolean Algebra Chapter03-4.ppt DM_score3.zip * [April 19] *Midterm Exam.* DS_Midterm_Result.pdf * [April 26] Ch.4 Functions and Relations Chapter04-1.ppt, HW-4.ppt * [April 28] Ch.4 Functions and Relations Chapter04-2.ppt * [May 03] Ch.4 Functions and Relations Chapter04-3.ppt * [May 05, 10] (No Lecture) * [May 12] Ch.4 Functions and Relations (continue with the "Chapter04-3.ppt" material) * [May 17] Ch.4 Functions and Relations Chapter04-4.ppt * [May 19] Ch.5 Combinations Chapter05-1.ppt * [May 24] Ch.5 Combinations Chapter05-2.ppt * [May 26] Ch.5 Combinations Chapter05-3.ppt Chapter07-1.ppt HW-5.ppt (the last home work) * [May 31] Ch.7 Graphs and Trees Chapter07-2.ppt * [June 02] Ch.7 Graphs and Trees Chapter07-3.ppt * [June 07] Ch.7 Graphs and Trees * [June 09] *Firnal Exam.* |
* Lecturer: Youn-Hee Han (Rm. B303, Tel: 560-1486, yhhan@kut.ac.kr:8080) * Classes: Tuesday (14:00-15:50), Thursday (14:00-15:50) * Lecture Room: A102 * TA: 강인석 (iseka@kut.ac.kr:8080, HP: 010-9191-7110) * Course Board: Click * Course Description: What is Discrete Mathematics? (excerpted from an Elsevier journal's article) Many problems of science deal with quantities so large that it is natural to assume that they are dense, continuously distributed, and that all real numbers can be used to measure them. Centuries of development of 'continuous mathematics' have given us extremely powerful tools for handling these kinds of problems. Other problems are so small that we can deal with all the possible cases by hand. These are truly 'finite' problems. Some of the most important problems, however, fall in between: not big enough to assume density, continuity, etc., but not small enough to allow us to consider all cases. These are, for the most part, the problems with which discrete mathematics deals. Because increasingly powerful computers are allowing us to replace computations by hand, it is becoming increasingly feasible to deal with problems of discrete mathematics. This explains, in part, why discrete mathematics has become perhaps the fastest growing field of modern mathematics and computer sceince. Many of the basic problems of the physical sciences, dealing with time, mass, velocity, etc., are of the first kind. So are many problems in the biological sciences. However, many problems of the social and behavioral sciences fall in the middle ground. The tools of discrete mathematics are especially relevant here. |
References |
* 주교재: *Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns, and Games, Douglas E. Ensley, J. Winston Crawley, 2006, ISBN: 978-0-471-47602-3* |
* 주교재 홈페이지 * http://webspace.ship.edu/deensley/DiscreteMath/flash/index.html |
Logistics |
* Attendance - one class absence will result in the deduction of two points out of 100 points. Five absences will not result in ten points deduction, but "failure" (i.e., grade 'F') in this course. * Exam - there will be midterm exam and final exam for the evaluation of the knowledge learned from the class. * Homework - much intensive homework will be set. Any cheating (or copying) will result in grade 'F'. |
Evaluation |
* Attendance (10%), Homework (20%), Term Project (30%), Midterm exam (40%) |