“What is a HashTrieStackFilter?” A Data Structures & Algorithms Refresher For Everyone

THAT Conference 2019
Day: Mon, Aug 5   Time: 8:00 AM   Duration: 4 hours   Location: TBD (map)
Level: 100  Primary Category: Data/Storage  Secondary Category: Languages
Tags: data structures, algorithms
Description
- Are you about to go into job interviews where you'll be asked technical questions?
- Have you found you don't really know the standard data structures or algorithms, or you have holes in your knowledge?
- Has it been a long time since your computer science classes and you want a review session?

In this workshop, we'll go over all the basics of standard data structures and algorithms. We'll start at the beginning with different types of lists and build up from there. We'll also cover the basics of popular algorithms and how to analyze operations of the data structure to assess a “Big O” runtime. We'll break into teams to solve some technical problems. You will leave with a wealth of knowledge and resources to help you!

(While this won't replace a whole CS degree, it's designed to give you a boost in your CS learning journey.)
Agenda
I'm still researching into the specifics of what I feel is most important to cover, but this will be the basic outline of the talk:
- Intro
- Big O (and why it's important)
- Data structures and how they compare
- Practice problem solving (choosing structure for the problem)
- Algorithms that use those structures
- More problem solving
- Sorting algorithms
- Any additional structures, algorithms, or anything else with leftover time
- Advanced data structures or algorithms (as time permits)
I feel the problem solving is important, and so after discussing a few things, I will have them pair up (or triple up) and work on things together. I hope to make this as much of an engaging and collaborative experience as I can for something that is naturally not that super exciting.
I am presenting getting this together for giving it at another conference, so by the time THAT happens, this should be very ironed out and will have been given at least once.