Search Results
Showing results 1 to 2 of 2
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.
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.