Teacher Quan — Private Computer Science Teacher

Candidates should be able to

Theory
  • Produce truth tables for logic circuits including half adders and full adders
    • May include logic gates with more than two inputs
  • Show understanding of a flip-flop (SR, JK)
    • Draw a logic circuit and derive a truth table for a flip-flop
    • Understand of the role of flip-flops as data storage elements
  • Show understanding of Boolean algebra
    • Understand De Morgan’s laws
    • Perform Boolean algebra using De Morgan’s laws
    • Simplify a logic circuit/expression using Boolean algebra
  • Show understanding of Karnaugh maps (K-map)
    • Understand of the benefits of using Karnaugh maps
    • Solve logic problems using Karnaugh maps