(i)     Complete the truth table below.

(ii)    State whether the compound propositions \(\neg (p \wedge q)\) and \(\neg p \vee \neg q\) are equivalent.

Consider the following propositions.

\(p:{\text{ Amy eats sweets}}\)

\(q:{\text{ Amy goes swimming.}}\)

Write, in symbolic form, the following proposition.

Amy either eats sweets or goes swimming, but not both.

(i)

     (A3)

Note: Award (A1) for \(p \wedge q\) column correct, (A1)(ft) for \(\neg (p \wedge q)\) column correct, (A1) for last column correct.

(ii)    Yes.     (R1)(ft)     (C4)

Note: (ft) from their second and the last columns. Must be correct from their table.

[4 marks]

\(p {\underline \vee} q\).     (A1)(A1)     (C2)

Note: Award (A1) for \(p \ldots q\), (A1) for \({\underline \vee} \). Accept \((p \vee q) \wedge \neg (p \wedge q)\) or \((p \vee q) \wedge (\neg p \vee \neg q)\).

[2 marks]

This question was well answered by many of the candidates. It is an area of the syllabus that is well taught and many managed to get a follow through mark even though one of the columns in the table might have been incorrect.

This question was well answered by many of the candidates. It is an area of the syllabus that is well taught and many managed to get a follow through mark even though one of the columns in the table might have been incorrect.