1. Computer Science
We use computers, but the focus is on applied problem solving.
One of my favorite videos talks about computer science
6/3/14

2. Sign up to be a mentor.
$200 stipend
6/3/14

3. In English, if you were asked to give a definition of a fern, the following would be frowned upon: fern: a flowerless plant that has feathery or leafy fronds in the shape of a fern In computer science, we love the self-definition!
6/3/14

4. Self Similarity In Nature
Ever noticed that within a fern's leaf or in a snowflake, the same branching pattern occurs at different spatial scales? These same self-similar patterns exist in mathematics and in many powerful computer science algorithms.

5. 6/3/14

6. 6/3/14

7. Finding the self-definition takes some practice
Finding the self-definition takes some practice. See if you can arrange the shapes you have been given into a bigger figure of the same shape – self-similar. Here is one example. Notice that the two smaller triangles form a bigger triangle of the same shape.
6/3/14

8. Were you able to make the similar shapes?
6/3/14

9. Self Similarity In Nature
Symmetry- Bilateral
Many mathematical principles are based on ideals, and apply to an abstract, perfect world. This perfect world of mathematics is reflected in the imperfect physical world, such as in the approximate symmetry of a face divided by an axis along the nose. More symmetrical faces are generally regarded as more aesthetically pleasing.

10. Another recursive algorithm
ffgdgfdddddddfsfsdfsdfsfdsdfsddddddddddd
6/3/14

11. 6/3/14

12. 6/3/14

13. Algorithms (steps for solving a problem) are sometimes self-similar Consider this problem: After graduation, you are asked to design a system for breaking a chocolate bar into small chunks. How many steps are required to break an m × n sized bar of chocolate into 1 × 1 pieces?  You can break an existing piece of chocolate horizontally or vertically.  You cannot break two or more pieces at once (so no cutting through stacks).
Notice how the problem is self similar. If the problem is called “break(m,n)” define the problem for me recursively.
6/3/14

14. How many breaks does it take for a bar with m rows and n columns
How many breaks does it take for a bar with m rows and n columns? What is the optimal way to break it? Let’s use the think-pair-share technique. Come up with your own solutions, compare with a neighbor, and then share with the group.
6/3/14

15. Towers of Hanoi – another recursive problem
6/3/14

16. The boxes
There are three boxes. One is labeled "APPLES" another is labeled "ORANGES". The last one is labeled "APPLES AND ORANGES". You know that EVERY BOX is labeled incorrectly. You may ask me to pick one fruit from ONLY one box which you choose. How can you label the boxes correctly?
6/3/14

17. Flipping Coins
There are twenty coins sitting on the table, ten are currently heads and tens are currently tails. You are sitting at the table with a blindfold and gloves on. You are able to feel where the coins are, but are unable to see or feel if they heads or tails. You must create two sets of coins. Each set must have the same number of heads and tails as the other group. You can only move or flip the coins, you are unable to determine their current state. How do you create two even groups of coins with the same number of heads and tails in each group?
6/3/14