|
CSTA K-12 Repository >
CSTA Source: K-12 Repository >
Level 1: Preparation for Computer Science >
L1 G: Algorithmic problem-solving tools >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2378/260
|
| Title: | Battleships |
| Authors: | Bell, Tim
Fellows, Mike
Witten, Ian |
| Keywords: | search
linear search
binary search
hashing
no computer required |
| Issue Date: | 1998 |
| Publisher: | Computer Science Unplugged |
| Series/Report no.: | ACM Model Curriculum |
| Abstract: | 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 search, binary activity demonstrates three different search methods—linear search, binary search, and hashing—using numbered cards and the game of battleships as vehicles. No computers needed. Grades 3-5. Prior knowledge: greater, less, equal relationships, coordinates. This is activity 6 from the free book on the website. |
| Description: | Most recently published in A Model Curriculum for K–12 Computer Science: Final Report of the ACM K–12 Task Force Curriculum Committee. (Tucker et al., October 2003.) Used by permission. |
| URI: | http://hdl.handle.net/2378/260 |
| Appears in Collections: | L1 G: Algorithmic problem-solving tools
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| ACM-K12Curr-Battleships.pdf | | 37Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
