Discrete Mathematics, 2019 Fall
Course information
- Meetings: Class 01: 1 PM of M/Th @ NTH 313 / Class 02: 4 PM of M/Th @ NTH 220
- TA's Help hour: TBD @ Coding Space (OH 316)
- Instructor: Shin Hong https://hongshin.github.io / hongshin@handong.edu
- Teaching assistants: Jeewoong Kim/ Juyoung Jeon / Hansol Choe / Hyerin Leem (pictures)
Course objectives
This course aims to equip beginner-level undergraduate students studying Computer Science with mathematical essentials. It is designed to articulate students in reading and writing technical descriptions soundly, and reasoning properties of discrete structures (e.g. sets, relations, permutations, graphs, and trees) strategically. Students are expected through out the course to learn how to use mathematical languages to represent the foundamental concepts of Computer Science clearly and to practice these to solve real-world computation problems.
Class policies
Materials
Textbook
Discrete Mathematics and Its Applications, 8/e authored by Kenneth. H. Rosen
This book can be found in Handong Book on campus. It is mandatory for every class participant to hold a copy of this textbook: it will be assumed that every student is able to access the textbook by himself/herself anytime in this semester for doing homework, team projects, etc.
Lecture Notes
- Graph
- Relation
- Discrete Probability
- Counting (Nov 11)
- Recursion (Nov 4)
- Induction (Oct 24, Oct 28)
- Midterm (Oct 21) [class-01] [class-02]
- Algorithm (Oct 10, Oct 17)
- Halting problem (Oct 14)
- Cardinality (Oct 7, Oct 10)
- Sequence (Oct 7)
- Function (Sep 30)
- Set (Sep 26)
- Proof strategies (Sep 23)
- Rule of inference (Sep 16, Sep 19)
- Predicate logic (Sep 10, Sep 16)
- Propositional logic (Sep 2, Sep 5)
- Course Overview (Aug 26)
- c.f. ITP 20002-02 Discrete Math, 2018 Fall: exams, assignments, lecture notes (may be outdated)
Assignments & Homework
- PA3. Naive Bayes Text Classifier [desc] [data & starter code]
- HW2. Converting Propositonal Formula to DNF [desc]
- PA2. Recursion [desc]
- HW1. One More Puzzle with SMT Solver [desc]
- PA1. Solve Puzzle with SMT Solver [desc]
Useful references
- Foundations of Computer Science, Stanford University
- Mathematics for Computer Science, MIT OCW
- Discrete Mathematics: An Open Introduction, 3/e by Oscar Levin
- Programming and Mathematical Thinking: A Gentle Introduction to Discrete Math Featuring Python by Allan M. Stavely
- ITP 20002-02 Discrete Math, 2018 Fall: lecture note (may be outdated), assignments, etc.
Online channels
- Piazza for news, Q&A, and online discussions
- Hisnet for attendance check & homework submission
- GitHub repository for sharing lecture note, resource for homework, etc.