AS / A Level Computer Science
AS / A Level Computer Science
A CS 15 Hardware and Virtual Machines
A CS 15.2 Boolean Algebra and Logic Circuits
Candidates should be able to:
Produce truth tables for logic circuits including half
adders and full adders
Show understanding of a flip-flop (SR, JK)
Show understanding of Boolean algebra Show understanding of Karnaugh maps (K-map)
Notes and guidance
May include logic gates with more than two inputs
Draw a logic circuit and derive a truth table for a
flip-flop
elements
Understand of the role of flip-flops as data storage
Understand De Morgan’s laws
Perform Boolean algebra using De Morgan’s laws
Simplify a logic circuit/expression using Boolean
algebra
Understand of the benefits of using Karnaugh maps
Solve logic problems using Karnaugh maps