AND: The result is true only when both A and B are true. |
A | B | Result |
1 | 1 | 1 |
1 | 0 | 0 |
0 | 1 | 0 |
0 | 0 | 0 |
|
|
|
OR: The result is true if A or B are true. |
A | B | Result |
1 | 1 | 1 |
1 | 0 | 1 |
0 | 1 | 1 |
0 | 0 | 0 |
|
|
|
XOR: The result is true if A != B. |
A | B | Result |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 0 |
0 | 0 | 0 |
|
|
Computing Access-List and Wildcard Pairs |
|
Bit Swap: convert from canonical format to non-canonical format. |
This works pretty great with 4 fingers on each hand, cross and flip. |
|
|
|
|
Memorize the bit patterns for contiguous ones and zeroes in an octet: |
Octet-1 | Octet-2 | Decimal |
0000 | 0000 | 0 |
0000 | 0001 | 1 |
0000 | 0011 | 3 |
0000 | 0111 | 7 |
0000 | 1111 | 15 |
0001 | 1111 | 31 |
0011 | 1111 | 63 |
0111 | 1111 | 127 |
1111 | 1111 | 255 |
| | |
0000 | 0000 | 0 |
1000 | 0000 | 128 |
1100 | 0000 | 192 |
1110 | 0000 | 224 |
1111 | 0000 | 240 |
1111 | 1000 | 248 |
1111 | 1100 | 252 |
1111 | 1110 | 254 |
1111 | 1111 | 255 |
|