The variant/application of the first isomorphism theorem you want is actually the Chinese remainder theorem. Let $R=\mathbb Z_5[x]$, $I=((x-1)^2)$, and $J=(x-3)$ Consider the map $R\to R/I \times R/J$. The kernel of this map is $I\cap J=((x-1)^2(x-3))$, and because the ideals are coprime, $I+J=(1)$, we have that the map will be surjective. Therefore we get an isomorphism $R/(I\cap J)\to R/I \times R/J$.
Before we try to count the number of zero divisors in each factor, we need to understand how zero divisors in the factors give rise to zero divisors in the product. If either factor is a zero divisor, then the result is a zero divisor, because if $x\neq 0$ and $xz=0$, then $(x,y)(z,0)=0$. Inclusion/exclusion tells us that the number of zero divisors of $R/I\times R/J$, which we will denote by $z(R/I\times R/J)$, will be $z(R/I)|R/J|+z(R/J)|R/I|-z(R/I)z(R/J)$, the number of ordered pairs where the first element is a zero divisor, plus the number of ordered pairs where the second element is a zero divisor, minus the pairs where both are.
Since $R/J\cong \mathbb Z_5$, there is only one zero divisor, namely $0$. So how many zero divisors are in $\mathbb Z_5/((x-1)^2)$? There are $5$, namely all the multiples of $x-1$. So how many total zero divisors are there? $5\cdot 5+1\cdot 25-5\cdot 1=25+25-5=45$.