lec10&11

lec10&11 - Discrete Computation Structures CSE 2353...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Computation Structures CSE 2353 Bhanu Kapoor, PhD Department of Computer Science & Engineering Southern Methodist University, Dallas, TX bkapoor@smu.edu , 214-336-4973 September 29 and October 01, 2009 Embrey 129, SMU, Dallas, Texas Lectures 10 and 11 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 10 & 11 Agenda ± Relations ± Transitive Closure of Relations ± Recap of Topics for Midterm Exam 10/01/09 2
Background image of page 2
Relations ± Relations are a natural way to associate objects of various sets 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Relations an be described in ± R can be described in ± Roster form ± Set-builder form 4
Background image of page 4
Relations ± Arrow Diagram rite the elements of one column ² Write the elements of A in one column ² Write the elements B in another column raw an arrow from an element of an element ² Draw an arrow from an element, a , of A to an element, b , of B , if ( a , b ) R ² Here, A = {2,3,5} and B = {7,10,12,30} and R from A into B is defined as follows: For all a A and b B , a R b if and only if a divides b ² The symbol called an arrow) represents the relation R y () p 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Relations 6
Background image of page 6
Relations ± Directed Graph et e a relation on a finite set ² Let R be a relation on a finite set A ² Describe R pictorially as follows: ± For each element of A , draw a small or big dot and label the dot by the corresponding element of A raw an arrow from a dot labeled another ± Draw an arrow from a dot labeled a , to another dot labeled , b , if a R b .
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 35

lec10&11 - Discrete Computation Structures CSE 2353...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online