Question

# For each of the following relations, provide such a valid traversal order (Describe how the table is filled, in

what orders), or if no traversal order is possible for the given relation, briefly justify why.

(1). A(i, j) = F( A(i, j-1), A(i-1, j-1), A(i-1, j+1) )

(2). A(i, j) = F( A(min{i, j}-1, min{i, j}-1), A(max{i, j}-1, max{i, j}-1) )

(3). A(i, j) = F( A(i-2, j-2), A(i+2, j+2) )

#### Top Answer

The traversal order for the given relations is discussed below: 1. A ( i , j ) = F ( A ( i , j 1 ) , A ( i 1 , j... View the full answer