Using Advanced Data Structures in Modern Applications

Through a strong focus on intuition, examples, and real-world scenarios, you'll learn the inner workings of some very powerful data structures, and see how they can help you to both achieve great performance and solve seemingly complex problems.
Course info
Rating
(59)
Level
Advanced
Updated
Dec 27, 2017
Duration
4h 21m
Table of contents
Description
Course info
Rating
(59)
Level
Advanced
Updated
Dec 27, 2017
Duration
4h 21m
Description

Many problems in modern applications can be solved in a simple and elegant way by utilizing a specific data structure. In this course, Using Advanced Data Structures in Modern Applications, you will learn a variety of such data structures that are incredibly useful but normally outside the scope of introductory courses in programming or algorithmics. The course is loaded with examples and focuses on practicality rather than formulas and proofs. First, you will dive into the exciting world of hashing and see how different hash functions and hash table implementations perform very differently. Next, you will learn how bloom and cuckoo filters work and how they can be used to reduce communication between infrastructure components and prevent a cache from being wasted on one-off items. Then, you will discover how to efficiently index and query geographical positions and numeric properties using spatial indexing mechanisms such as geohashing, B-trees, R-trees, and M-trees. After that, you will explore the inner workings of disjoint-set data structures and see how they can be used to efficiently form clusters of related users of an application. Finally, you learn how tries and suffix trees work and how to easily build an auto-completion back-end upon them. By the end of this course, you will have a large toolbox of data structures at hand that can help you solve a number of apparently complex problems with minimal effort.

About the author
About the author

Rasmus is a software developer and architect, an entrepreneur and an idealist, with a background as PhD in the field of computer science, databases, and algorithms and with a long standing passion for teaching.

More from the author
An Introduction to Algorithmics
Intermediate
4h 3m
Mar 7, 2016
Section Introduction Transcripts
Section Introduction Transcripts

Course Overview
[Autogenerated] Hi, everyone. My name is Cosmos and welcome to my cause. Using vast spaces. Success in modern applications Data structures can be almost like Matic. They can provide elegant, simple and high performing solutions to apparently complex problems, but sometimes arise when building applications. In this cause, we're going to look at a number off extremely powerful data structures that are normally outside the scope off introductory classes in computer science. And we're going to do that from his Brickley practical perspective, with our focus on examples. Lots of examples. No mathematical approves or ____ ____ theory. Some off The major topics that will recover include bloom and crew filters, various hashing algorithms and passed saber structures, these giant said, data structures, tries and Suffolk's trees and various spatial indexes such as B trees, our trees and entries. By the end of this course, you will have seen how to put the data tractors recover in tow work, and you will have seen how would they can really make a difference before beginning the cause? You should be familiar with basic data structures such as as tapers and tree structures, and feel comfortable with some basic complexity. And Ennis's all of this is covered in my other proves that course an introduction to a grip mix. I hope you will join me on this journey to learn a bunch off interesting and useful data structures with the using at vast data structures in modern applications cause at your side.