Boolean logic in A Level computer science
CP503 Live remote training course
During this course you'll explore how Boolean logic is a way of describing the circuits inside a computer.
Skip to course bookingBoolean logic is a way of describing the circuits inside a computer, and the same concept can be represented by a logic circuit diagram, a truth table, or a Boolean expression.
During this course you’ll learn how to interpret circuit diagrams, write Boolean expressions and explore the laws of Boolean algebra.
You’ll explore how Boolean logic is mapped to the A Level computer science curriculum, discuss strategies of how to teach Boolean logic effectively and explore exam style questions and the expectations required of your students.
Who is it for?
This course is aimed at teachers delivering A Level computer science. It is advised you have some basic knowledge of Boolean logic from GCSE computer science specifications.
During this course you’ll access the Isaac Computer Science platform, it is advised you sign up for a free, teachers account ahead of the course
Topics covered
- Logic gates – during this session you’ll explore the various logic gates required for A Level computer science. You’ll learn how each of the logic gates can be represented as a truth table and how to write Boolean expressions for a given circuit diagram.
- Boolean algebra – during this session you’ll explore the laws of Boolean algebra, how to apply the laws to manipulate Boolean expressions and explore A Level style exam questions.
How long is this course?
This course will last approximately 2.5 hours, these sessions maybe split across multiple days.
How will you learn?
Scheduled live, interactive online sessions led by an experienced practitioner. Flexible Professional Development Leader-supported, participant-led tasks, involving deep exploration of the subject content.
Outcomes
- Explore the various logic gates required for A Level computer science; draw and interpret logic gate circuit diagrams
- Construct an equivalent logic gate circuit for a given Boolean expression
- Identify and explain the laws of Boolean algebra
- Apply the laws of Boolean algebra to simplify and manipulate Boolean expressions
Dates coming soon
Contact your local Computing Hub for more information
Find your local Hub
Adapted teaching and effective learning interventions in secondary computing
Develop an evidence-informed approach to education recovery over a sustained period, securing the computing education of young people following a period of great disruption.
Adapting the Teach Computing Curriculum for mixed-year classes - short course
Explore progression within Teach Computing Curriculum and how to use this to adapt it for your own mixed-age setting.
Algorithms and programming for AQA GCSE specification - residential
During this two day residential, you'll explore the fundamentals required for teaching algorithms and programming, aligned to the AQA 9-1 GCSE specification.