Download Intro - 暨南大学计算机科学系

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Computer vision wikipedia , lookup

Computer and network surveillance wikipedia , lookup

Wizard of Oz experiment wikipedia , lookup

Computer program wikipedia , lookup

Secondary School Mathematics Curriculum Improvement Study wikipedia , lookup

Theoretical computer science wikipedia , lookup

Transcript
Discrete
Mathematics I
离散数学 I(全英)
暨南大学
信息科学技术学院
计算机科学系
黄 战 副教授
Discrete Mathematics provides an introduction
to logic and proof techniques, basics of set theory,
elementary number theory and cryptography,
combinatorial enumeration, discrete probability,
and graph theory, with a view towards applications.
It is designed for majors in mathematics, computer
science, statistics, and other related science and
engineering disciplines.
The purpose of this course is to understand
and use discrete structures that are
backbones of computer science. In particular,
this class is meant to introduce logic, proofs,
sets, relations, functions, counting, and
probability, with an emphasis on applications
in computer science.
Discrete Mathematics and its Applications, 7th
Edition,Kenneth H.Rosen, McGraw-Hill Higher Education
Website:
http://www.mhhe.com/math/advmath/rosen/r7/
Your final grade in the course will be determined as follows:
Type
Weight
Attendance, Assignments
40%
Final Test
60%
There will be weekly homework assignments.
The assignments are due at the beginning of
the class on the day specified on the
assignment. In general, no extensions will be
granted.
What is Discrete Mathematics?
The study of discrete, mathematical objects and structures.
“Discrete”--Composed of distinct, separable parts. (Opposite of continuous.)
“Structures”--objects built up from simpler objects according to a definite pattern.
Discrete Structures We’ll Study
Propositions
Proofs
Predicates
Summations
Sets
Permutations
(Discrete)
Functions
Combinations
Orders of
Growth
Relations
Algorithms
Integers
Graphs
Trees
Why Study Discrete Math?
The basis of all of digital information processing: Discrete
manipulations of discrete structures represented in
memory.
It’s the basic language and conceptual foundation of all
of computer science.
Discrete concepts are also widely used throughout math,
science, engineering, economics, biology, etc., …
A generally useful tool for rational thought!
Uses for Discrete Math in Computer Science
Algorithms & data structures
Database management systems
Programming language compilers &
interpreters.
Computer security
Computer networks
Error correction codes
Operating systems
Graphics & animation algorithms,
game engines
Computer architecture
Just about everything!
http://www.mhhe.com/math/advmath/rosen/r7/
Take advantages of the
web resources
Do exercises
Read in advance
Take note
http://cs.jnu.edu.cn//international/dmathschedule.html