d) o:Q->Q, o(q) shifts the bits of s 4 places to the right discarding the 4 right most bits and setting the 4 left most bits to 0.
this seems similar to b), since its like your changing the length of the set again
e) a:Q->Q, a(q) = complement of q,
f) b:Q->Q, b(q) = q AND t where t is a fixed 64 bit string
g) y:Q->Q, y(q) = q OR t, where t is a fixed 64 bit string
Since my understanding when bit theory is involved just messes things up, doing the subsequent questions becomes impossible.
If you guys could help me do the question or point me in the right direction or atleast give me an example like this that involves bit theory with some kind of working solution.
I'd greatly appreciate any help.