Algorithms Workshop

On October 4th, we hosted our Algorithms workshop at the Pacific Beach Library. 
To begin, the participants learned how to simply define an algorithm and learned the applications of algorithms in their everyday lives (ex: GPS, auto-picking music, etc.). After the mini-lecture, the participants wrote their own algorithm to help their jack-o-lantern escape the given maze and collect candy. They collaborated in groups and worked together to find the most specific/correct solution after their algorithm was tested by volunteers. Reflecting on the sense of camaraderie formed with their group-mates, one participant said “I liked writing the algorithms with my friends and saying yay everytime we got a candy”. 

Next, the participants learned about arithmetic and geometric sequences. They learned that the key difference between the two was that arithmetic sequences increase by the same number, but geometric sequences increase by a greater/lesser number each time. They filled out worksheets that had missing terms in arithmetic sequences and geometric sequences. However, the participants had the most fun when they got to create their own geometric/arithmetic sequences with missing terms for the volunteers to solve. 

Afterwards, the participants enjoyed a snack break with the classic AGSS cookies and bananas. 

Then, the participants had another mini-lecture about recursive sequences (each term in a sequence is defined by the previous term). Specifically, the participants learned about the Fibonacci sequence, where each term is defined as the sum of the previous two terms. For the activity, participants created their own fibonacci spiral with different colored m&ms. 

Later, the participants learned about different searches. They learned that a linear search was that the computer checks each card individually to see if the card is the desired target card. They learned that a binary search was that the computer picks the middle card and depending if the target card is higher or lower, the computer picks the middle card of that set (assuming the cards are from lowest to highest). They also learned about the selection sort. The selection sort finds the smallest element and swaps it with the first element in the list. 
​
Overall, our participants had a lot of fun. Our next workshop is in November. We hope to see you there!