{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CS301-Lec34 handout

# CS301-Lec34 handout - CS301 Data Structures Lecture No 34...

This preview shows pages 1–3. Sign up to view the full content.

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

View Full Document
CS301 – Data Structures Lecture No. 34 ___________________________________________________________________ relationships. If you are cousin of someone, the cousin of that person is also related to you. He may not be your first cousin but is related to you. Now we will see an example of binary relationship that is not based on equivalence relationship. The ≤ relationship is not an equivalence relation. We will prove this by applying the three rules. The first rule is reflexive. It is reflexive, since x ≤ x , as x is not less than x but surely is equal to x . Let’s check the transitive condition. Since x ≤ y and y ≤ z implies x ≤ z ., it is also true. However it is not symmetric as x ≤ y does not imply y ≤ x . Two rules are satisfied but symmetric rule does not. Therefore ≤ is not an equivalence relation.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

CS301-Lec34 handout - CS301 Data Structures Lecture No 34...

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

View Full Document
Ask a homework question - tutors are online