Calculate Kth Row of Pascal's Triangle
In case n == 0 the loop body of calculateFactorial wouldn't be executed at all, and factorialValue would remain 1. You may safely remove the special case test.
The calculations of the binomial wastes time by recomputing factorials of the same number over and over again. The way the main loop in calculateRowValues is set up exaggerates the problem. Consider precomputing the list of required factorials once.
The code begins to fail at fairly small n: \$14!\$ is already beyond the 32-bit range. I recommend drop the factorial approach whatsoever, and compute the next row directly from the previous, using an \$\binom{n+1}{k} = \binom{n}{k-1} + \binom{n}{k}\$ identity.