A nontrivial homomorphism $\varphi\colon\mathbb Z_p\to\operatorname{Aut}(\mathbb Z_q)$ exists in the form of an embedding, because $\operatorname{Aut}(\mathbb Z_q)$ is cyclic of order $q-1$ and $p\mid q-1$. But to build up a semidirect product $\mathbb Z_p\stackrel{\varphi}{\ltimes}\mathbb Z_q$ in terms of its Cayley table, you've got to explicitly know how the automorphisms $\varphi_\alpha$ do operate, for every $\alpha\in\mathbb Z_p$. Necessarily, $\varphi_0=Id_{\mathbb Z_q}$ and, for $j=1,\dots, p-1$, $\varphi_j$ has order $p$. Since $\varphi_j$ is an automorphism of $\mathbb Z_q$, $\varphi_j(0)=0$ and, for every nontrivial $k$, $\varphi_j(k)=$ $k\varphi_j(1)$. By induction:
$$\varphi_j^n(k)=k\varphi_j(1)^n$$
and since $\varphi_j$ has order $p$:
$$\varphi_j(1)^p=1$$
Therefore, each of the $p-1$ elements of order $p$ in $\mathbb Z_q^\times$ generates a distinct automorphism of $\mathbb Z_q$, of order $p$. Denoted with $x\in\mathbb Z_q^\times$ one of such elements of order $p$, the other ones are $x^2,\dots,x^{p-1}$, and with them all we get the recipe (cycle notation):
\begin{alignat}{1}
\varphi_1 &:= (1,x,\dots,x^{p-1})(i_2,i_2x,\dots,i_2x^{p-1})\dots(i_N,i_Nx,\dots,i_Nx^{p-1}) \\
\varphi_k &:= \varphi_1^k,\text{ for }k=2,\dots,p-1 \\
\tag1
\end{alignat}
where $N:=\frac{q-1}{p}$ and $R:=\{i_1:=1,i_2,\dots,i_N\}$ is a set of cosets representatives of the quotient $\mathbb Z_q^\times/\langle x\rangle$.
Once you get all the $\varphi_j$'s from $(1)$, you can plug them into the definition of semidirect product to explicitly build up $G$ as $\mathbb Z_p\stackrel{\varphi}{\ltimes}\mathbb Z_q$ (Cayley table). By renaming the generator of order $p$, you just change the order in the sequence $(\varphi_j)_{j=1,\dots,p-1}$ gotten from $(1)$, so this construction is essentially unique.
Example 1. Take $p=3$, $q=7$, $x=2$ (in fact $2$ has order $3$ in $\mathbb Z_7^\times$). Hence $N=2$, and $(1)$ yields:
\begin{alignat}{1}
&\varphi_{1}=(1,2,4)(3,6,5) \\
&\varphi_{2}=(1,4,2)(3,5,6) \\
\end{alignat}
Example 2. Take $p=5$, $q=11$, $x=3$ (in fact $3$ has order $5$ in $\mathbb Z_{11}^\times$). Hence $N=2$, and $(1)$ yields:
\begin{alignat}{1}
&\varphi_{1}=(1,3,9,5,4)(2,6,7,10,8) \\
&\varphi_{2}=(1,9,4,3,5)(2,7,8,6,10) \\
&\varphi_{3}=(1,5,3,4,9)(2,10,6,8,7) \\
&\varphi_{4}=(1,4,5,9,3)(2,8,10,7,6) \\
\end{alignat}
Example 3. Take $p=3$, $q=13$, $x=3$ (in fact $3$ has order $3$ in $\mathbb Z_{13}^\times$). Hence $N=4$, and $(1)$ yields:
\begin{alignat}{1}
&\varphi_{1}=(1,3,9)(2,6,5)(4,12,10)(7,8,11) \\
&\varphi_{2}=(1,9,3)(2,5,6)(4,10,12)(7,11,8) \\
\end{alignat}