This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE 260 QUIZ10 Relations: ANSWERS (30 minutes/total 5 questions) NAME: 1. Following relation is defined on the set { 1 , 2 , 3 , 4 } . { (1 , 1) , (1 , 2) , (2 , 1) , (2 , 2) , (3 , 3) , (4 , 4) } Indicate, whether it is reflexive, whether it is symmetric, whether it is antisymmetric, and whether it is transitive. reflexive, symmetric, transitive 2. Following relation is represented by a matrix below. Circle the appropriate properties below for the relation. reflexive/NO symmetric/YES antisymmetric/NO transitive/NO  1 2 3 4 1  1 1 1  2  1 1  3  1 1  4  0 3. Following relation is represented by a directed graph (digraph). A B C D Circle the appropriate properties below for the relation. reflexive/NO irreflexive/NO symmetric/NO antisymmetric/YES asymmetric/NO transitive/NO irreflexive: No loop in any node. asymmetric: ( a, b ) R ( b, a ) R even if a=b Thus, asymmetric does not allow selfloop while antisymmetric does....
View
Full
Document
This note was uploaded on 06/08/2009 for the course CSE 260 taught by Professor Saktipramanik during the Spring '08 term at Michigan State University.
 Spring '08
 SaktiPramanik
 Computer Science

Click to edit the document details