Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.

Slides:



Advertisements
Similar presentations
Based on Rosen, Discrete Mathematics & Its Applications, 5e (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #0 - Overview.
Advertisements

Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
UMass Lowell Computer Science Foundations of Computer Science Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Th. 9/3/2009.
CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
Computing Fundamentals 2 Overview Lecturer: Patrick Browne Room [KA] , Lab [KA] Based on Chapter 19. A Logical approach to Discrete Math.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
TR1413: Discrete Math for Computer Science Lecture 0: Introduction.
Overview of the MS Program Jan Prins. The Computer Science MS Objective – prepare students for advanced technical careers in computing or a related field.
Wrap-Up. Goals Introduce fundamental concepts – Binary numbers – Addition/Subtraction – Boolean Algebra Hardware correlation – Logic gates – Logic reduction.
BY MISS FARAH ADIBAH ADNAN IMK
Computer Science Education in Japan Bush, M. E. (2004). Computer science education in Japan. CACM, 47(8),
Programming and Coding short course consultation.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
MTH213 Experimental Mathematics Introduction. Goals of the Course Introduction to high level programming language (Python) and extensive math libraries.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
1 Discrete Structures ICS-252 Dr. Ahmed Youssef 1.
CSNB143 – Discrete Structure
Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)
Nama : Jehan binti Jamian No.matrik : UK Discrete Mathematics Area of mathematics that deals with the study of discrete objects. Discusses languages.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Robotics Daniel Vasicek 2012/04/15.
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Mathematics in Computer Science at Loras College Steve Mosiman.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Day 1: Discrete Intro, 4 cubes class activity, voting project Assigned Classwork: 4 Cubes Activity Homework (day 1): Real World Example (follow directions.
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.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Discrete Structures for Computing
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
Introduction COMP283 – Discrete Structures. JOOHWI LEE Dr. Lee or Mr. Lee ABD Student working with Dr. Styner
CompSci 102 Discrete Math for Computer Science April 17, 2012 Prof. Rodger.
SSK3003 DISCRETE STRUCTURES
Concrete Mathematics 演算法的數學分析 Ming-Jer Tsai. Outline Text Book The Topics in the Class Course Description Evaluation.
Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
Graph Theory Ming-Jer Tsai. Outline Graph Graph Theory Grades Q & A.
CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
Discrete Mathematics Course syllabus. Course No.: Course Classification: Department Compulsory (CS,CIS,SE) Course Name: Discrete Mathematics Time.
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.
5 Lecture in math Predicates Induction Combinatorics.
離散專題 (I) (Topics in Discrete Mathematics) Hung-Lin Fu ( 傅恆霖 ) Department of Applied Mathematics National Chiao Tung University Hsin Chu, Taiwan
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
BMTS Computer Programming Pre-requisites :BMTS 242 –Computer and Systems Nature Of the Course: Programming course, contain such as C, C++, Database.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
COMP 283 Discrete Structures
Welcome to CMSC 203 – Discrete Structures Spring 2003
Course Software Testing & Verification 2016/17 Wishnu Prasetya
Discrete Math (2) Haiming Chen Associate Professor, PhD
Foundations of Visualization 8/30/05 Lecture Notes
Discrete Mathematics and Its Applications
Grade 7 Math Mrs. Swoyer- Room 120
Discrete Math (2) Haiming Chen Associate Professor, PhD
CS 281: Discrete Mathematics for Computer Science
The Course in a Nutshell
Discrete Mathematics Lecture 1: Introduction
Discrete Mathematics Lecture 1: Introduction
離散專題(I) (Topics in Discrete Mathematics)
k-sample problems, k>2
Presentation transcript:

Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai

Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How to grade?

What is Discrete Mathematics? Discrete Math. VS Continuous Math.  The objects studied in Continuous Math. – such as real numbers – vary smoothly. Topics includes calculus, etc.  The objects studied in Discrete Math. – such as integers, graphs, and statements in logic – do not vary smoothly. Topics includes probability, set theory, etc.

Why Learn Discrete Mathematics? Research in discrete mathematics increased due to the development of digital computers which operate in discrete steps and store data in discrete bits. [From Wikipedia] Concepts from discrete mathematics are useful in studying problems in branches of computer science, such as computer algorithms, programming languages, cryptography, automated theorem proving, and software development. [From Wikipedia]

What will be taught in the class? Selected topics in the following chapters:  Chap. 2 Fundamentals of Logic  Chap. 5 Relations and Functions  Chap. 7 Relations: The Second Time  Chap. 9 Generating Functions  Chap. 10 Recurrence Relations  Chap. 11 Introduction to Graph Theory  Chap. 12 Trees  Chap. 13 Optimization and Matching  Chap. 16 Groups

Grades Attendance and Discussion (10%) 12 Quizzes (3/4, 3/11, 3/18, 3/25, 4/1, 4/29, 5/6, 5/13, 5/20, 5/27, 6/3, 6/10) (30%) Mid term (4/15) (30%) Final Exam (6/17) (30%)

Q & A