Listing all results (220)

Dijkstra's Algorithm

Dijkstra's algorithm finds the shortest path for a given problem. Dijkstra's algorithm can be used to find the shortest route between two cities. This algorithm is so powerful that it not only finds the shortest path from a chosen source to a given destination, it also finds all of the shortest paths from the...

Hello World Haskell for Key Stage 1 and PD

In this article from Hello World we discuss how the foundations of computer science can contribute to Key Stage 1 mathematics and vice versa.

Crumble Card Buggy

This resource provides instructions for building a card buggy and creating a sample programme for your crumble board. You will need motors, a battery pack and connectors to complete the project.

Lesson 9: Designing our smart city part 3

Lesson 8: Designing our smart city part 2

Lesson 7: Designing our smart city part 1

Lesson 9: Designing our smart city part 3

Lesson 8: Designing our smart city part 2

Lesson 7: Designing our smart city part 1

Programming a buggy with Invent!

This collection of resources can be used to create a roving buggy, when combined with either a Crumble Controller buggy kit or Invent! starter pack. The resources include instructions for programming your buggy, activity mats for students to use for their programming challenges, pupil worksheets to guide students...

Pages