Boolean Algebra (I) – Computational Mathematics

Content Covered
Introduction
Logic Programming
Logic and Hardware
Language and Symbols
Truth Tables
Logical Equivalence
Switching Diagrams
Combining Logic Gates
The Algebra of Logic
Chapter Objectives
At the completion of this chapter, you would have learnt:

  • The importance of two-state (TRUE/FALSE) logic in computing;
  • Model logical relations by truth tables, Venn diagrams, switching circuits or „gates‟.

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=”https://www.ebookskenya.co.ke/wp-content/uploads/2019/04/computational-math-73-87.pdf” 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=””]