E-Cube algorithm:

1. for source A and destination B, result = A XOR B

2. for each non-zero bit in the result starting from the least significant (right most) travel along that dimension

Using the above algorithm give the sequence of hops, node by node, for the following source and destinations on this hypercube:

1. 00001111

2. 11110000

3. 01011010

4. 11001000

5. 00011000

6. 00101111

AQ3 . AQ r000 1001 0010 101p.. 001 1011 1100, 1101 0110 10