L2 Supplementary Notes Page 1 04-02-2010: Recap l Sum Principle n Applied to selection sort l Product Principle n Applied to matrix multiplication and.

Slides:



Advertisements
Similar presentations
1.6 Functions. Chapter 1, section 6 Functions notation: f: A B x in A, y in B, f(x) = y. concepts: –domain of f, –codomain of f, –range of f, –f maps.
Advertisements

Functions.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
1 Basic Counting Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CS466 (Prasad)L1Sets1 Introduction Language: Set of Strings.
L1 Supplementary Notes Page 1 Selection Sort Comparison Counting.
L2 Supplementary Notes Page : Recap l General Product Principle n For counting list l Counting Functions n Functions are lists l Function concepts.
Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.
Lecture 3 Set Operations & Set Functions. Recap Set: unordered collection of objects Equal sets have the same elements Subset: elements in A are also.
Summation Notation. Terminology k –index of summation 1- lower limit n-upper limit.
Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.
Functions Goals Introduce the concept of function Introduce injective, surjective, & bijective functions.
C241 PLTL SESSION – 3/1/2015 Functions & Relations.
C241 PLTL SESSION – 2/24/2015 Set Theory & Functions.
Functions. A function between two sets is a relation between those sets that has a special property, namely that each member of the from-set is related.
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
Relations and Functions Another Foundational Concept Copyright © 2014 – Curt Hill.
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
Discrete Maths Objectives to show the connection between relations and functions, and to introduce some functions with useful, special properties ,
Functions. Copyright © Peter Cappello2 Definition Let D and C be nonempty sets. A function f from D to C, for each element d  D, assigns exactly 1 element.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
COMP 170 L2 Page 1 Review for Midterm 1 l Part I: Counting n L01-L03 l Part II: Number Theory and Cryptography n L04, L05.
1 CSC 321: Data Structures Fall 2013 Counting and problem solving  mappings, bijection rule  sequences, product rule, sum rule  generalized product.
Fall 2002CMSC Discrete Structures1 … and the following mathematical appetizer is about… Functions.
MSU/CSE 260 Fall Functions Read Section 1.8.
1 Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets,
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
MAT 3749 Introduction to Analysis Section 1.3 Part I Countable Sets
321 Section, Week 3 Natalie Linnell. Functions A function from A to B is an assignment of exactly one element of B to each element of A. We write f(a)
CSE 2353 – October 1 st 2003 Functions. For Real Numbers F: R->R –f(x) = 7x + 5 –f(x) = sin(x)
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
Permutations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Permutations Reading: Kolman, Section 3.1.
Language: Set of Strings
MAT 2720 Discrete Mathematics Section 3.1 Functions
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
CSC102 - Discrete Structures Functions
Aim: How do we determine whether a function is one - to one, determine domain and range? Do Now: Determine whether the following function is onto (surjective)
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
Linear Transformations
Multiply Matrices Chapter 3.6. Matrix Multiplication Matrix multiplication is defined differently than matrix addition The matrices need not be of the.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
MAT 2720 Discrete Mathematics Section 3.3 Relations
Review Functions. Function A function is a special type of relation in which each element of the domain is paired with exactly one element of the range.
Venn Diagrams.
Algebra 2 Chapter 12 Venn Diagrams, Permutations, and Combinations Lesson 12.2.
Sequences Lecture 11. L62 Sequences Sequences are a way of ordering lists of objects. Java arrays are a type of sequence of finite size. Usually, mathematical.
SF2714 Discrete Mathematics and Algebra 7.5 hp KTH, period 2, Fall 2009 Course coordinator: Jakob Jonsson –
Functions Goals Introduce the concept of function
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Principle of Inclusion and Exclusion
Relations, Functions, and Matrices
CS 2210:0001 Discrete Structures Sets and Functions
Properties of Functions
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
9. Counting and Probability 1 Summary
Permutations and Combinations
Linear Transformations
CS201: Data Structures and Discrete Mathematics I
Discrete Structures for Computer Science
Propositional Logic Defining Propositional Logic
… and the following mathematical appetizer is about…
Functions.
Ch 5 Functions Chapter 5: Functions
Basic Counting Lecture 9: Nov 5, 6.
Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007
MAT 2720 Discrete Mathematics
Linear Transformations
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Presentation transcript:

L2 Supplementary Notes Page : Recap l Sum Principle n Applied to selection sort l Product Principle n Applied to matrix multiplication and the next item l Two element-subsets l Set concepts and notations n Sets, mutually disjoint sets, size, union, partition n Set does not allow duplicates

L2 Supplementary Notes Page Recap: Sum Principle

L2 Supplementary Notes Page Recap: Product Principle l Si and Sj are disjoint, |Si| = n l S = S1 U S2 U … U Sm l |S| = m |Si| = mn

L2 Supplementary Notes Page Today First 3 items on Page 2 of “ More Counting”

L2 Supplementary Notes Page 5 More counting, Page 4 (MC 4)

L2 Supplementary Notes Page 6 Use of Product Principle in Entry Code Example (MC 4)

L2 Supplementary Notes Page 7 MC 5-9

L2 Supplementary Notes Page 8 Suppl 4, MC10, 11

L2 Supplementary Notes Page 9 Discrete Function (MC 11, 12) l S = {1, 2, 3}: domain of function f l T={Sam, Mary, Sarah}: range of function f

L2 Supplementary Notes Page 10 Notes (MC 11) l For each element s of S, f gives one element of T, f(s) l In general NOT: n For each element of T,… n There may be t of T, such that f(s) \= t for all s of S n Only a special kind of function has this property, onto

L2 Supplementary Notes Page 11 MC 14

L2 Supplementary Notes Page 12 Exercise on Functions (MC 15) All functions from {1, 2} ->{a, b}

L2 Supplementary Notes Page 13 Counting Functions (MC 16)

L2 Supplementary Notes Page 14 Counting Functions (MC17)

L2 Supplementary Notes Page 15 Injection (MC 18) f: {1, 2}  {a, b}

L2 Supplementary Notes Page 16 Surjection (MC 18) f: {1, 2}  {a, b}

L2 Supplementary Notes Page 17 Examples (MC 19)

L2 Supplementary Notes Page 18 Bijection (MC 20) l Domain and range have same number of elements.

L2 Supplementary Notes Page 19 Permutation (MC 20)

L2 Supplementary Notes Page 20 Bijection Principle l Counting elements in S l May be difficult directly l Find another set T that is easy to count l Define a function f: S  T l Prove that f is a bijection l Count T

L2 Supplementary Notes Page 21 Three Increasing Triples

L2 Supplementary Notes Page 22 Increasing Triples

L2 Supplementary Notes Page 23 3-element subsets/3-element permutations

L2 Supplementary Notes Page 24 K-th falling factorial

L2 Supplementary Notes Page 25 k-element subsets/k-elemen permutations