Boolean logic in A Level computer science CM503 / G01
Summary
Boolean 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
What topics are 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 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.
How long is this course?
This course will last approximately 2.5 hours, these sessions maybe split across multiple days.
Who is the course leader?
-
Steven Ireland
My name is Steve Ireland and I am an Assistant Principal and Curriculum Advisor of Computer Science for a large Multi Academy Trust in the South...
-
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
Sessions
| Date | Time | Location | |
|---|---|---|---|
| 1 - Logic gates | 16 February 2024 | 15:30-16:30 | Virtual |
| 2 - Boolean Algebra | 16 February 2024 | 16:30-18:00 | Virtual |
Actions
Cost
| Trainee Teacher | Activity feeFree | |
|---|---|---|
| Priority school | Activity feeFree | Subsidy available*£0.00 |
| Priority school repeat teacher | Activity feeFree | Subsidy available*£0.00 |
| English Maintained | Activity feeFree | Subsidy available*£0.00 |
| Other | Activity fee£75.00 +VAT | Subsidy available*£0.00 |
This subsidy can contribute towards the costs associated with supply cover Find out more. |
Check your school subsidy status
The subsidy value may be higher for your school or college.
Included in your CPD subscription
This course is part of your school's CPD subscription. No active subscription? Learn how to get unlimited access to all CPD for your school.
Alternative dates
Interested in this course?
Sign up to receive our emails to hear about the latest CPD available