Activities | Computer Science Unplugged

Actividades

Activities | Computer Science Unplugged

The activities are primarily aimed at the five to twelve year-old age group, but they are by no means restricted to this age range: we’ve used them to teach older children and adults too, with little modification.

• Binary Numbers
• Image Representation
• Text Compression
• Error Detection
• Information Theory
• Searching Algorithms
• Sorting Algorithms
• Sorting Networks
• Minimal Spanning Trees
• Routing and Deadlock
• Finite State Automata
• Programming Languages
• Graph Colouring
• Dominating Sets
• Steiner Trees
• Information Hiding
• Cryptographic Protocols
• Public Key Encryption
• Human Interface Design
• The Turing Test
• Phylogenetics Unplugged – Unfinished
• Class Simulation of a Computer – Unfinished
• Intelligent Paper – Unfinished
• Harold the Robot – Unfinished

Blogged with the Flock Browser

Anuncio publicitario