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

Info icon This preview shows pages 1–10. 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 [email protected] , 214-336-4973 September 29 and October 01, 2009 Embrey 129, SMU, Dallas, Texas Lectures 10 and 11 1
Image of page 1

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

View Full Document Right Arrow Icon
Lecture 10 & 11 Agenda R l ti Relations Transitive Closure of Relations Recap of Topics for Midterm Exam 10/01/09 2
Image of page 2
Relations Relations are a natural way to associate bj t f i t objects of various sets 3
Image of page 3

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

View Full Document Right Arrow Icon
Relations R can be described in R Roster form S b ild f Set-builder form 4
Image of page 4
Relations Arrow Diagram Write the elements of A in one column Write the elements B in another column Draw an arrow from an element a of A to an element b Draw an arrow from an element, , of to an element, , 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 5
Image of page 5

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

View Full Document Right Arrow Icon
Relations 6
Image of page 6