Search Results
Showing results 1 to 2 of 2
![](/sites/default/files/styles/square_100/public/resource_images/smile-000-000-002-001.jpg?itok=Y9m4EbMl)
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.
![](/sites/default/files/styles/square_100/public/resource_images/smile-000-000-001-562.jpg?itok=tDfyVUSs)
The Orange Game: Routing and Deadlock in Networks
Source Institutions
When a lot of people share one network (such as cars using roads, or messages getting through the Internet), there is the possibility that competing processes will create a “deadlock," or an interrupt