EE 2060 Discrete Mathematics

Spring 2025

Course Staff

Instructor:

Jay Cheng (鄭傑), Delta 811 (台達館 811), ext. 62207.

Lectures: T7T8R7, Delta 215 (台達館 215).

Office Hours: W2F2, after classes, or by appointment.

Teaching Assistants:

吳松煌 (gazoz415230_mom@yahoo.com.tw)
王瑋鑫 (w910709@gmail.com)

EECS 805 (資電館805), ext. 34154

TAs' Office Hours: W9

Announcements

The following schedule is subject to change as the course progresses, and you should come back frequently for the most recent update.

Homework solutions and your grades are constantly updated at https://elearn.nthu.edu.tw/
It is your responsibility to keep us informed as soon as possible if there is any mistake regarding your grades.
We do not allow any change of the grades two weeks after they are posted.
Presentation
想要加簽的同學請不用另外寄信來詢問，直接從學校系統進行選課作業就可以，老師一定會同意。

2月18號上完第一堂課之後，決定要修這門課的同學可以跟助教登記上課筆記，
從2月25號開始一直到學期末同學們就要開始上台報告
(每次上課前先閱讀完上課筆記與課本內容，基本上每個星期至少會輪到一次)。

這門課適合肯努力想提升水平的同學，想輕鬆過關或者沒有足夠動機努力的同學建議千萬不要修。
同學們很喜歡問何謂努力認真，我覺得每個星期最起碼花20到30個小時在這門課應該就可以。
之前老師的另一門客線性代數第一堂課大概有130多位同學，
第三個星期之後剩下大概20位左右，學期末剩下大概10左右，
從這幾年的經驗來看學校裡每年應該只有10位左右的同學勉強可以修這門課。
Schedule, homeworks, and exams (subject to minor changes)

2/25: pp. 1-1~1-5
2/27: pp. 1-6~1-9 + HW #1(a)

3/4: pp. 1-10~1-13
3/6: p. 1-14~1-17

3/11: pp. 1-18~1-24
3/13: p. 1-25~1-28 + HW #1(b)

3/18: pp. 1-29~1-32
3/20: pp. 1-33~1-36 + HW #1(c)

3/25: pp. 1-37~1-39 + pp. 2-1~2-14
3/27: pp. 2-15~2-75

4/1: pp. 2-76~2-144
4/3: HW #2 + Exam #1 (due 11:59 pm on 4/6)

4/8: pp. 3-1~3-87
4/10: pp. 4-1~4-33 + HW #3

4/15: pp. 4-34~4-83
4/17: pp. 4-84~4-102 + HW #4

4/22: pp. 5-1~5-83
4/24: HW #5 + Exam #2

4/29: pp. 6-1~6-72
5/1: HW #6

5/6: pp. 7-1~7-74
5/8: HW #7

5/13: pp. 8-1~8-74
5/15: HW #8 +Exam #3

5/20: pp. 9-1~9-58
5/22: HW #9

5/27: pp. 10-1~10-119
5/29: HW #10

6/3: pp. 11-1~11-66
6/5: HW #11 +Exam #4

Textbook

K. H. Rosen, Discrete Mathematics and Its Applications, 8th ed., McGraw-Hill Education, 2019.

References

1. S. S. Epp, Discrete Mathematics with Applications,, 5th ed., Cengage Learning, Inc., 2020.

2. C. L. Liu, Elements of Discrete Mathematics, 2nd ed., McGraw-Hill, 1985.

Course Descriptions

This is an introductory course to discrete mathematicsa and is the key to the success of many subjects that you will encounter in the future.

Syllabus

1. The Foundations: Logic and Proofs

2. Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

3. Algorithms

4. Number Theory and Cryptography

5. Induction and Recursion

6. Counting

7. Discrete Probability

8. Advanced Counting Techniques

9. Relations

10. Graphs

11. Trees

12. Boolean Algebra

13. Modeling Computation

Homework

Homework assignments will be due at the start of classes one week after they are announced (unless otherwise specified) and no late submissions will be accepted.
If you are using brand new paper for your homework reports, please write down your answers on both sides of the paper so that we won't waste too much of our natural resources (we reserve the right not to grade such homework reports).

You may discuss the homework problems with your classmates, but should write down every piece of the homework yourself instead of copying others' works.
You should note on each submission the names of everyone you have worked with regardless of whether you have given help, received help, or both
(failing to do so will lead to a failing grade for this course).