Showing 6 results
- (-) Remove Show only CPD activities with scheduled dates. filter Show only CPD activities with scheduled dates.
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 | 19 Sep 2024 |
|---|---|
| Location | Remote delivered CPD |
| Duration | 2 Hours |
| Fees | Free |
| Subsidy | Computing Subsidy up to - £0.00 |
Object-oriented programming (OOP) is an approach to systems development that focuses on objects and the way that they interact. The OOP method of programming (or paradigm) is different to the procedural paradigm, which many programmers start with on their learning journey.During this course you will learn about...
| Start date | 15 Oct 2024 |
|---|---|
| Location | London |
| 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 | 15 Oct 2024 |
|---|---|
| Location | Remote Delivered CPD |
| Duration | 2 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 |
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 | 18 Nov 2024 |
|---|---|
| Location | |
| Duration | 2 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 | 02 Dec 2024 |
|---|---|
| Location | |
| Duration | 2 Hours |
| Fees | Free |
| Subsidy | Computing Subsidy up to - £0.00 |