CISC 1400 Discrete Structures
|
|
- Vincent Greer
- 5 years ago
- Views:
Transcription
1 CISC 1400 Discrete Structures Chapter 4 Relations CISC1400 Yanjun Li 1 1 Relation A relation is a connection between objects in one set and objects in another set (possibly the same set). age is a relation defined between two sets: 1 st set: the set of names of students in your class. 2 nd set: the set of natural numbers. CISC1400 Yanjun Li 2 1
2 Describe a Relation in English Three things: 1 st set: domain of the relation 2 nd set: codomain of the relation Connection or rule is that links the objects in the domain and objects in the codomain. Example Domain: The set of names of people in your family. Codomain: {Red, Black, Brown, Blonde} Rule: (x,y) is in the relation if x s hair is y CISC1400 Yanjun Li 3 Describe a Relation in English What elements (objects) are in the following relation? Domain: The Natural Numbers, N Codomain: The Natural Numbers, N Rule: (x,y) is in the relation if x is one more than y (x = y+1) (1,0) (2,1) (3,2) CISC1400 Yanjun Li 4 2
3 Using Graph to Visualize Relation A cloud where everything falls within nodes (solid small circle): objects or elements (people, numbers, ) Arcs: connecting two elements that are related Arrows: the direction of the relation x -> y is related to 2, 2 is related to 3. 3 is related to CISC1400 Yanjun Li 5 5 Cartesian Product (Cross Product) A B Create a new set consisting of all possible ordered pairs where the first element is from A, and second element is from B. A B {( x, y) : x A and y B} CISC1400 Yanjun Li 6 3
4 Cartesian Product Example Set A = {sky, water, ground} Set B = {blue, gray, brown} A x B = {(sky, blue), (sky, gray), (sky, brown), (water, blue), (water, gray), (water, brown), (ground, blue), (ground, gray), (ground, brown)} CISC1400 Yanjun Li 7 Describe a Relation as a Subset of the Cartesian Product of Two Sets The Cartesian product is the relation that contains all possible connections between objects of its domain and codomain. Some relation is just a subset of the Cartesian product of two sets. Winter = {(sky, gray), (water, blue), (ground, brown)} Winter (A X B) Any relation r between A and B has to be a subset r (A X B) CISC1400 Yanjun Li 8 4
5 Exercise List elements in the relation r defined as follows: Domain: The Natural Numbers, N Codomain: The Natural Numbers, N Rule: r = {(x,y) NxN: x+y is odd} Adding two odd numbers? Adding two even numbers? Adding a number to itself? Adding an even number and an odd number? CISC1400 Yanjun Li 9 Reflexive A relation is reflexive if it contains ordered pairs that have the same element in both positions, e.g., (x,x) for all objects x. Or If r is a relation with domain and codomain A, then we say r (A x A) is reflexive if and only if: (x A) ((x,x) r) Or A relation is reflexive if every object in the domain is related to itself. CISC1400 Yanjun Li 10 5
6 Graphically Describe Reflexive If R is reflexive, there is a loop on each node in its graph A relation is not reflexive if there is some object in the domain that is not related to itself R CISC1400 Yanjun Li 11 Reflexive Example If set A consists of all people, and the relation is Is the same age as Let s pick several persons and see what happens Tom is the same age as Tom Carol is the same age as Carol Sally is the same age as Sally It always work, i.e., for any person, he/she is the same age as himself/herself. Thus is the same age as is reflexive CISC1400 Yanjun Li
7 Try this mathematical one Domain and codomain are N R={(x, y) N x N: (x + y) is even} Is R reflexive? Is any number in N related to itself under R? Try a few numbers, 1, 2, 3, For any numbers in N? Yes, since a number added to itself is always even (since 2 will be a factor), so R is reflexive. CISC1400 Yanjun Li Irreflexive vs. Non-reflexive If a relation has absolutely no (x,x) elements, we say that relation is irreflexive. An irreflexive relation s graph has no self-loop If a relation does not have (x,x) element for every x (even though there may be some x for which it is present), we say that relation is non-reflexive. CISC1400 Yanjun Li 14 7
8 Exercise Domain and codomain are N R={(x, y) N x N: x is larger than y} Is R reflexive? Is any number in N related to itself under R? Try a few numbers, 1, 2, 3, For any numbers in N? No, since a number is not larger than itself, we say it is not related to itself. Actually, no natural number is larger than itself, i.e., NOT related to itself Irreflexive relation CISC1400 Yanjun Li 15 For all relations No object is related to itself Irreflexive Some object is related to itself, some object is not related to itself Not reflexive, not irreflexive Every object is related to itself Reflexive All relations A relation cannot be both reflexive and irreflexive. CISC1400 Yanjun Li
9 Exercises: reflexive? irreflexive? Each of following relations is defined on set {1,2,3,4,5,6}, R : smaller or equal to R d : divides evenly : e.g., 2 divides 6 evenly, but 4 doesn t divides 6 evenly. R a : adds up to 6, e.g., (3,3), (1,5) R={(1,2),(3,4), (1,1)} CISC1400 Yanjun Li Symmetric A relation is symmetric if when it contains any ordered pair (x,y), it also contains the same pair in the other order (y,x) where x y. Or If r is a relation with domain and codomain A, then we say r (A x A) is symmetric if and only if for x y: ((x,y) r) ((y,x) r) Or In the graphs of symmetric relations, arcs go both ways (with two arrows) CISC1400 Yanjun Li 18 9
10 Symmetric Example has the same hair color as relation among a set of people Pick any two people, say A and B If A has the same color hair as B, then of course B has the same color hair as A Thus it is symmetric is a friend of, is the same age of, goes to same college as CISC1400 Yanjun Li 19 Is the following Relation Symmetric? Domain: {1, 2, 3,4} Relation={(1, 2), (1, 3), (4, 4), (4, 5), (3, 1), (5,4), (2, 1)} Yes, it is symmetric since (1,2) and (2,1) (1,3) and (3,1) (4,5) and (5,4) CISC1400 Yanjun Li
11 Antisymmetric vs. Non-symmetric A relation never has (y,x) when it has (x,y), we say that relation is antisymmetric. In the graph, anti-symmetric relations do not have two-way arcs. When a relation does not have (y,x) for all (x,y) (even though there may be some (x,y) for which it is present), we say that relation is non-symmetric CISC1400 Yanjun Li 21 Exercise is older than relation among a set of people If Sally is older than Tom, then Tom is older than Sally must be false We found a case where (Sally, Tom) is in the relation, but (Tom, Sally) is not in the relation Therefore, this relation is not symmetric. Actually, for is older than relation, it never works both way It is an Anti-symmetric relation. CISC1400 Yanjun Li 22 11
12 Bizarre Middle Ground Some relations are symmetric Some relations are anti-symmetric Some relations are non-symmetric, i.e., Some ordered pairs can be reversed Some ordered pairs cannot be reversed Anti-symmetric Non-symmetric All relations Symmetric CISC1400 Yanjun Li Non-symmetric Example knows the birthday of defined among a set of people Some pair of people know each other s birthday, Tom know the birthday of Sally Sally know the birthday of Tom So we now know that it is not anti-symmetric. Some people know the birthday of the other, but not vice versa Tom knows the birthday of Bill Bill doesn t know the birthday of Tom So the relation is not symmetric. Therefore this relation is neither symmetric nor anti-symmetric, it is non-symmetric. CISC1400 Yanjun Li
13 Exercises: Symmetric? Anti-symmetric? For each of following relations defined on set {1,2,3,4,5,6} R={(1,2),(3,4), (1,1),(2,1),(4,3)} R={(1,2),(3,4),(1,1)} R={(1,2),(3,4),(1,1),(4,3)} R : smaller or equal to R d : divides evenly : e.g., 2 divides 6 evenly R a : adds up to 6, e.g., (3,3), (1,5) CISC1400 Yanjun Li Properties of Relation Reflexive is about single objects of A. Symmetric is about pairs of objects of A. Transitive is about three pairs of objects of A. CISC1400 Yanjun Li 26 13
14 a c Transitive b A relation is transitive if it contains ordered pairs that allow shortcuts if (a,b) and (b,c) are both in the relation, then (a,c) must also be in the relation. Or If r is a relation with domain and codomain A, then we say r (A x A) is transitive if and only if : ((x,y) r and (y,z) r ) ((x,z) r) CISC1400 Yanjun Li 27 Transitive Example is older than relation among the set of people Alice is older than bob. i.e., (Alice, Bob) Bob is older than Cathy. i.e., (Bob, Cathy) Is Alice older than Cathy? Yes! Alice for sure is older than Cathy. We know that for any three people, A, B and C, if A is older than B, B is older than C, then fore sure, A is older than C. This relation is a transitive relation. CISC1400 Yanjun Li 28 14
15 Not Transitive A relation R is not transitive if there exists three elements in the domain, a, b, and c, and a is related to b - (a,b), b is related to c (b,c), but a is not related to c. The definition of transitive can only be tested for if there is a (b,c). Strangely enough, if there are no (b,c) cases ever in the relation we are testing, then the relation is also considered transitive. Not transitive Transitive All relations CISC1400 Yanjun Li 29 Is this relation transitive? is taking the same class as relation on a set of students Suppose three students, Bob, Katie, and Alex, Bob is taking the same class as Katie Katie is taking the same class as Alex And now consider: Is Bob is taking the same class as Alex? Many cases: no Katie takes 1100 with Bob, and takes history with Alex, where Bob and Alex has no classes in common. Therefore this relation is not transitive CISC1400 Yanjun Li
16 Exercises: Transitive or not? R : smaller or equal to defined on set {1,2,3,4} For three numbers a, b, c from {1,2,3,4} Would knowing that a b, and b c, allows me to conclude that a c? Yes! It s transitive! Let s check it s graph CISC1400 Yanjun Li Exercises: Transitive or not? Are the following relations defined on set {1,2,3,4,5,6} transitive? R={(1,2),(3,4), (1,1),(2,1),(4,3)} R={(1,2),(3,4),(1,1)} R={(1,2),(2,4),(1,1),(4,3)} R : smaller or equal to R d : divides evenly : e.g., 2 divides 6 evenly R a : adds up to 6, e.g., (3,3), (1,5) CISC1400 Yanjun Li
17 What properties does it have? Domain: (1, 2, 3, 4, 5) Codomain: (1, 2, 3, 4, 5) Relation={(1, 1), (1, 2), (1, 3), (2, 3), (2, 4), (3, 4), (5,5)} The Answer is: It is not reflexive, and it is not irrefleixve It is not symmetric, and it is antisymmetric It is not transitive CISC1400 Yanjun Li What properties does it have? Domain: (1, 2, 3, 4, 5) Codomain: (1, 2, 3, 4, 5) Relation={(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)} The Answer is: It is reflexive It is anti-symmetric It is transitive CISC1400 Yanjun Li
18 Exercise For the following relations defined on A={1,2,3,4,5,6,7,8} R={(1,1),(1,2),(1,4),(1,8),(2,2),(2,4),( 2,8),(3,3),(3,6),(4,4),(4,8),(5,5),(6,6),( 7,7),(8,8)} CISC1400 Yanjun Li Try a few out Consider all positive numbers. Identify properties for the following relations R1: Is less than or equal to R2: Is 10 less than CISC1400 Yanjun Li
19 Try a few out Consider following relations defined on the set of all people. Identify their properties: R 1 : Is smarter than R 2 : Went to the same high school as R 3 : Is a cousin of CISC1400 Yanjun Li
Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say
Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it
More information1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).
Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,
More informationCS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation
CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation
More informationTaibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.
More information1. Relations 2. Equivalence relations 3. Modular arithmetics. ! Think of relations as directed graphs! xry means there in an edge x!
2 Today s Topics: CSE 20: Discrete Mathematics for Computer Science Prof. Miles Jones 1. Relations 2. 3. Modular arithmetics 3 4 Relations are graphs! Think of relations as directed graphs! xry means there
More information10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings
Sometimes, relations define an order on the elements in a set. Definition: A relation R on a set S is called a partial ordering or partial order if it is reflexive, antisymmetric, and transitive. A set
More informationMath 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS
2-1Numeration Systems Hindu-Arabic Numeration System Tally Numeration System Egyptian Numeration System Babylonian Numeration System Mayan Numeration System Roman Numeration System Other Number Base Systems
More informationSolution : a) C(18, 1)C(325, 1) = 5850 b) C(18, 1) + C(325, 1) = 343
DISCRETE MATHEMATICS HOMEWORK 5 SOL Undergraduate Course College of Computer Science Zhejiang University Fall-Winter 2014 HOMEWORK 5 P344 1. There are 18 mathematics majors and 325 computer science majors
More information(l) Represent each of the sets A, B and C using bit strings. Then, use bit string representation and bitwise logical operations to find
Fall 2004 Ahmed Elgammal CS 205: Sample Final Exam December 6th, 2004 1. [10 points] Let A = {1, 3, 5, 7, 9}, B = {4, 5, 6, 7, 8}, C = {2, 4, 6, 8, 10}, D = {1, 2, 3} and let the universal set be U = {1,
More informationIntroduction to Boolean logic and Logical Gates
Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction
More informationECS 20 Lecture 9 Fall Oct 2013 Phil Rogaway
ECS 20 Lecture 9 Fall 2013 24 Oct 2013 Phil Rogaway Today: o Sets of strings (languages) o Regular expressions Distinguished Lecture after class : Some Hash-Based Data Structures and Algorithms Everyone
More informationLattice Tutorial Version 1.0
Lattice Tutorial Version 1.0 Nenad Jovanovic Secure Systems Lab www.seclab.tuwien.ac.at enji@infosys.tuwien.ac.at November 3, 2005 1 Introduction This tutorial gives an introduction to a number of concepts
More informationAn Interesting Way to Combine Numbers
An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis October 12, 2016 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly
More informationRelations I. Margaret M. Fleck. 7 November 2008
Relations I Margaret M. Fleck 7 November 2008 This lecture covers relations and basic properties of relations, which is most of section 8.1 of Rosen. 1 Announcements Model solutions for the second midterm
More informationCS 341 Homework 1 Basic Techniques
CS 341 Homework 1 Basic Techniques 1. What are these sets? Write them using braces, commas, numerals, (for infinite sets), and only. (a) ({1, 3, 5} {3, 1}) {3, 5, 7} (b) {{3}, {3, 5}, {{5, 7}, {7, 9}}}
More informationRelation between 3 Utility Problem And Eulerian Trail
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 2, Ver. X (Mar-Apr. 2014), PP 13-22 Relation between 3 Utility Problem And Eulerian Trail Yashasvini
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More information1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying.
May 9, 2003 Show all work Name There are 260 points available on this test 1 (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying where
More informationCircuit analysis summary
Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert
More informationModular Arithmetic. Marizza Bailey. December 14, 2015
Modular Arithmetic Marizza Bailey December 14, 2015 Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find a quicker
More informationCounting: Basics. A simple counting problem. Counting: the product rule. Relation to Cartesian products. Relation to Cartesian products
A simple counting problem Counting: Basics Possible answers: 6 x 10 6 + 10 Rosen, Chapter 6.1 Counting: the product rule If there are n1 ways of doing one task, and for each of those there are n2 ways
More informationGrade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 The Seven Bridges of Königsberg In
More informationfollowing determine whether it is an element, subset or neither of A and
1. Let A, B, and C be subsets of the universal set U. Draw Venn diagrams illustrating the following: First, we have a square representing the universe U and three circles, one for each of A, B and C. Each
More informationProperties of a Function s Graph
Section 3.2 Properties of a Function s Graph Objective 1: Determining the Intercepts of a Function An intercept of a function is a point on the graph of a function where the graph either crosses or touches
More informationSETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.
SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationCounting: Basics. Rosen, Chapter 6.1
Counting: Basics Rosen, Chapter 6.1 A simple counting problem n You have 6 pairs of pants and 10 shirts. How many different outfits does this give? n Possible answers: A) 6 x 10 B) 6 + 10 Counting: the
More informationComplexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
More informationWhat Is A Relation? Example. is a relation from A to B.
3.3 Relations What Is A Relation? Let A and B be nonempty sets. A relation R from A to B is a subset of the Cartesian product A B. If R A B and if (a, b) R, we say that a is related to b by R and we write
More informationA set with only one member is called a SINGLETON. A set with no members is called the EMPTY SET or 2 N
Mathematical Preliminaries Read pages 529-540 1. Set Theory 1.1 What is a set? A set is a collection of entities of any kind. It can be finite or infinite. A = {a, b, c} N = {1, 2, 3, } An entity is an
More informationMaking ecards Can Be Fun!
Making ecards Can Be Fun! A Macromedia Flash Tutorial By Mike Travis For ETEC 664 University of Hawaii Graduate Program in Educational Technology April 4, 2005 The Goal The goal of this project is to create
More informationOutline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set
Outline CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets rthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright rthur G. Werschulz, 2017.
More informationCS228 - Basic Counting and the Pigeonhole Principle
CS228 - Basic Counting and the Pigeonhole Principle Nathan Sprague February 19, 2014 Material in these slides is from Discrete Mathematics and Its Applications 7e, Kenneth Rosen, 2012. The Product Rule
More informationPower Set of a set and Relations
Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}
More informationReview Exercise. 1. Determine vector and parametric equations of the plane that contains the
Review Exercise 1. Determine vector and parametric equations of the plane that contains the points A11, 2, 12, B12, 1, 12, and C13, 1, 42. 2. In question 1, there are a variety of different answers possible,
More informationQUADRATIC FUNCTIONS: MINIMUM/MAXIMUM POINTS, USE OF SYMMETRY. 7.1 Minimum/Maximum, Recall: Completing the square
CHAPTER 7 QUADRATIC FUNCTIONS: MINIMUM/MAXIMUM POINTS, USE OF SYMMETRY 7.1 Minimum/Maximum, Recall: Completing the square The completing the square method uses the formula x + y) = x + xy + y and forces
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More information9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More informationTaxicab Geometry. 1. Taxicab Routes. Suppose you live in Taxicab City where all the streets run straight north and south or straight east and west.
1 Taxicab Geometry 1. Taxicab Routes Suppose you live in Taxicab City where all the streets run straight north and south or straight east and west. One night the 911 dispatcher for Taxicab City receives
More informationSituation 3. Parentheses vs. Brackets. Colleen Foy
Situation 3 Parentheses vs. Brackets Colleen Foy Prompt: Students were finding the domain and range of various functions. Most of the students were comfortable with the set builder notation, but when asked
More information2/18/14. Uses for Discrete Math in Computer Science. What is discrete? Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.
Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.3) TOPICS Discrete math Set Definition Set Operations Tuples Digital computers are based on discrete units of data (bits). Therefore,
More informationChapter 7: Linear Functions and Inequalities
Chapter 7: Linear Functions and Inequalities Index: A: Absolute Value U4L9 B: Step Functions U4L9 C: The Truth About Graphs U4L10 D: Graphs of Linear Inequalities U4L11 E: More Graphs of Linear Inequalities
More informationMultivariate Data & Tables and Graphs. Agenda. Data and its characteristics Tables and graphs Design principles
Topic Notes Multivariate Data & Tables and Graphs CS 7450 - Information Visualization Aug. 27, 2012 John Stasko Agenda Data and its characteristics Tables and graphs Design principles Fall 2012 CS 7450
More informationFunctional Dependencies and Finding a Minimal Cover
Functional Dependencies and Finding a Minimal Cover Robert Soulé 1 Normalization An anomaly occurs in a database when you can update, insert, or delete data, and get undesired side-effects. These side
More information6. Find the equation of the plane that passes through the point (-1,2,1) and contains the line x = y = z.
Week 1 Worksheet Sections from Thomas 13 th edition: 12.4, 12.5, 12.6, 13.1 1. A plane is a set of points that satisfies an equation of the form c 1 x + c 2 y + c 3 z = c 4. (a) Find any three distinct
More informationSection 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014
4. Determine the nature of the critical points of Section 4. selected answers Math 11 Multivariate Calculus D Joyce, Spring 014 Exercises from section 4.: 6, 1 16.. Determine the nature of the critical
More informationSUMMER REVIEW FOR STUDENTS COMPLETING GEOMETRY show your work. WEEK 1
Name: 1. Given: 2x 2 3x = 8 SUMMER REVIEW FOR STUDENTS COMPLETING GEOMETRY show your work. WEEK 1 a. Write in standard form. ax 2 +bx+c=0 2. Write an equation for a line parallel to y = -3x + 2 that passes
More informationMultivariate Data & Tables and Graphs. Agenda. Data and its characteristics Tables and graphs Design principles
Multivariate Data & Tables and Graphs CS 7450 - Information Visualization Aug. 24, 2015 John Stasko Agenda Data and its characteristics Tables and graphs Design principles Fall 2015 CS 7450 2 1 Data Data
More informationMath 187 Sample Test II Questions
Math 187 Sample Test II Questions Dr. Holmes October 2, 2008 These are sample questions of kinds which might appear on Test II. There is no guarantee that all questions on the test will look like these!
More informationLogic and Discrete Mathematics. Section 2.5 Equivalence relations and partitions
Logic and Discrete Mathematics Section 2.5 Equivalence relations and partitions Slides version: January 2015 Equivalence relations Let X be a set and R X X a binary relation on X. We call R an equivalence
More informationExpression and Equations
7 CHAPTER Expression and Equations Basic Concepts In algebra, letters are used as variables. A variable can assume values of numbers. Numbers are called constants. Math Note: In some cases, a letter may
More informationMAT 003 Brian Killough s Instructor Notes Saint Leo University
MAT 003 Brian Killough s Instructor Notes Saint Leo University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
More informationMultivariate Data & Tables and Graphs
Multivariate Data & Tables and Graphs CS 4460/7450 - Information Visualization Jan. 13, 2009 John Stasko Agenda Data and its characteristics Tables and graphs Design principles Spring 2009 CS 4460/7450
More informationChapter 15: Functions of Several Variables
Chapter 15: Functions of Several Variables Section 15.1 Elementary Examples a. Notation: Two Variables b. Example c. Notation: Three Variables d. Functions of Several Variables e. Examples from the Sciences
More informationChapter 3: Theory of Modular Arithmetic 1. Chapter 3: Theory of Modular Arithmetic
Chapter 3: Theory of Modular Arithmetic 1 Chapter 3: Theory of Modular Arithmetic SECTION A Introduction to Congruences By the end of this section you will be able to deduce properties of large positive
More informationMATH 22 MORE ABOUT FUNCTIONS. Lecture M: 10/14/2003. Form follows function. Louis Henri Sullivan
MATH 22 Lecture M: 10/14/2003 MORE ABOUT FUNCTIONS Form follows function. Louis Henri Sullivan This frightful word, function, was born under other skies than those I have loved. Le Corbusier D ora innanzi
More informationPAF Chapter Prep Section Mathematics Class 6 Worksheets for Intervention Classes
The City School PAF Chapter Prep Section Mathematics Class 6 Worksheets for Intervention Classes Topic: Percentage Q1. Convert it into fractions and its lowest term: a) 25% b) 75% c) 37% Q2. Convert the
More information1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall
CSE 20 https://goo.gl/forms/1o 1KOd17RMoURxjn2 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Explain the steps in a proof by mathematical and/or structural
More informationLecture 19: Topological sort Part 1: Problem and math basis. Topological sort. The problem. Why we are doing this!
Chair of Software Engineering Einführung in die Programmierung Introduction to Programming Prof. r. Bertrand Meyer October 006 February 007 Lecture 9: Topological sort Part : Problem and math basis Intro.
More informationIs the statement sufficient? If both x and y are odd, is xy odd? 1) xy 2 < 0. Odds & Evens. Positives & Negatives. Answer: Yes, xy is odd
Is the statement sufficient? If both x and y are odd, is xy odd? Is x < 0? 1) xy 2 < 0 Positives & Negatives Answer: Yes, xy is odd Odd numbers can be represented as 2m + 1 or 2n + 1, where m and n are
More informationDSAS Laboratory no 4. Laboratory 4. Logic forms
Laboratory 4 Logic forms 4.1 Laboratory work goals Going from Boolean functions to Boolean forms. Logic forms equivalence. Boolean forms simplification. Shannon s theorems. Representation in NAND and NOR
More informationMath Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Fall 2006 c Heather Ramsey Page 1 Math 166 - Week in Review #5 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that can
More informationAlgebra I Notes Linear Equations and Inequalities in Two Variables Unit 04c
Big Idea: Describe the similarities and differences between equations and inequalities including solutions and graphs. Skill: graph linear equations and find possible solutions to those equations using
More informationCS 3 Midterm 1 Review
CS 3 Midterm 1 Review 1. Quick Evaluations Indicate what each of the following would return if typed into STK. If you think it would error, then please write ERROR. If you think that it would loop forever,
More informationFigure 1: From Left to Right, General Venn Diagrams for One, Two, and Three Sets
2.3. VENN DIAGRAMS & SET OPERATIONS In this section we introduce Venn diagrams and define four basic operations on sets. We also present some important properties related to these operations. Venn Diagrams
More informationMAT 090 Brian Killough s Instructor Notes Strayer University
MAT 090 Brian Killough s Instructor Notes Strayer University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
More informationXVIII. AMC 8 Practice Questions
XVIII. AMC 8 Practice Questions - A circle and two distinct lines are drawn on a sheet of paper. What is the largest possible number of points of intersection of these figures? (A) (B) 3 (C) 4 (D) 5 (E)
More informationFUZZY SETS. Precision vs. Relevancy LOOK OUT! A 1500 Kg mass is approaching your head OUT!!
FUZZY SETS Precision vs. Relevancy A 5 Kg mass is approaching your head at at 45.3 45.3 m/sec. m/s. OUT!! LOOK OUT! 4 Introduction How to simplify very complex systems? Allow some degree of uncertainty
More informationBasic Counting Principles: The Product Rule
Section 6.1 Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1 ways to do the first task and n 2 ways to do the second
More informationCounting. Rosen, Chapter 6 Walls and Mirrors, Chapter 3
Counting Rosen, Chapter 6 Walls and Mirrors, Chapter 3 Spock's dilemma (Walls and mirrors) n planets in the solar system can only visit k
More informationMath 3 Coordinate Geometry part 1 Unit November 3, 2016
Reviewing the basics The number line A number line is a visual representation of all real numbers. Each of the images below are examples of number lines. The top left one includes only positive whole numbers,
More informationObjectives: 1- Bolean Algebra. Eng. Ayman Metwali
Objectives: Chapter 3 : 1- Boolean Algebra Boolean Expressions Boolean Identities Simplification of Boolean Expressions Complements Representing Boolean Functions 2- Logic gates 3- Digital Components 4-
More informationDigraphs and Relations
Digraphs and Relations RAKESH PRUDHVI KASTHURI 07CS1035 Professor: Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur November 6, 2008 November 6, 2008 Section 1 1 Digraphs A graph
More informationMenu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification
Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):
More information2 Second Derivatives. As we have seen, a function f (x, y) of two variables has four different partial derivatives: f xx. f yx. f x y.
2 Second Derivatives As we have seen, a function f (x, y) of two variables has four different partial derivatives: (x, y), (x, y), f yx (x, y), (x, y) It is convenient to gather all four of these into
More informationThis Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
More informationCCNY Math Review Chapters 5 and 6: Trigonometric functions and graphs
Ch 5. Trigonometry 6. Angles 6. Right triangles 6. Trig funs for general angles 5.: Trigonometric functions and graphs 5.5 Inverse functions CCNY Math Review Chapters 5 and 6: Trigonometric functions and
More informationB ABC is mapped into A'B'C'
h. 00 Transformations Sec. 1 Mappings & ongruence Mappings Moving a figure around a plane is called mapping. In the figure below, was moved (mapped) to a new position in the plane and the new triangle
More informationMAT121: SECTION 2.7 ANALYZING GRAPHS AND PIECEWISE FUNCTIONS
MAT121: SECTION 2.7 ANALYZING GRAPHS AND PIECEWISE FUNCTIONS SYMMETRY, EVEN, ODD A graph can be symmetric about the x-axis, y-axis, or the origin (y = x). If a mirror is placed on those lines, the graph
More informationContents of Lecture 2
Contents of Lecture Dominance relation An inefficient and simple algorithm to compute dominance Immediate dominators Dominator tree Jonas Skeppstedt (js@cs.lth.se) Lecture / Definition of Dominance Consider
More informationExtremal results for Berge-hypergraphs
Extremal results for Berge-hypergraphs Dániel Gerbner Cory Palmer Abstract Let G be a graph and H be a hypergraph both on the same vertex set. We say that a hypergraph H is a Berge-G if there is a bijection
More informationOn the number of quasi-kernels in digraphs
On the number of quasi-kernels in digraphs Gregory Gutin Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK gutin@dcs.rhbnc.ac.uk Khee Meng Koh Department of
More informationChoose the best answer. For 1 3, use the figure. For 4 5, use the figure. Which face is parallel to face DEF? BCEF
Choose the best answer. For, use the figure. Page For, use the figure. How many pairs of parallel faces does the figure have? Which face is parallel to face DEF? BCEF ACED ABFD ABC What is the value of
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationConcept: Solving Inequalities Name:
Concept: Solving Inequalities Name: You should have completed Equations Section 7 Part A: Solving Inequalities before beginning this handout. COMPUTER COMPONENT Instructions: In follow the Content Menu
More informationTHEORY OF COMPUTATION
Chapter Eleven THEORY OF COMPUTATION Chapter Summary This chapter introduces the subjects of computability as well as problem classification according to (time) complexity. It begins by presenting the
More informationLecture 6,
Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus
More information13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Automata Theory EUR solutions
13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 011 Automata Theory EUR solutions Problem 1 (5 points). Prove that any surjective map between finite sets of the same cardinality is a
More informationUsing only 1, 2 and 3, and the rules of the 3-number challenge, show how we could use addition only or multiplication only to arrive at 6.
The Numbers Game Exercise 1 The 3-number Challenge Write each positive integer as a combination of the digits 1, 2, and 3: each used at most once, combined via the operations of addition and multiplication
More informationGeometry. AIR Study Guide
Geometry AIR Study Guide Table of Contents Topic Slide Formulas 3 5 Angles 6 Lines and Slope 7 Transformations 8 Constructions 9 10 Triangles 11 Congruency and Similarity 12 Right Triangles Only 13 Other
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
More informationSubset Groupoids. W. B. Vasantha Kandasamy Florentin Smarandache
Subset Groupoids W. B. Vasantha Kandasamy Florentin Smarandache Educational Publisher Inc. Ohio 2013 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA
More informationUnit 2 Functions Continuity and End Behavior (Unit 2.3)
Unit 2 Functions Continuity and End Behavior (Unit 2.3) William (Bill) Finch Mathematics Department Denton High School Lesson Goals When you have completed this lesson you will: Identify whether a function
More informationSET DEFINITION 1 elements members
SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes
More informationModule 3: New types of data
Module 3: New types of data Readings: Sections 4 and 5 of HtDP. A Racket program applies functions to values to compute new values. These new values may in turn be supplied as arguments to other functions.
More informationDiscrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1
CS 70 Discrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 2050 VLSB A1 Hearst Annex 120 Latimer
More informationLesson Plan #31. Class: Geometry Date: Tuesday November 27 th, 2018
Lesson Plan #31 1 Class: Geometry Date: Tuesday November 27 th, 2018 Topic: Properties of parallel lines? Aim: What are some properties of parallel lines? Objectives: HW #31: 1) Students will be able to
More informationEC121 Mathematical Techniques A Revision Notes
EC Mathematical Techniques A Revision Notes EC Mathematical Techniques A Revision Notes Mathematical Techniques A begins with two weeks of intensive revision of basic arithmetic and algebra, to the level
More informationSlide 2 / 95. Kindergarten. Data
Slide 1 / 95 Slide 2 / 95 Kindergarten Data 2015-03-11 www.njctl.org Slide 3 / 95 Table of Contents Sorting Introduction Sorting by Color and Shape Click to go to that section Sorting by Size Classifying
More information