- View more resources from this publisherComputer Science Unplugged
Battleships - Searching Algorithms
Computers are often required to find information in large collections of data. They need to develop quick and efficient ways of doing this. This activity demonstrates three different search methods: linear searching, binary searching and hashing. This resource begins with the introductory activity of battleships. The game is then repeated to illustrate how the three different methods of searching are performed. There follows a series of extension activities and resource materials for use when playing the games. To conclude there is more information about how computers search for information. This collection of twenty activities from Computer Science Unplugged is designed to aid the teaching and learning of computer science through engaging games and puzzles using cards, string, crayons and lots of running around.
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.
Downloads
-
Battleships - searching algorithms 827.95 KB