Discrete Mathematics

In this first-year undergraduate course. During the course, students learn about a variety of mathematical concepts used in computer science:

  • Formal logic and proofs form the basis for any rigorous mathematical reasoning. It is important to know the difference between syntax and semantics, and to know what is acceptable as a proof.
  • Sorting and searching are the most-used non-trivial algorithms.
  • Recurrence relations allow to reason about how efficient a recursive algorithm is.
  • Number theory: calculations in the computer work because finite rings and fields are mathematically sound structures.
  • Graphs can be used to describe many kinds of relations between items.  Trees are a specific form of graph.

Textbook:

  • Discrete Mathematics and Its Applications(8th Edition), Kenneth H. Rosen, 机械工业出版社

Instructors:

  • Prof. Lijun Zhang
  • Prof. Zhilin Wu

Assistants:

  • Asso. Prof. David N. Jansen
  • Assi. Prof. Pengfei Yang