Both schemes are presented as Leveled Homomorphic Encryption schemes, which means that for each $L$, there is at least a set of parameters ($\lambda$, $q$, etc) that allows us to homomorphically evaluate circuits of multiplicative depth up to $L$ (and the reciprocal also holds, i.e. for each set of parameters, there is a limit $L$ on the multiplicative depth of the circuits that can be evaluated).
In those basic forms, they are not really fully homomorphic, because once you set the parameters, you can't evaluate any circuit.
However, there are bootstrapping methods for both schemes, and once you implement the bootstrapping to refresh the ciphertexts after each operation, they become fully homomorphic.
For the FV scheme, the bootstrapping is presented in the own paper, in section 5.
For the HEANN scheme (which you called CKKS in your question), the bootstrapping method only appeared in that subsequent paper and it was improved in this paper that was published this year in Eurocrypt.