MAT 2720 Discrete Mathematics Spring 2012. Dr. Wai W. Lau Dr. Lau Wai.

Slides:



Advertisements
Similar presentations
MAT 3751 Analysis II Winter 2014
Advertisements

Course Outline. Lecture 1 Learning Objectives  To use set notations  To apply operations (union, intersection) on sets  To define de Morgan’s Laws.
MAT 3749 Introduction to Analysis Fall 2013
Department of Mathematical Sciences The University of Texas at El Paso 1 Program Assessment Presentation May 15, 2009 Joe Guthrie Helmut Knaust.
5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
CS 262: Programming Languages Spring Quarter 2011.
Lecture 19 Exam: Tuesday June14 4-6pm Overview. Disclaimer The following is a only study guide. You need to know all the material treated in class.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Lecture 19 Exam: Tuesday June15 4-6pm Overview. General Remarks Expect more questions than before that test your knowledge of the material. (rather then.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
Principles of Evolution Biology 3330 – Spring 2015 James F. Thompson, Ph.D.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
CS 315 Theory of Programming Languages Winter Quarter 2015.
IS 320: Data Structures Spring Quarter DESCRIPTION This class is an introduction to data structures. The primary data structures—list, stack, queue,
Log into your account Go to Locate MAT 1221 and the First Day PPT.
APMA/CS 202 Discrete Math I Section 01 Spring 2003.
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
Log into your account Go to Locate MAT 2401 and the First Day PPT.
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
4th Hour INSTRUCTOR: Ms. Holden My Classroom Expectations Students will arrive at class ON time. Students will arrive prepared to work (this means you.
MAT 0145 College Readiness Math II Spring 2015
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
CS 103 Discrete Structures Lecture 01 Introduction to the Course
PHY 1401 General College Physics (Gen Phy 1) Spring 2010 North Ridge Campus.
5th Hour INSTRUCTOR: Ms. Holden My Classroom Expectations Students will arrive at class ON time. Students will arrive prepared to work (this means you.
Syllabus and Class Policies MATH 130: Summer 2014.
WEEK-1 PRINCIPLES OF MANAGEMENT BUSN 107, Özge Can.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
MAT 3724 Applied Analysis Fall 2012
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
MAT 4830 Mathematical Modeling Winter 2013
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
ICS 6B Boolean Logic and Algebra Fall 2015
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
If you have a computer/laptop... Go to or Google Wai Lau, and use the first link. Locate MAT 1234.
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Spring 2011 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
MAT 360 – Lecture 0 Introduction. About me  Moira Chas   Work phone :  Office Location:
Econ 3320 Managerial Economics (Fall 2015)
Honors Chemistry Disclosure. Rules: The rules for Miss Paxton’s classroom are the following: Be Prepared – This means be prepared for the day with your.
MAT 1236 Calculus III Spring 2015
MAT 1235 Calculus II Winter 2015
CS 445 Theory of Computation II Winter Quarter 2013.
MAT 3730 Complex Variables Spring 2012
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
Welcome to PreCalculus! Instructor: B. Beck-Smith.
Mgmt 371 Principles Management Course Introduction August 2008.
C Programming Lecture 1 : Introduction Bong-Soo Sohn Associate Professor School of Computer Science and Engineering Chung-Ang University.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
CST 223 Concepts of Programming Languages Dr. Sherry Yang PV 171
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
Data Structures and Algorithms in Java AlaaEddin 2012.
COP4020 INTRODUCTION FALL COURSE DESCRIPTION Programming Languages introduces the fundamentals of the design and implementation of programming languages.
Math 115a Section 2(Summer 05)  Instructor: Kerima Ratnayaka   Phone :  Office.
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
PHY 1041 STRUCTURAL DESIGN SPRING 2016 NARRATED Goals and Administrative Stuff and Overview 1CET 2120.
Syllabus and Class Policies MATH 130: Summer 2016.
Review: Discrete Mathematics and Its Applications
MAT 1236 Calculus III Spring
CSE 321 Review Session Dave Bacon.
Database Design and Implementation
CS 201 – Data Structures and Discrete Mathematics I
Welcome to CS 1010! Algorithmic Problem Solving.
CS 201 – Data Structures and Discrete Mathematics I
26 July 2011 SC 611 Class 1.
If you have a computer/laptop...
Presentation transcript:

MAT 2720 Discrete Mathematics Spring 2012

Dr. Wai W. Lau Dr. Lau Wai

Dr. Wai W. Lau Dr. Lau Wai =

Dr. Wai W. Lau Dr. Lau Wai = =

Dr. Wai W. Lau Dr. Lau Wai = = It is the “wai” in “Hawaii” and “Waikiki”

Course Web Page Link to this document and other course information

Office Hours See course web page By Appointment

Prerequisites MAT 1235 calculus II

What kind of people will pass this class? Have good algebra background Work hard Do their homework as soon as possible

What kind of people will pass this class? Follow Instructions on using Standard Notations Presentation Formats Do not skip steps

Calculators No calculators will be allowed in all exams.

Texts Johnsonbaugh, Discrete Mathematics, 7th ed. (ISBN , $108 at Amazon ) e-book version available at (180 days, $55.99)

Objectives This course is an introduction to the concepts of discrete mathematics. One of the main goals is to extend students' mathematical maturity and ability to deal with abstraction. This course serves as a stepping stone to advanced courses in mathematics and computing sciences.

Objectives The students are expected to cultivate active learning and the ability of communicating mathematical ideas. Use Standard Notations. Use good Presentation Formats.

Objectives This course partially fulfill the Discrete Structure requirements (in Computer Science Body of Knowledge) recommended by ACM/IEEE Computing Curricula 2008.

DS1. Functions, relations, and sets [core] Minimum core coverage time: 6 hours Topics: Functions (surjections, injections, inverses, composition) Relations (reflexivity, symmetry, transitivity, equivalence relations) Sets (Venn diagrams, complements, Cartesian products, power sets) Pigeonhole principle Cardinality and countability

DS2. Basic logic [core] Minimum core coverage time: 10 hours Topics: (Logic System Design) Propositional logic Logical connectives Truth tables Normal forms (conjunctive and disjunctive) Validity Predicate logic Universal and existential quantification Modus ponens and modus tollens Limitations of predicate logic

DS3. Proof techniques [core] Minimum core coverage time: 12 hours Topics: Notions of implication, converse, inverse, contrapositive, negation, and contradiction The structure of formal proofs Direct proofs Proof by counterexample Proof by contraposition Proof by contradiction Mathematical induction Strong induction Recursive mathematical definitions Well orderings

DS4. Basics of counting [core] Minimum core coverage time: 5 hours Topics: Counting arguments – Sum and product rule – Inclusion-exclusion principle – Arithmetic and geometric progressions – Fibonacci numbers The pigeonhole principle Permutations and combinations – Basic definitions – Pascal’s identity – The binomial theorem Solving recurrence relations – Common examples – The Master theorem

DS5. Graphs and trees [core] Minimum core coverage time: 4 hours Topics: Trees Undirected graphs Directed graphs Spanning trees Traversal strategies

DS6. Discrete probability [core] Minimum core coverage time: 6 hours Topics: (Probability Theory) Finite probability space, probability measure, events Conditional probability, independence, Bayes’ theorem Integer random variables, expectation

Exams 2 Mid-term Exams and a Final Exam.

Homework You can choose to do your HW individually or in a team of two

Team Approach You can work with at most one classmate on the HW. Turn in one paper for each team. Team paper need to be typed in MS WORD with proper format.

Team Approach You need to state clearly on the front page the percentage of contributions of each team member. This approach is intended for you to have discussions over the HW. Do not take turn to do HW.

Individual Approach Your homework must be neat and easy to read. Otherwise, no points will be given. Sloppy handwriting will not be tolerated. You will get bonus points at the end of the quarter if most of your papers are typed.

Homework You are not allowed to discuss your HW with anyone (except your team parnter and the instructor). Discussing or copying homework is considered as an act of academic dishonesty. Your only references are the textbook and lecture notes. Do not use other references such as books, WIKI, and other web resources.

Homework You must show all of your work − a correct answer with no justification will also be worth NO credit. When explanations are called for on the homework, you should respond in complete sentences with proper grammar, spelling, and punctuation.

Homework Staple your Homework. Points will be taken off if you fail to do so. Homework is due at the beginning of the class. Absolutely no late homework. Excuses such “the printer is not working” will not be accepted.

Reading Assignment You are required to read the textbook before class everyday. I will ask questions during the class period to check your reading progress.

Class Participation You are expected to come to class. There are classwork in some class sessions.

Class Participation At the end of the quarter, your grades on class participation will be determined by the above activities and other observations by the instructor.

Class Participation Please respect your instructor and classmates. Do not talk during the lecture. Disruptive and disturbing behavior will not be tolerated.

Class Participation No text messaging, web surfing, sending,…… Turn off your phone before you enter the classroom***.

Class Participation Annoying behaviors will reduce the maximum participation points that you can get.

Points Distribution Exam 180 points Exam 280 points Final80 Points Homework40 Points Class Participation20 Points

Final Class Grade 90%A Range 80%B Range 70%C Range 60%D Range Below 60%E

Missing Classes You are responsible to catch up all the materials if you miss classes for whatever reasons ( sickness, family issues, family Hawaii vacation, alien abduction etc).

Missing Classes The instructor will not "re-teach" the lecture in any form including special appointments.

Make-Up Policies If a student has a documented conflict that will prevent him or her from taking an exam at the scheduled time, he/she must arrange IN ADVANCE with the instructor to take the exam early.

Make-Up Policies Makeups are NOT AUTOMATIC. Do NOT assume that because you miss an exam that you will get to make it up. A makeup exam must be APPROVED by me. Lying to avoid taking an exam is considered as an act of academic dishonesty.

Help!! Talk to me. I am available during office hours and other times.

Print Privilege Open Computer Lab 253 Do not use the printer in this lab unless you have permission to do so. M, T, W, Th: 7:30am - 9:30pm F: 7:30am - 6:00pm S: 8:00am - 5:00pm