 期中测验时间:  10 月 31 日上午 9 : 40—11 : 30  第一到第四章  即,集合,关系,函数,组合数学.

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

CSE 211- Discrete Structures1 Relations Ch 2 schaums, Ch 7 Rosen.
CSCI 115 Chapter 6 Order Relations and Structures.
Relations Relations on a Set. Properties of Relations.
Practice Quiz 3 Recursive Definitions Relations Basic Counting Pigeonhole Principle Permutations & Combinations Discrete Probability.
3.3 The Characteristic function of the set  function from universal set to {0,1}  Definition 3.6: Let U be the universal set, and let A  U. The characteristic.
Chapter 7 Relations : the second time around
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.
Relations. Binary Relations a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). Note the di ff erence between.
Relations binary relations xRy on sets x  X y  Y R  X  Y Example: “less than” relation from A={0,1,2} to B={1,2,3} use traditional notation 0 < 1,
Theory and Applications
Lecture 19 Exam: Tuesday June15 4-6pm Overview. General Remarks Expect more questions than before that test your knowledge of the material. (rather then.
Partial Orderings: Selected Exercises
Chapter 2 Sets, Relations, and Functions SET OPERATIONS The union of A and B.
Applied Discrete Mathematics Week 10: Equivalence Relations
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
ⅠIntroduction to Set Theory 1. Sets and Subsets
CSE 460: Switching Theory David M. Zar
Exam 2 Review 8.2, 8.5, 8.6, Thm. 1 for 2 roots, Thm. 2 for 1 root Theorem 1: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1.
Exam 2 Review 7.5, 7.6, |A1  A2  A3| =∑|Ai| - ∑|Ai ∩ Aj| + |A1∩ A2 ∩ A3| |A1  A2  A3  A4| =∑|Ai| - ∑|Ai ∩ Aj| + ∑ |Ai∩ Aj ∩ Ak| - |A1∩
CS 490 Mathematical Logic, Combinatorics, Counting Arguments, Graph Theory, Number Theory, Discrete Probability, Recurrence Relation. Thao Tran.
4-3 DEFINITE INTEGRALS MS. BATTAGLIA – AP CALCULUS.
Copyright © Cengage Learning. All rights reserved. Logarithmic, Exponential, and Other Transcendental Functions.
 期中测验时间:  11 月 4 日  课件 集合,关系,函数,基数, 组合数学.  Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
CSCI 115 Chapter 3 Counting. CSCI 115 §3.1 Permutations.
2.6 Equivalence Relation §1.Equivalence relation §Definition 2.18: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric,
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
4.5.2 Applications of Inclusion-Exclusion principle
FUNCTIONS.
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
MTH 065 Elementary Algebra II Chapter 6 – Polynomial Factorizations and Equations Section 6.1 – Introduction to Polynomial Factorizations and Equations.
DISCRETE COMPUTATIONAL STRUCTURES
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
4.6 Generating functions Generating functions
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Homework 9 –Average: 81Median: 88 – –Section 7.3, #9 Note that.
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE By, A.Kousar Nikhath, Asst.Professor, CSE Dpt.
Chap. 7 Relations: The Second Time Around
CSCI 115 Course Review.
 2. Inverse functions  Inverse relation,  Function is a relation  Is the function’s inverse relation a function? No  Example: A={1,2,3},B={a,b}, f:A→B,
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Paper Code : BCA-03 Paper Title : Mathematics Theory.
Review: Discrete Mathematics and Its Applications
Chapter 5 Relations and Operations
Partial Orderings: Selected Exercises
CSE 2813 Discrete Structures
Department of Mathematics
Unit-III Algebraic Structures
Partial Orders.
Partial Orderings CSE 2813 Discrete Structures.
Equivalence Relations
Partial Orderings.
Chapter 6 Section 3.
Logarithmic Functions and Their Graphs
9. Counting and Probability 1 Summary
Discrete Math (2) Haiming Chen Associate Professor, PhD
Review: Discrete Mathematics and Its Applications
§2.5. Continuity In this section, we use limits to
CSE 321 Discrete Structures
4.7 Recurrence Relations P13, P100
ⅠIntroduction to Set Theory 1. Sets and Subsets
Background material.
Background material.
Algorithms CSCI 235, Spring 2019 Lecture 8 Recurrences III
Presentation transcript:

 期中测验时间:  10 月 31 日上午 9 : 40—11 : 30  第一到第四章  即,集合,关系,函数,组合数学

 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,   P(A)  2. Operations on Sets  Operations and their Properties  A=?B  A  B, and B  A  Or Properties  Theorems, examples, and exercises

 3. Relations and Properties of relations  reflexive,irreflexive  symmetric, asymmetric,antisymmetric  Transitive  Closures of Relations  r(R),s(R),t(R)=?  Theorems, examples, and exercises  4. Operations on Relations  Inverse relation, Composition  Theorems, examples, and exercises

 5. Equivalence Relation and Partial order relations  Equivalence Relation  equivalence class  Partial order relations and Hasse Diagrams  Extremal elements of partially ordered sets:  maximal element, minimal element  greatest element, least element  upper bound, lower bound  least upper bound, greatest lower bound  Theorems, examples, and exercises

 6.Functions  one to one, onto, one-to-one correspondence  Composite functions and Inverse functions  Cardinality,  0.  Theorems, examples, and exercises

 II Combinatorics  1. Pigeonhole principle  Pigeon and pigeonholes  example , exercise

 2. Permutations and Combinations  Permutations of sets, Combinations of sets  circular permutation  Permutations and Combinations of multisets  Formulae  inclusion-exclusion principle  generating functions  integral solutions of the equation

 Applications of Inclusion-Exclusion principle  example,exercise  Applications generating functions and Exponential generating functions  e x =1+x+x 2 /2!+…+x n /n!+…;  x+x 2 /2!+…+x n /n!+…=e x -1;  e -x =1-x+x 2 /2!+…+(-1) n x n /n!+…;  1+x 2 /2!+…+x 2n /(2n)!+…=(e x +e -x )/2;  x+x 3 /3!+…+x 2n+1 /(2n+1)!+…=(e x -e -x )/2;  examples, and exercises  3. recurrence relation  Using Characteristic roots to solve recurrence relations  Using Generating functions to solve recurrence relations  examples, and exercises

 Graph theory  P115,4.2;P ;P