Boolean Algebra (II) – Computational Mathematics

Content Covered
The Laws of Boolean Algebra
Simplification of Expressions
De Morgan’s Laws
Past Years Questions
Chapter Objectives
At the completion of this chapter, you would have learnt:

  • To analyse and simplify circuits by Boolean Algebra;
  • To draw a logic circuit.

Note: To easily navigate through these KNEC Pdf notes below, Mobile phone users are advised to use Mozilla or Chrome browsers

[tnc-pdf-viewer-iframe file=”” width=”100%” height=”800″ download=”false” print=”false” fullscreen=”false” share=”true” zoom=”false” open=”true” pagenav=”true” logo=”true” find=”true” current_view=”false” rotate=”true” handtool=”true” doc_prop=”true” toggle_menu=”true” language=”en-US” page=”” default_zoom=”auto” pagemode=””]