Hash Tables and Hash Functions
This computer science video describes the fundamental principles of the hash table data structure which allows for very fast insertion and retrieval of data. It covers commonly used hash algorithms for numeric and alphanumeric keys and summarises the objectives of a good hash function. Co
From playlist Data Structures
Get the Code Here: http://goo.gl/srwIf Welcome to my Java Hash Table tutorial. A Hash Table is a data structure offers fast insertion and searching capabilities. The negative is that they are limited in size because they are based on arrays. They are also hard to order. People get confus
From playlist Java Algorithms
Data structures: Introduction to Trees
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described tree data structure as a logical model in computer science. We have briefly discussed tree as a non-linear hierarchical data structure, i
From playlist Data structures
Stack Data Structure - Algorithm
This is an explanation of the dynamic data structure known as a stack. It includes an explanation of how a stack works, along with pseudocode for implementing the push and pop operations with a static array variable.
From playlist Data Structures
Hash tables in 4 minutes. Code: https://github.com/msambol/youtube/blob/master/data_structures/hash_table.py Sources: 1. https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844 2. https://wiki.python.org/moin/TimeComplexity 3. https://stackoverflow.com/questions/20612
From playlist Data Structures // Michael Sambol
A #database #index is a data structure that improves the speed of data retrieval operations on a database table at the cost of additional writes and storage space to maintain the index data structure. Indexes are used to quickly locate data without having to search every row in a database
From playlist Database
What Lies Beneath - A Deep Dive Into Clojure's Data Structures - Mohit Thatte
Immutable, persistent data structures are at the heart of Clojure's philosophy. It is instructive to see how these are implemented, to appreciate the trade-offs between persistence and performance. Lets explore the key ideas that led to effective, practical implementations of these data st
From playlist Clojure, Lisp
Clojure Data Structures Part 2 - Rich Hickey
Part 2 of an informal introductory talk/screencast covering Clojure's data structures by Rich Hickey, the author of Clojure. Covers numbers, symbols, keywords, lists, vectors and maps.
From playlist Clojure, Lisp
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed binary tree in detail. We have talked about different types of binary tree like "complete binary tree", "perfect binary tree" and "balance
From playlist Data structures
Would you like to forget about the database? by Jesse Cooke
Help us caption & translate this video! http://amara.org/v/FGiQ/
From playlist Cascadia Ruby 2012
React.js Conf 2015 - Immutable Data and React
Lee Byron, Facebook Immutable data unlocks powerful memoization techniques and prohibits accidental coupling via shared mutable state. It's no accident that these are the the same benefits provided by React. Persistent data structures provide the benefits of immutability while maintainin
From playlist Development
Clojure for Java Programmers Part 2 - Rich Hickey
Part 2 of a presentation by Rich Hickey to the NYC Java Study Group. A gentle introduction to Clojure, part 2 focuses on Java integration, functional programming, persistent data structures and concurrency.
From playlist Clojure, Lisp
Ruby Conf 12 - Allow me to reintroduce myself, my name is MagLev by Jeese Cooke
Remember when Avi Bryant spoke at RailsConf '07 about Ruby's future, and how it'd be slick if we could get to where Smalltalk was 30 years ago? Well, we kinda have, in some respects, with the 1.0 release of MagLev, a Ruby implementation running on a Smalltalk VM. What makes MagLev really
From playlist Ruby Conference 2012
RubyConf 2015 - Changing the Unchangeable... by Brad Urani
Changing the Unchangeable: The Hows and Whys of Immutable Data Structures by Brad Urani Immutable data structures give us peace of mind, but using them is challenging. How do you build an immutable list? Why would you use one? Join us and learn what makes a data structure "persistent", th
From playlist RubyConf 2015
Association: Principles and Design
For the latest information, please visit: http://www.wolfram.com Speaker: Mark Sofroniou Association is a new data structure in Mathematica 10 that provides a new way of storing and organizing information. This talk discusses the fundamental design and gives a comparison with other data
From playlist Wolfram Technology Conference 2014
Ruby Conference 2008 - Ruby Persistence in MagLev
By: Bob Walker, Allan Ottis Help us caption & translate this video! http://amara.org/v/GH3J/
From playlist Ruby Conference 2008
Binary Tree 1. Constructing a tree (algorithm and pseudocode)
This is the first in a series of videos about binary trees. It is an explanation of the dynamic data structure known as the Binary Tree. It describes the way in which a binary tree is constructed, and how it can be represented numerically using a system of left and right pointers. This v
From playlist Data Structures
!!Con 2016 - They're functional! They're efficient!! By Anjana Vakil
They're functional! They're efficient!! They're persistent data structures!!! By Anjana Vakil Functional programming is a cool paradigm to work in, because avoiding mutable objects can save you a lot of headaches! But when you're using only immutable objects, you have to create a new obje
From playlist !!Con 2016