The negation of the Boolean expression $p \vee (\sim p \wedge q)$ is equivalent to

If $(p \wedge \sim q) \wedge (p \wedge r) \rightarrow \sim p \vee q$ is false,then the truth values of $p, q$ and $r$ are respectively

If the Boolean expression $(p \oplus q) \wedge (\sim p \Theta q)$ is equivalent to $p \wedge q$,where $\oplus, \Theta \in \{\wedge, \vee\}$,then the ordered pair $(\oplus, \Theta)$ is:

The symbolic form of the following circuit is (where $p, q$ and $r$ represent switches $s_{1}, s_{2}$ and $s_{3}$ which are closed respectively):

For any three simple statements $p, q, r$,the statement $(p \wedge q) \vee (q \wedge r)$ is true if and only if:

If $p$ and $q$ are simple propositions,then $p \Leftrightarrow \sim q$ is true when