Quelpr
3 marksLogic and Boolean Algebra

CAPE Applied Mathematics Unit 2 · 2015 · Paper 2 · Question 2(b)

By constructing a truth table, determine whether (p ∧ q) → p is a tautology or a contradiction.

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 2(a)(i)Use the Hungarian algorithm to determine the class to which each teacher must be assigned in order to minimize the total time.[8 marks]
  2. 2(a)(ii)Hence, determine the total time spent in the classroom by the four teachers.[2 marks]
  3. 2(c)(i)Write down a Boolean expression for the given circuit.[4 marks]
  4. 2(c)(ii)Simplify the expression obtained in (c) (i) above and hence draw the corresponding circuit.[8 marks]

More practice: the rest of this paper · more Logic and Boolean Algebra questions · all CAPE Applied Mathematics Unit 2 past papers