Mosaic Freeschool

  • Home
  • Classes
    • Classes '22-'23
    • Past Classes
  • Facilitators
    • Mosaic Facilitators
    • Educator Network
  • Enroll
    • Admissions
    • Registration
    • Payment
  • Contact
  • Opportunities
  • Home
  • Classes
    • Classes '22-'23
    • Past Classes
  • Facilitators
    • Mosaic Facilitators
    • Educator Network
  • Enroll
    • Admissions
    • Registration
    • Payment
  • Contact
  • Opportunities

Mosaic Minutes

Computer Science Unplugged Class Summary 11/4/13

11/5/2013

 
with Leigh Ann Yoder

Searching and Sorting!

Picture
Today we quickly recapped our Searching Algorithm lesson from last week which demonstrated Linear Searching. Next, we played two more Battleship games illustrating new algorithms. The first was a Binary Search, similar to one of the fairy tales read for homework. The students easily identified that this method is always better than a linear search, but requires the data to be sorted first. The last Battleship game illustrated Hashing. Quickly, students discovered hashing can be much more efficient than a binary search, yet they also recognized that there could be instances when hashing is no better than a linear search. We briefly discussed Hash Tags (#), and everyone should now have a basic understanding. 

Using the example of a grocery store check out, we discussed the various searching algorithms. It became clear to the students why an efficient search is necessary. No one wants to stand at the checkout line waiting 10 seconds for each item to scan. It is not necessary for students to memorize these different algorithms. I want them to have familiarity and to understand that computer scientists have a variety of algorithms to choose from, and often they will use a combination of algorithms based on the application.

After identifying that searching methods are much more efficient if the data is first sorted in some order, we moved on to our next topic: Sorting Algorithms. First, we discussed the many applications that require organized data and how we use it every day. Students gave examples such as their music being organized, emails, documents, and phone numbers.

We used eight film canisters filled with different amounts of salt and a simple balance to sort the canisters from lightest to heaviest to explore sorting algorithms. The students worked in pairs, acting as the computer. Working in an organized manner, we used the Selection Sort Algorithm and the Quicksort Algorithm. Of course, they easily identified the Quicksort as more efficient. 

Using human volunteers, we also did class demonstrations of Insertion Sort and Bubble Sort. I explained to the class that there are other sorting algorithms available to computer scientists, and often combinations can be used for different data sets. Again, memorization is not expected, just familiarity.


Comments are closed.

    RSS Feed

    Categories

    All
    Afternoon Enrichment
    Closures
    Clubs
    Early Elementary
    Mosaic Texas
    Odyssey Of The Mind
    Out Of This World
    Philosophy
    Tesserae Fall 2012
    Tesserae Fall 2013
    Tesserae Fall 2014
    Tesserae Spring 2013
    Tesserae Spring 2014
    Tesserae Spring 2015
    Tesserae Spring 2016

    Archives

    May 2016
    April 2016
    March 2016
    February 2016
    June 2015
    May 2015
    April 2015
    March 2015
    February 2015
    January 2015
    December 2014
    November 2014
    October 2014
    September 2014
    July 2014
    June 2014
    May 2014
    April 2014
    March 2014
    February 2014
    January 2014
    December 2013
    November 2013
    October 2013
    September 2013
    July 2013
    May 2013
    April 2013
    March 2013
    February 2013
    January 2013
    December 2012
    November 2012
    October 2012
    September 2012
    August 2012

Powered by Create your own unique website with customizable templates.
Photos used under Creative Commons from nojhan, Clay Gilliland, mynameisharsha, kim siciliano salem, matthewvenn, photogirl7.1, El Bibliomata, ~Brenda-Starr~, Anne Worner, Heather Bickle, NASA Goddard Photo and Video, Black.Dots., marta.b, Felipe Venâncio, A. Galassi, bibliojojo, Bibliothèque - Les Champs Libres - Rennes, Robert Hensley, opensourceway, Greenland Travel, est1996x, John-Morgan, camnjeanacess, plindberg, chrisjtse, Vox Efx, philosophygeek, utpala ॐ, Cea., Phil Roeder, andreazgarcia, stevecadman, laynasaur, Steve A Johnson, mattk1979, Tattooed Hippy, spacepleb, Mateus Hidalgo, Todd Binger, TRF_Mr_Hyde, ComputerHotline, Hampshire and Solent Museums, Ben Sutherland, philip_sheldrake, WeeLittlePiggy, echiner1, gruntzooki, emmeffe6, saoire, symphony of love, ups2006, Dave_B_, bobsfever, Kelly Short6, RichardBH, frau-Vogel, Skype Nomad, giopuo, Tomi Tapio