1. Retreat Sandbjerg, November 19-20, 2007

2. Homework Session 16:30 Homework handout 16:40 Homework 19:00 Dinner 21:00 Homework presentations

3. Did you bring? +

4. Illustrate Computer Science Concepts

5. Tree

6. Rooted Tree

7. Stack

8. 16:40 - 19:00Group work (3-4 people) Each group prepares illustrations for - 3 concepts handed out - ≥ 7 fsreely selected concepts One or more pictures per concept 21:00 - ?Presentation = Quiz 2 points per concept presented Creativity bonus: +1 point Web penalty: ÷1 point 1 point for correct guess Rules

9. Groups Group 1 Allan Grønlund Jørgensen Thomas Dueholm Hansen Srinivasa Rao Group 2 Anders Hessellund Jensen Morten Revsbæk Kevin Chang Brad Nickerson Group 3 Lasse Deleuran Andreas Beckmann Henrik Blunck Group 4 Konstantinos Tsakalidis Kasper Dalgaard Larsen Deepak Ajwani Group 5 Martin Olsen Mark Greve Gabriel Moruz Oren Weimann

10. Queue Bootstrapping I/O MADALGO Cache oblivious Branch prediction Streaming Tall cache assumption Point location van Emde Boas layout Running time Disk block Recursion Root to leaf path Search tree Computational geometry Triangulation Minimum spanning tree Algorithm Lower bound Terabyte Geographic Information System (GIS) Terrain B-tree O((N/B)log M/B (N/B)) Randomized algorithm Grid Distributed computing Logarithmic method Exponential growth Hierarchical memory Algorithm engineering Nearest neighbors problem Range searching Depth first search (DFS) Priority queue Suffix tree Shortest path TPIE (Transparent Parallel I/O Environment) Topological sorting