Listing all results (3)

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...

Intermediate Programming with LiveCode

A series of eleven guided tasks with LiveCode for students with some prior experience, based on the full software development cycle.

Variables and arrays are assigned using keyboard input, logic and maths calculations are carried out and the results displayed in a simple user interface.

Each task...

Advanced Programming with LiveCode

This series of lessons and exercises covers more advanced programming concepts and techniques. Pseudocode is used within the full development cycle to aid understanding of event-driven programs. Variables are covered in-depth, and a range of loops and selection statements are used for flow of control. Complex array...

View all publishers