Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)

Slides:



Advertisements
Similar presentations
Project Lead the Way An Orientation American High School.
Advertisements

Based on Rosen, Discrete Mathematics & Its Applications, 5e (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #0 - Overview.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Department of Mathematics and Computer Science
1 i206: Distributed Computing Applications & Infrastructure 2012
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
Discrete Maths Objective to give some background on the course , Semester 2, Who I am: Andrew Davison WiG Lab
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Th. 9/3/2009.
CSCI 3 Introduction to Computer Science. CSCI 3 Course Description: –An overview of the fundamentals of computer science. Topics covered include number.
UMass Lowell Computer Science Foundations of Computer Science Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Th. 9/3/2009.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2005 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 9/7/05.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2007 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/24/07.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Lecture 1 Introduction/Overview Wed. 1/31/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Lecture 1 Introduction/Overview Wed. 9/6/00.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
Masters in Information Science and Technology (IST) Thesis and Non-Thesis Option (30 Credits)
Computer Science Education in Japan Bush, M. E. (2004). Computer science education in Japan. CACM, 47(8),
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Introduction to Computer and Programming CS-101 Lecture 6 By : Lecturer : Omer Salih Dawood Department of Computer Science College of Arts and Science.
1 Discrete Structures ICS-252 Dr. Ahmed Youssef 1.
CSNB143 – Discrete Structure
Nama : Jehan binti Jamian No.matrik : UK Discrete Mathematics Area of mathematics that deals with the study of discrete objects. Discusses languages.
机器学习 陈昱 北京大学计算机科学技术研究所 信息安全工程研究中心. Concept Learning Reference : Ch2 in Mitchell’s book 1. Concepts: Inductive learning hypothesis General-to-specific.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Structure of Study Programmes
CS 160 Introduction to Computer Science Andrew Scholer
Mathematics in Computer Science at Loras College Steve Mosiman.
Structure of Study Programmes Bachelor of Computer Science Bachelor of Information Technology Master of Computer Science Master of Information Technology.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
University of Colorado Denver Department of Mathematical and Statistical Sciences Graduate program in Applied Mathematics Applications Continuous models:
Computer Science Department 1 Undergraduate Degree Program Computer Science Chair Dr. Kurt Maly.
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Discrete Mathematics 이재원 School of Information Technology
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Discrete Structures for Computing
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
The development of common partnership and interuniversitary scientific research according to the principle of sustainable development TRAINING COURSE Romania,
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
Master’s Degree in Computer Science. Why? Acquire Credentials Learn Skills –Existing software: Unix, languages,... –General software development techniques.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
New Curricula Proposal at FSMN by Miroslav Ćirić & Predrag Krtolica.
Discrete mathematics Kwon, Tae-kyoung
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
CIT 592 Discrete Math Lecture 1. By way of introduction … Arvind Bhusnurmath There are no bonus points for pronouncing my last name correctly Please call.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Year 10 Subject Selection – Information Technology
Computer Mathematics CUIT102 Donna Musiyandaka
Syllabus Introduction to Computer Science
Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04
Computer Science Courses
WELCOME TO DIGITAL & computer SCIENCE
Discrete Mathematics and Its Applications
Discrete Mathematics and its Applications
CS 160 Introduction to Computer Science
What is Mathematics, really?
Discrete Mathematics and its Applications
Discrete Mathematics in the Real World
Design and Analysis of Algorithms
Discrete Mathematics and Its Applications
Computer Science Courses in the Major
Presentation 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:

TypeWeight Attendance, Assignments40% Final Test60% Your final grade in the course will be determined as follows:

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 IntegersAlgorithms Orders of Growth (Discrete) Functions SetsPredicatesPropositions TreesGraphsRelationsCombinationsPermutationsSummationsProofs

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 Database management systems Computer security Error correction codes Graphics & animation algorithms, game engines Just about everything! Algorithms & data structures Programming language compilers & interpreters. Computer networks Operating systems Computer architecture

Take noteRead in advanceDo exercises Take advantages of the web resources schedule.html