Computer ScienceCode 9618

Boolean Algebra and Logic Circuits

What this topic asks you to be able to do

  • Produce the truth table that goes with a logic circuit, including half adders and full adders
  • Demonstrate comprehension of the flip-flop (SR, JK)
  • Draw a logic circuit for a flip-flop and derive its truth table
  • Demonstrate comprehension of the part flip-flops play as components that store data
  • Demonstrate an understanding of Boolean algebra
  • Understand De Morgan’s laws
  • Perform Boolean algebra, making use of De Morgan’s laws
  • Simplify a logic circuit or expression by means of Boolean algebra
  • Demonstrate an understanding of Karnaugh maps (K-map)
  • Understand the advantages that come from using Karnaugh maps
  • Solve logic problems with the aid of Karnaugh maps