We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byAnita Heighton
Modified over 2 years ago
CSE 20 DISCRETE MATH Prof. Shachar Lovett http://cseweb.ucsd.edu/classes/wi15/cse20-a/ Clicker frequency: CA
Todays topics Relations Section 6.1 in Jenkyns, Stephenson
Relations are graphs Think of relations as directed graphs U=nodes of graphs xRy means “there in an edge x y” Is A. R ? B. R ? C. Both D. Neither
Relations are graphs What does this relation captures? xRy means A. x>y B. x=y C. x divides y D. x+y E. None/more than one 2 3 4 1 5 6
Three important properties of relations
Types of relations
Test your understanding
Let U=“all Boolean formulas on n inputs” xRy = “x and y compute the same Boolean function” Is R symmetric / reflexive / transitive? A. Yes,Yes,Yes B. No,No,No C. Yes,Yes,No D. No,No,Yes E. Other
Next class Equivalence relations Read section 6.2 in Jenkyns, Stephenson
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.
© 2017 SlidePlayer.com Inc. All rights reserved.