Download presentation

Presentation is loading. Please wait.

Published byAnita Heighton Modified over 2 years ago

1
CSE 20 DISCRETE MATH Prof. Shachar Lovett http://cseweb.ucsd.edu/classes/wi15/cse20-a/ Clicker frequency: CA

2
Todays topics Relations Section 6.1 in Jenkyns, Stephenson

3
(Binary) Relations

5
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

6
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

7
Three important properties of relations

8
Symmetric relations

9
Types of relations

11
Test your understanding

16
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

17
Next class Equivalence relations Read section 6.2 in Jenkyns, Stephenson

Similar presentations

OK

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google