This preview shows page 1. Sign up to view the full content.
Unformatted text preview: , T . You do not need to remember this formulation, although past exam questions have asked questions about this representation. 5. (Implementation) On a computer, we can store a relation using an array. This allows random access and easy manipulation, but can be expensive in space if the relation is much smaller that A B . With a sparse relation, where there are not many ordered pairs, an alternative approach is to use an array of linked lists, called an adjacency list . For example, consider the binary relation R = { (1 , 1) , (1 , 3) , (2 , 1) } on set 17...
View
Full
Document
 Spring '09
 Koskesh
 Math

Click to edit the document details