All the answers are given under the assumption that no model can have an empty domain.

\[\begin{gather} \forall x.\con{p}x\rightarrow \con{q}x&\not\models &\exists x.\con{p}x\\ \forall x.\con{p}x\rightarrow \con{q}x&\not\models & \exists x.\con{q}x\\ \exists x.\con{p}x\wedge \con{q}x&\models & \exists x.\con{p}x\\ \forall x.\con{p}x &\models &\exists x.\con{p}x\\ \neg\exists x\,\con{r}x&\models & \forall x.\neg\con{r}x\\ \forall x.\con{p}x\land\con{r}x&\not\models & \forall x.\con{p}x\rightarrow \con{r}x\\ \forall x.\con{p}x\land\con{r}x&\models & \forall x.\con{p}x :\land. \forall x.\con{r}x\\ \forall x.\con{p}x\lor\con{r}x&\not\models & \forall x.\con{p}x :\lor. \forall x.\con{r}x\\ \exists x.\con{p}x\land\con{r}x&\not\models & \exists x.\con{p}x :\land. \exists x.\con{r}x\\ \exists x.\con{p}x\lor\con{r}x&\models & \exists x.\con{p}x :\lor. \exists x.\con{r}x\\ \end{gather}\]