CSE 311 Foundations of Computing I

Slides:



Advertisements
Similar presentations
Representing Relations
Advertisements

CSE 311 Foundations of Computing I
Representing Relations Rosen 7.3. Using Matrices For finite sets we can use zero-one matrices. Elements of each set A and B must be listed in some particular.
CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.
8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
Basic Properties of Relations
8.4 Closures of Relations. Intro Consider the following example (telephone line, bus route,…) abc d Is R, defined above on the set A={a, b, c, d}, transitive?
CS2210(22C:19) Discrete Structures Relations Spring 2015 Sukumar Ghosh.
CSE115/ENGR160 Discrete Mathematics 04/24/12 Ming-Hsuan Yang UC Merced 1.
CSE 311 Foundations of Computing I Lecture 19 Relations Autumn 2011 CSE 3111.
1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.
Applied Discrete Mathematics Week 10: Equivalence Relations
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∩
Chapter 4 Relations and Digraphs
Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
CSE 311 Foundations of Computing I Lecture 23 Finite State Machines Autumn 2012 CSE 3111.
Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 Relations.
Relations and Their Properties
CSE 311 Foundations of Computing I Lecture 21 Finite State Machines Autumn 2011 CSE 3111.
CSE 311 Foundations of Computing I Lecture 21 Finite State Machines Spring
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
1 Closures of Relations: Transitive Closure and Partitions Sections 8.4 and 8.5.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 8 Relations 歐亞書局.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Relations.
CSE 311: Foundations of Computing Fall 2014 Lecture 20: Relations and Directed Graphs.
Relations and their Properties
CSE 311 Foundations of Computing I Lecture 22 Relations, Database Autumn 2012 CSE TexPoint fonts used in EMF. Read the TexPoint manual before you.
Relations. Important Definitions We covered all of these definitions on the board on Monday, November 7 th. Definition 1 Definition 2 Definition 3 Definition.
1 Chapter Equivalence, Order, and Inductive Proof.
CS 103 Discrete Structures Lecture 19 Relations. Chapter 9.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
CSE 311 Foundations of Computing I Lecture 20 Relations, Graphs, Finite State Machines Autumn 2011 CSE 3111 TexPoint fonts used in EMF. Read the TexPoint.
Discrete Structures – CNS2300
Problem Statement How do we represent relationship between two related elements ?
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,
Chapter Relations and Their Properties
1 Section 4.1 Properties of Binary Relations A binary relation R over a set A is a subset of A  A. If (x, y)  R we also write x R y. Example. Some sample.
8.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of.
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and B = {a,b} {( 0, a), (
CSE 311 Foundations of Computing I Lecture 19 Recursive Definitions: Context-Free Grammars and Languages Spring
Section 9.3. Section Summary Representing Relations using Matrices Representing Relations using Digraphs.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
Relations and Their Properties
Relations Binary relations represent relationships between the elements of two sets. A binary relation R from set A to set B is defined by: R  A 
Relations Chapter 9.
Representing Relations
CSE 504 Discrete Structures & Foundations of Computer Science
CSE 311 Foundations of Computing I
CSNB 143 Discrete Mathematical Structures
CS2210 Discrete Structures Relations
Relations and Their Properties
Relations (sections 7.1 – 7.5)
Summary 3 Discrete Probability (sections )
Relations: representation and closures
Closures of Relations: Transitive Closure and Partitions
CSE 321 Discrete Structures
Relations and their Properties
CSE 321 Discrete Structures
CSE 311: Foundations of Computing
CSE 321 Discrete Structures
Discrete Math (2) Haiming Chen Associate Professor, PhD
Richard Anderson Winter 2019 Lecture 6
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Closures of Relations Epp, section 10.1,10.2 CS 202.
Agenda Lecture Content: Relations (Relasi)
4.4 Properties of Relations
Presentation transcript:

CSE 311 Foundations of Computing I Lecture 20 Relations, Directed Graphs Spring 2013

Announcements Reading assignments Upcoming topic 7th Edition, Section 9.1 and pp. 594-601 6th Edition, Section 8.1 and pp. 541-548 Upcoming topic Finite State Machines

Definition of Relations Let A and B be sets, A binary relation from A to B is a subset of A  B Let A be a set, A binary relation on A is a subset of A  A

Relation Examples R1 = {(a, 1), (a, 2), (b, 1), (b, 3), (c, 3)} R2 = {(x, y) | x ≡ y (mod 5) } R3 = {(c1, c2) | c1 is a prerequisite of c2 } R4 = {(s, c) | student s had taken course c }

Properties of Relations Let R be a relation on A R is reflexive iff (a,a)  R for every a  A R is symmetric iff (a,b)  R implies (b, a) R R is antisymmetric iff (a,b)  R and a  b implies (b,a)  R / R is transitive iff (a,b) R and (b, c) R implies (a, c)  R

Combining Relations Let R be a relation from A to B Let S be a relation from B to C The composite of R and S, S  R is the relation from A to C defined S  R = {(a, c) |  b such that (a,b) R and (b,c) S}

Examples (a,b) Parent: b is a parent of a (a,b) Sister: b is a sister of a What is Sister  Parent? What is Parent  Sister? S  R = {(a, c) |  b such that (a,b) R and (b,c) S}

Examples Using the relations: Parent, Child, Brother, Sister, Sibling, Father, Mother, Husband, Wife express - Uncle: b is an uncle of a Cousin: b is a cousin of a

Powers of a Relation R2 = R  R = {(a, c) |  b such that (a,b) R and (b,c) R} R0 = {(a,a) | a  A} R1 = R Rn+1 = Rn  R

Matrix representation Relation R on A={a1, … ap} {(1, 1), (1, 2), (1, 4), (2,1), (2,3), (3,2), (3, 3) (4,2) (4,3)}

Directed graphs G = (V, E) Path: v1, v2, …, vk, with (vi, vi+1) in E V – vertices E – edges, order pairs of vertices Path: v1, v2, …, vk, with (vi, vi+1) in E Simple Path Cycle Simple Cycle

Representation of relations Directed Graph Representation (Digraph) {(a, b), (a, a), (b, a), (c, a), (c, d), (c, e) (d, e) } b c a d e

Computing the Composite Relation using the Graph Representation If S={(2,2),(2,3),(3,1)} and R={(1,2),(2,1),(1,3)} compute S  R

Paths in relations Let R be a relation on a set A. There is a path of length n from a to b if and only if (a,b) Rn

Connectivity relation Let R be a relation on a set A. The connectivity relation R* consists of the pairs (a,b) such that there is a path from a to b in R. Note: The text uses the wrong definition of this quantity. What the text defines (ignoring k=0) is usually called R+

Properties of Relations Let R be a relation on A R is reflexive iff (a,a)  R for every a  A R is symmetric iff (a,b)  R implies (b, a) R R is transitive iff (a,b) R and (b, c) R implies (a, c)  R

Transitive-Reflexive Closure Add the minimum possible number of edges to make the relation transitive and reflexive The transitive-reflexive closure of a relation R is the connectivity relation R*

How is Anderson related to Bernoulli?

How is Anderson related to Bernoulli?

http://genealogy.math.ndsu.nodak.edu/ Autumn 2011 CSE 311

Anderson Mayr Bauer Caratheodory Minkowski Klein Lagrange Euler Lipschitz Dirichlet Fourier Johann Bernoulli Jacob Bernoulli Leibniz Weigel Rheticus Copernicus

Beame Cook Quine Whitehead Hopkins Newton Barrow Galileo Sedgewick Smith

Nicolaus Copernicus Georg Rheticus Moritz Steinmetz Christoph Meurer Philipp Muller Erhard Weigel Gottfried Leibniz Noclas Malebranache Jacob Bernoulli Johann Bernoulli Leonhard Euler Joseph Lagrange Jean-Baptiste Fourier Gustav Dirichlet Rudolf Lipschitz Felix Klein C. L. Ferdinand Lindemann Herman Minkowski Constantin Caratheodory Georg Aumann Friedrich Bauer Manfred Paul Ernst Mayr Richard Anderson Galileo Galilei Vincenzo Viviani Issac Barrow Isaac Newton Roger Cotes Robert Smith Walter Taylor Stephen Whisson Thomas Postlethwaite Thomas Jones Adam Sedgewick William Hopkins Edward Routh Alfred North Whitehead Willard Quine Hao Wang Stephen Cook Paul Beame

n-ary relations Let A1, A2, …, An be sets. An n-ary relation on these sets is a subset of A1 A2 . . .  An.

Relational databases STUDENT Student_Name ID_Number Office GPA Knuth 328012098 022 4.00 Von Neuman 481080220 555 3.78 Russell 238082388 3.85 Einstein 238001920 2.11 Newton 1727017 333 3.61 Karp 348882811 3.98 Bernoulli 2921938 3.21

Relational databases What’s not so nice? STUDENT Student_Name ID_Number Office GPA Course Knuth 328012098 022 4.00 CSE311 CSE351 Von Neuman 481080220 555 3.78 Russell 238082388 3.85 CSE312 CSE344 Newton 1727017 333 3.61 Karp 348882811 3.98 Bernoulli 2921938 3.21 What’s wrong: Redundant data: we repeat all the GPAs and all the Office numbers Missing data: we lost Einstein What’s not so nice?

Relational databases Better TAKES STUDENT ID_Number Course 328012098 CSE311 CSE351 481080220 238082388 CSE312 CSE344 1727017 348882811 2921938 Student_Name ID_Number Office GPA Knuth 328012098 022 4.00 Von Neuman 481080220 555 3.78 Russell 238082388 3.85 Einstein 238001920 2.11 Newton 1727017 333 3.61 Karp 348882811 3.98 Bernoulli 2921938 3.21 Better

Database Operations: Projection Office 022 555 333 Find all offices: ΠOffice(STUDENT) Office GPA 022 4.00 555 3.78 3.85 2.11 333 3.61 3.98 3.21 Find offices and GPAs: ΠOffice,GPA(STUDENT)

Database Operations: Selection Find students with GPA > 3.9 : σGPA>3.9(STUDENT) Student_Name ID_Number Office GPA Knuth 328012098 022 4.00 Karp 348882811 3.98 Retrieve the name and GPA for students with GPA > 3.9 : ΠStudent_Name,GPA(σGPA>3.9(STUDENT)) Student_Name GPA Knuth 4.00 Karp 3.98

Database Operations: Natural Join Student ⋈ Takes Student_Name ID_Number Office GPA Course Knuth 328012098 022 4.00 CSE311 CSE351 Von Neuman 481080220 555 3.78 Russell 238082388 3.85 CSE312 CSE344 Newton 1727017 333 3.61 Karp 348882811 3.98 Bernoulli 2921938 3.21