Filters
Clear allLocation
Age range
Subject
Role
- (-) Remove Head of department/Subject Lead filter Head of department/Subject Lead
- Teacher (5) Apply Teacher filter
- Trainee Teacher (4) Apply Trainee Teacher filter
- Returning Teacher (3) Apply Returning Teacher filter
- Supply Teacher (3) Apply Supply Teacher filter
- ITE Lead/Mentor (2) Apply ITE Lead/Mentor filter
- Teaching Assistant/HLTA (1) Apply Teaching Assistant/HLTA filter
Showing 5 results
- (-) Remove Show only CPD activities with scheduled dates. filter Show only CPD activities with scheduled dates.
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...
Start date | 04 Jul 2024 |
---|---|
Location | Remote Delivered CPD |
Duration | 3 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |
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...
Start date | 09 Jul 2024 |
---|---|
Location | Remote Delivered CPD |
Duration | 3 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |
EP2217 KJAR EP Science FairRH715B05
Start date | 11 Jul 2024 |
---|---|
Location | Royston |
Duration | 1 Day |
Fees | Free |
Data-rich projects using spreadsheets and database are an integral part of KS3 computing, and technical qualifications at 14+. Developing the skills for student success, over the whole secondary age range, is the focus for this CPD....
Start date | 27 Sep 2024 |
---|---|
Location | Remote delivered CPD |
Duration | 6 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |
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...
Start date | 22 Oct 2024 |
---|---|
Location | |
Duration | 2 Hours |
Fees | Free |
Subsidy | Computing Subsidy up to - £0.00 |