Boolean Logic, Pathfinding Algorithms and Making the most of the Isaac CS Platform (A Level Strand 2) CH310 / F01
Summary
A Level Strand 2 forms part of The Big Secondary CPD & Networking Event
Boolean logic: 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. You will learn how to interpret circuit diagrams, write Boolean expressions and explore the laws of Boolean algebra. 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.
Pathfinding algorithm: Pathfinding algorithms are used to find solutions to a given problem, using the shortest path between a set of points. These problems are commonplace, from satellite navigation systems to internet packet routing. During this course you’ll learn how the Dijkstra’s and A* search algorithms function. You’ll explore how pathfinding algorithms are mapped to the A Level computer science curriculum, including the opportunity to discuss strategies of how to teach both algorithms effectively.
Isaac Computer Science Platform: Isaac Computer Science is an exciting, free learning platform, aimed at supporting students with the subject knowledge required for GCSE and A Level. During this short course, you’ll learn about the features available on the Isaac Computer Science platform, including how to:
• create a group (if you have your students' email addresses to hand, you can set them up as a group during the session)• set assignments (choose from our bank of pre-made question 'gameboards')• view your students' progress in their assignments• use auto-marking to inform your teaching• create your own custom ‘gameboard’
We can support you in enhancing the computing curriculum within schools
Who is it for?
This strand 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 and some basic knowledge of algorithms from GCSE computer science specifications.
What topics are covered?
During this Strand you will explore
Boolean logic: Logic gates – 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 – the laws of Boolean algebra, how to apply the laws to manipulate Boolean expressions and explore A Level style exam questions.
Pathfinding algorithms: Dijkstra’s Shortest Path Algorithm – how the Dijkstra’s algorithm functions, including with examples and opportunities for you to put the algorithm in practice. A* Search Algorithm – how the A* search algorithm works, you’ll have the opportunity to practice using examples and explore the pseudocode behind the algorithm.
Isaac Computer Science Platform:– this session will support you with the platform, it’ll include a live demonstration, try out the platform and have the opportunity to ask questions.
Who is the course leader?
Outcomes
Boolean Logic:
- 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
Pathfinding Algorithms:
- Understand the purpose of pathfinding algorithms
- Explore the Dijkstra’s algorithm, examine how the algorithm functions
- Explore the A* search algorithm, examine how the algorithm functions
- Practice finding the shortest path, using both pathfinding algorithms
Making the most of the Isaac CS Platform: You can create a free account on their website.
- understand how to create a class group and set assignments on the Isaac Computer Science platform
- explore how to create ‘gameboards’ on the platform
The conference covers the Teach Computing offer and how it can help you.
Sessions
| Date | Time | Location | |
|---|---|---|---|
| Boolean logic | 24 June 2024 | 09:00-12:00 | One Sixth Form College |
| Pathfinding algorithms | 24 June 2024 | 12:00-14:00 | One Sixth Form College |
| Making the most of the Isaac CS Platform - GCSE & A Level | 24 June 2024 | 14:00-15:30 | One Sixth Form College |
Actions
Fees & Subsidies
Included in your CPD subscription
Are you a state-funded Special School or PRU unit? You may be eligible for reduced course fees and even subsidies. Get in touch to check your eligibility and book your place directly. You can see our fees and subsidy information here.
Interested in this course?
Sign up to receive our emails to hear about the latest CPD available