Australian Magician's Dream
Made up of two complementary activities, these resources from the CS4FN team go deeper into theory about search algorithms.
The first activity involves the teacher leading a magic trick using some normal playing cards. In the subsequent explanation of the trick, students are asked to consider the pseudocode description of the algorithm used. They learn about abstraction while simplifying the situation.
The trick employs a special ‘deal’ that reflects algorithms developed for searching through punched cards. This uses the properties of binary numbers to ‘divide and conquer’ from a large set to a single, predictable, result.
This activity builds on basic knowledge of search algorithms, and would helpfully develop student understanding ready for more complex algorithmic thinking.
The second activity – punch-card sorting – follows on, and makes use of a set of punch cards (provided). Using the same deal as demonstrated in the previous activity, any card can then be found. The importance of binary numbers in this algorithm is demonstrated and explained in logical terms.
A range of follow-on activities is suggested, as is some further reading.
Show health and safety information
Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.
You might also like
|Age||11-14, 14-16, 16-19|
|Published||2010 to date|
Share this resource
This resource is part of Computer Science for Fun
- Computer Science for Fun
- Australian Magician's Dream