Thank You Sherol!!!

I would like thank Sherol for being our teacher and helping us to have such an experience. It was an amazing experience for me even though I knew most of the topics before. I had to chance to collaborate with amazing people around the world and meet with you. I would like to keep in contact with you after the camp if possible. Thank you for all your help! 


In class, we were introduced to the famous Travelling Salesman Problem (which is NP-hard) and were even given a basic scaled down version of it to path.


My partner and I used an algorithm which checks for the closest point at every step. However, this is not the optimal approach and doesn’t always find the shortest path.


Here’s the link


Proposal for Final Project

1) What is the prototype about?

An application to demostrate the basic concepts of newtonian mechanics using animations and user interactions.

2) What will people learn from the experience?
People will have learnt Kinematics – Newtons Laws of Motion and Work and Energy at the end of this experience.

3) Will it be interactive or is it something people will watch? If interactive, what can the user do?
Students will be able to interact with values such as velocity, acceleration or mass to observe how changes in these concepts actually affect the way objects move.

4) How would your design fit in with the Exploratorium?
Exploratorium had lots of physics projects, most commonly on motion. This program will give students who are relatively new to Newtonian Mechanics an intuitive idea of how Kinematics works.

Stone Librande

I would like to give Stone Librande a huge thank you for visiting our class and showing us how game designing works. It was very interesting to see what a game designer actually did. I didn’t really know the difference between them and artists. Also the way they work was very interesting to see with all the board games and sketches.

Alan Turing

Alan Turing is a mathematician, computer programmer and a runner who lived between 1912 and 1954.  He is also known as the “Father of Theoretical Computer Science and Artificial Intelligence”


In 1950 Turing proposed an experiment which is also know as Turing Test today. The experiments works with a computer interface where you speak with 3 people. One of them is a computer but you don’t know who it is. When you end asking questions you pick the person who you think is the computer. Him self put a target that %30 of participants to the won’t be able to differentiate real people and computers in 2010. In 2014 his target was achieved when an artificial intelligence managed to trick 33 percent of participants.

Data Structures


Arrays are data structures that you create with a limited capacity of places. You are able to call, use, modify any value on a array at any time.



Stacks have a last in first served system. When a new item is added to a stack you can only use that items properties.



Queues work in a opposite way of stacks. First one to come in a line gets served first. Their properties are only accessible from the outside first.


Data structures most commonly used for sorting or putting items on an order. Its called a tree because of its up side down tree looks.