Wednesday, 21 September 2011

Fri 23rd Sep – Dijkstra’s Algorithm

LEARNING OBVJECTIVE: TO Assimilate the steps in Dijkstra's algorithm and apply them to solve real life problems

SUCCESS CRITERIA: You will be able to use Dijkstra's algorithm to find solutions to 'Shortest Path' problems on Distance Network.

LESSON 1: Work through the first three screens of this Lesson. Use the printouts of screens 4, 5 6 and 7 to give students an opportunity to try applying the algorithm themselves step by step, using the onscreen verision as checks to their progress.

Use screen 8 to Summarise the first stages of using Dijkstr'a Algorithm

PLENARIES: Checking their progress with onscreen working of the problems set.

LESSON: 2

Work through the second stages of Dijkstra's algorithm, so we can find the route of the shortest path.

PLENARIES: Checking their progress with onscreen working of the problems set.

HOMEWORK: Ex 3b, 3c and 3d = Revision on First three chapters for test next Weds

No comments:

Post a Comment