>>13675938a -> b is equivalent to !a || b.
So
(q -> !p) || (!p -> !q)
(!q || !p) || (!(!p) || !q)
Removing parentheses, simplifying, and regrouping, we can see that:
!q || (!p || p) || !q
!p || p is always true. So we're left with: !q || !q.
This can be collapsed to just:
!q
Therefore, your truth table will have 2 rows.
I'm using CS notation here btw: ("!" is a logical not and "||" is a logical or).
