About the course

This course is opened for the international students of computer science, class 2016. In this course, after having a review on the content that has been taught in the last semester, which mainly focused on the Logic and Proof, we will learn some basic concept of Boolean Algebra, Relations, and then Sets and Functions. The text book is Discrete Mathematics and Its Applications (7th Edition), written by Kenneth H. Rosen.

Classes (slides)

• Class 1 - Boolean operators, Boolean identities and Duality principle (ppt)
• Class 2 - Boolean Expression, Sum-of-Products Expansions (ppt)
• Class 3 - Minimization of Circuits and Karnaugh maps(ppt)
• Class 4 - Set and Function(ppt)
• Class 5 - Relations-Graphical representation, Properties, Combining(ppt)
• Class 6 - n-ary Relations and Their Applications(ppt)
• Class 7 - Representing Relations(ppt)
• Class 8 - Closure(ppt)
• Class 9 - Equivalence Relations and Partitions (ppt)
• Class 10 - Partial Orderings and Lattices(ppt)
• Class 11 - Sequences(ppt)

Homework

1. Page 818, Exercise 5, 25, 28
2. Page 822, Exercise 2, 4; Page 828, Exercise 5, 6(d)
3. Page 842, Exercise 12, 14
4. Page 153, Exercise 23; Page 154, Exercise 36; Page 155, Exercise 67 (a)(c)(e)(g)
5. Page 581, Exercise 3, 6, 30, 56
6. Page 590, Exercise 28, 29
7. Page 596, Exercise 2(a), 4(a), 14, 27, 32
8. Page 607, Exercise 25(a), 27
9. Page 615, Exercise 1, 47
10. Page 630, Exercise 8(c), 21, 32, 43(a)

Final Exam

Time: 15:00-17:00 Jan. 2 (Tuesday afternoon), 2018

Location: Room 112, Teaching Building 1

Content: From Class 1- Class 10

Use pen (not pencil) to write on the exam papers. If use pencil, zero score.