Skip to main content

The Data Structures (You Think) You Need to Know

Tim Berglund (DataStax)
Computational Thinking
Portland Ballroom
Average rating: ****.
(4.41, 22 ratings)

If you’re like most developers, you can get through most of your projects with just lists and maps. Then every once in a while you read a blog post about a mind-blowing problems that can only be solved efficiently because of a data structure you’ve never heard of, and you wonder where long years of computer science education really got you. Or better yet, maybe you never

The world is full of interesting data structures like Merkel Trees, Bloom Filters, k-d Trees, Ropes, Tries, and just plain old heaps and graphs. Come to this talk for a fun walk through the composition, purpose, and implementation of a few of the data structures you think you need to know—and might actually be able to use!

Photo of Tim Berglund

Tim Berglund

DataStax

Tim is a teacher, author, and technology leader with DataStax. He is a conference speaker internationally and in the United States, and contributes to the Denver, Colorado tech community as president of the Denver Open Source User Group. He is the co-presenter of various O’Reilly training videos on topics ranging from Git to Mac OS X Productivity Tips to Apache Cassandra, and is the author of Gradle Beyond the Basics. He blogs very occasionally at timberglund.com, and lives in Littleton, CO, USA with the wife of his youth and their three children.

Leave a Comment or Question

Help us make this conference the best it can be for you. Have questions you'd like this speaker to address? Suggestions for issues that deserve extra attention? Feedback that you'd like to share with the speaker and other attendees?

Join the conversation here (requires login)

Comments

07/23/2014 3:10pm PDT

Unsure if it got added. So I’ll double post

Mr berlund has a very pleasing style, similar to Edd Dumbills, both add a certain sense of style to the conference.

He covers data structures competently within the time limits, I learned about a new one so it was useful for me.