Play the game of 20 questions and demonstrate how to devise efficient search algorithms.
Show the audience they already instinctively know the key to efficient searching and the basis of divide and conquer problem solving and have done since primary school.
- computational thinking
- linear search
- binary search
- divide and conquer
- comparing algorithms
This session comes with linked activity sheets and ‘story’ write-ups that you can download:
- Activity: 20 Questions [PDF]
- Booklet: Computational Thinking: Searching to Speak [PDF]
- Slides: Searching To Speak [PDF]
This activity can be used alone but naturally combines with the Locked-in activity