Search Results
Showing results 1 to 4 of 4
Lightest and Heaviest: Sorting Algorithms
Source Institutions
Computers are often used to put lists into some sort of order—for example, names into alphabetical order, appointments or e-mail by date, or items in numerical order.
Treasure Hunt: Finite-State Automata
In this computer science activity about finite-state automaton (on page 45 of the PDF), learners use a map and choose various pathways to find Treasure Island.
Topological Puzzles
Source Institutions
In this activity, learners construct three math puzzles out of simple materials like wood, string, and Styrofoam.
Beat the Clock: Sorting Networks
Source Institutions
Even fast computers are limited to how quickly they can solve problems. One way to speed things up is to use several computers at once.