A-Level Computer Science: Boolean Algebra and Logic Circuits

This material trains the Boolean algebra and logic circuit content of A level Computer Science: the part of the course where a line of algebra has to agree with a truth table, and where a few gates turn into an adder or a memory cell. It is written for Year 12 and Year 13 students, and it goes beyond the GCSE gates to the manipulations the A level papers expect.

The quiz has twelve questions. Four are algebraic simplifications: absorption, factorising a common term, and both forms of De Morgan's law followed by double negation. Two are Karnaugh map questions, one with three inputs given as an output column and one with four inputs given as a list of rows, where the student has to spot which variables drop out of a group. One question builds OR from NAND gates alone, one uses XOR twice with the same input, and one counts the rows of a truth table for a NOR-based expression. The adder questions ask which gates form a half-adder and what a full-adder outputs for three given bits. The last question traces an edge-triggered D-type flip-flop through a sequence of input changes, where only the value at each rising clock edge matters.

Every explanation shows the working and says why the wrong options fail, usually by checking one input row. The notation is stated in each question (¬, ∧, ∨, ⊕), and circuits are described in words so no drawing is needed.

The flashcards cover the NAND, NOR and XOR columns, the laws of Boolean algebra (identity, complement, double negation, distribution, absorption, De Morgan), the Karnaugh map grouping rules and why the axes use Gray code, the adder equations, the D-type flip-flop and why NAND is universal.

The written work has eight longer tasks to answer on paper: proving De Morgan's law with a full truth table, simplifying a three-term expression and naming each law, a four-variable Karnaugh map with a wrap-around group, designing a half-adder and explaining its limit, building a full-adder from two half-adders and tracing 1 + 1 + 1, describing how D-type flip-flops form a register, building NOT, AND and OR from NAND, and writing and expanding an expression for a car's warning buzzer. Each task has a model answer and the points a marker would look for.

There is also a short oral practice with an examiner, who asks one question at a time, describes every circuit in words and gives brief feedback at the end.

The content is based on the Boolean algebra sections of the A level specifications. Karnaugh maps are listed, for example, by OCR; AQA lists NAND, NOR and XOR gates, half-adders and full-adders, the D-type flip-flop as a memory unit, and Boolean identities with De Morgan's laws.

• Simplify Boolean expressions using identity, complement, distribution, absorption and double negation
• Apply both forms of De Morgan's law
• Simplify three- and four-variable functions with a Karnaugh map
• Build NOT, AND and OR from NAND gates alone
• Trace half-adders and full-adders and explain the carry
• Describe how an edge-triggered D-type flip-flop stores a bit

Practice material written by Zestly, based on the Boolean algebra and logic gate content of the A level Computer Science specifications (for example OCR H446 section 1.4.3 and AQA 7517 sections 4.6.4 and 4.6.5).