ESTR 2004: Discrete Mathematics for Engineers (ELITE Stream)
2017-18 First Term
- NEW: There will be no lecture on September 18, 20, and 21.
- NEW: Homework 1 is now posted. It is due on September 25, 2017.
- The Thursday tutorials will be used as lectures. For the tentative class schedule, please see Section 5 of the Information Sheet. The next lecture will be on September 7, 2017.
- Welcome to ESTR 2004! This is the ELITE Stream version of ENGG 2440A/B. The coverage of topics will be slightly different from that in ENGG 2440A. In particular, we will not cover LLM Chapters 1 and 2. Interested students can read up these chapters on their own.
- To better facilitate discussions and Q&As, we have set up an online platform. Please follow this link to sign up.
- PLEASE READ: Student/Faculty Expectations on Teaching and Learning, from the Faculty of Engineering, The Chinese University of Hong Kong.
- Instructor: Anthony Man-Cho So (manchoso at se.cuhk.edu.hk)
- Office Hours: Thursdays 3:30pm - 5:00pm or by appointment, in ERB 604
- Lecture Time/Location:
- Mondays 10:30am - 12:15pm, in ERB 804
- Wednesdays 1:30pm - 2:15pm, in LHC 106
- Thursdays 10:30am - 12:15pm, in ERB 804
- Teaching Assistants:
- Zengde Deng (zddeng at se.cuhk.edu.hk)
- Office Hours: Wednesdays 3:30pm - 4:30pm, in ERB 810C
- Sen Huang (hsen at se.cuhk.edu.hk)
- Office Hours: Fridays 11:00am - 12:00pm, in ERB 905
- Yuen Man Pun (ympun at se.cuhk.edu.hk)
- Office Hours: Wednesdays 9:30am - 10:30am, in ERB 905
- Peng Wang (wangpeng at se.cuhk.edu.hk)
- Office Hours: Tuesdays 3:30pm - 4:30pm, in ERB 810A
- Xiaolu Wang (xlwang at se.cuhk.edu.hk)
- Office Hours: Tuesdays 10:30am - 11:30am, in ERB 905
- Online Q&A Forum: Follow this link.
Just as calculus is the mathematical foundation for natural sciences, discrete mathematics is the mathematical foundation for computing sciences. In this course, we will cover the basic techniques of discrete mathematics, which are essential for manipulating and reasoning about finite or countable sets of objects. Applications from various disciplines, such as computer science, operations research, and probability, will be used to illustrate the theory.
- Homework Sets (35%)
- Midterm Examination (20%)
- Final Examination (30%)
- Essay (15%)
The primary text for this course is Eric Lehman, F. Thomson Leighton, Albert R. Meyer (LLM), Mathematics for Computer Science, 2010.
- Richard A. Brualdi, Introductory Combinatorics (5th Edition), Pearson Education, Inc., 2010.
- Susanna S. Epp , Discrete Mathematics with Applications (4th Edition), Brooks/Cole Cengage Learning, 2011.
- Ronald L. Graham, Donald E. Knuth, Oren Patashnik (GKP), Concrete Mathematics (2nd Edition), Addison-Wesley, 1994.
- Kenneth H. Rosen, Discrete Mathematics and Its Applications (7th Edition), McGraw-Hill, 2012.
Schedule and Reading
- Week 1: Sep 6 Information Sheet, Notes. Familiarize yourselves with the material in LLM Chapters 1 and 2. Sep 7 Notes. Read LLM Chapter 3.1-3.2.
- Week 2: Sep 11 Notes. Read LLM Chapters 3.3-3.4 and (optional) 3.5. Sep 13 Notes. Read LLM Chapters 9.1-9.2. Sep 14 Notes. Read LLM Chapter 9.5.
About the Essay
Towards the end of the course, you will need to write a short (4-5 pages), complete account of a result in discrete mathematics. The essay should include the background, statement, proof, and applications of the result. More details will be announced later in the course.
Last Updated: September 18, 2017