1、离散数学简介Introduction to Discrete MathematicsDate 1裘国永Date 2裘国永Date 3裘国永nLearn to failn Fail to learnDate 4裘国永n The goals of the course: let studentsn Learn a particular set of mathematical facts and apply them (mathematical maturity: ability to understand and create mathematical arguments)n Think logi
2、cally and mathematically (mathematical reasoning, algorithmic thinking)n Think like a computer scientist- computing thinking(计算思维 )Date 5裘国永n It is critical for computer science students to think logically. Essentially, a logical bug-free computer program is equivalent to a logical proof.Date 6裘国永n
3、Computational thinking will be a fundamental skill used by everyone in the world by the middle of the 21st Century， just like reading, writing, and arithmetic.n 计算思维是运用计算机科学的基础概念进行问题求解、系统设计、以及人类行为理解等涵盖计算机科学之广度的一系列思维活动。 Date 7裘国永n Some Examples of CT n How difficult is this problem and how best can I
4、 solve it? Theoretical computer science gives precise meaning to these and related questions and their answers. n CT is thinking recursively. n CT is reformulating a seemingly difficult problem into one which we know how to solve. Reduction, embedding, transformation, simulation Date 8裘国永n CT is int
5、erpreting code as data and data as code. n CT is using abstraction and decomposition in tackling a large complex task. n CT is judging a systems design for its simplicity and elegance. Date 9裘国永n CT is type checking. n CT is prevention, detection, and recovery from worst-case scenarios through redundancy, damage containment, and error correction. n CT is modularizing something in anticipation of multiple users and prefetching and caching in anticipation of future use. Date 10裘国永
