Cambridge AS & A Level Computer Science
15.2Boolean algebra and logic circuits
Boolean algebra and logic circuits in Cambridge AS & A Level Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Subtopic67 practice questions3 lessons
Learning objectives
What the syllabus expects you to be able to do.
- 15.2.1Produce truth tables for logic circuits, including half and full adders, and describe SR and JK flip-flops.
- 15.2.2Apply Boolean algebra and De Morgan's laws to simplify circuits and expressions.
- 15.2.3Use Karnaugh maps to solve logic problems.
Lessons
- Full access
Boolean algebra and De Morgan's laws
55 min
- Full access
Half adders, full adders and flip-flops
50 min
- Full access
Karnaugh maps
50 min
Join to read every lesson, or see what Full access includes.
Sample question
A sample question on this topic. Answer it, check it, then read the worked answer.
Turn Boolean algebra and logic circuits into a strength.
Practise with instant marking, see your mastery grow and get a study plan built around your exam date.