Importance of space constructability in time space relation in complexity
To answer your first question, this is tremendously unimportant. You typically don't encounter "funny" functions in actual complexity classes you may encounter in practice. Also, the answer to your question might depend on the exact definitions, which is a sign that you shouldn't be considering these complexity classes in the first place. That said, probably some of these inclusions do hold regardless of space-constructibility.

Regarding the second question, suppose that you computed $S(n)$ (in binary), and are interested to compute $2^{CS(n)}$. First, multiply $S(n)$ by $C$; this uses $O(\log S(n))$ space. Second, count $CS(n)$ spaces, fill them with zeroes, and add a one to the left. You have computed the binary representation of $2^{CS(n)}$, using additional $S(n)+1$ space.