Graph theory:

1. How many paths of length 3 are there that end at D?

2. How many cycles are in this graph?

Bit-string flicking:

Solve for X: RCIRC-4(LSHIFT-1(X OR 00101) AND RCIRC-2(11011 AND 10111)) = 11001 AND 11100 OR LSHIFT-3(01111 AND 11011)

Solve for X: LSHIFT-1(00101 OR RCIRC-2(X XOR 01010)) = LSHIFT-1(11010 XOR 00111)

RCIRC-3(01101 XOR (X AND 10110)) = 01101

Solve for X: RSHIFT-2(00101 OR 00011 AND RCIRC-2(01011)) = LCIRC-2(01110 AND RCIRC-4(00100 OR X))

Graph Theory:

1. 12 paths

2. 1 cycle

Bit-String Flicking:

*work in progress lol.. will update*