Hashing and Hash Tables

Tutorials on Hashing and Hash Tables


Perfect Hashing – How it Works

This is used when the keys stored in the hash table are expected to be static. In this case perfect ...
Read More

Linear Probing, Quadratic Probing and Double Hashing

The three terms that make up the title of this article are the three common techniques used for computing hash ...
Read More

Hashing With Open Addressing

Today we are going to examine Open Addressing. Recall that the two methods of resolving collisions in a hash table are: ...
Read More

Universal Hashing – An Clear Explanation

We would cover the following topics on Universal Hashing Introduction to Universal Hashing What is Universal Hashing How Universal hashing ...
Read More

Search Time Under Simple Uniform Hashing

We are going to examine the time it takes for successful and unsuccessful search in a hash table where collision ...
Read More

Hash Tables – Hashing With Chaining

Hashing With Chaining. In the discussion of direct addressing, we see that for a fairly small-size universe U, we can ...
Read More

Introduction to Hash Tables and Direct Addressing

We would cover the following: Introduction to Hash Tables Arrays vs Hash Tables Direct-Address Tables Watch the Video on Hashing ...
Read More

Bloom Filters – A Clear Explanation of How They Work

We would cover the following: Introduction to Bloom Filters Applications of Bloom Filters How Bloom Filters Work Bloom Filter Setup ...
Read More

How Cuckoo Hashing Works

The Cuckoo hashing algorithm allows for lookup of items at constant time, O(1). We would cover the following in this ...
Read More

Other Computer Science Topics

Conditional Probability – Application of Bayes’s Rule

In the previous lesson(Introduction to Bayes’ Rule), we saw how ...
Read More

Conditional Probability – Introduction to Bayes’ Rule

Bayes Rule is based on Conditional Probability which we have ...
Read More

Conditional Probability – Law of Total Probability

In this lesson, we would examine Law of Total Probability ...
Read More

Conditional Probability – Multiplication Law

In this short lesson we would understand how to use ...
Read More

Conditional Probability – Basics

I assume you have a basic knowledge of Probability. For ...
Read More

Skip Lists and How They Work

A skip list is an efficient data structure  that arranges ...
Read More

Perfect Hashing – How it Works

This is used when the keys stored in the hash ...
Read More

Linear Probing, Quadratic Probing and Double Hashing

The three terms that make up the title of this ...
Read More

Hashing With Open Addressing

Today we are going to examine Open Addressing. Recall that the ...
Read More

Universal Hashing – An Clear Explanation

We would cover the following topics on Universal Hashing Introduction ...
Read More

Search Time Under Simple Uniform Hashing

We are going to examine the time it takes for ...
Read More

Hash Tables – Hashing With Chaining

Hashing With Chaining. In the discussion of direct addressing, we ...
Read More

Introduction to Hash Tables and Direct Addressing

We would cover the following: Introduction to Hash Tables Arrays ...
Read More

Recurrences in Divide and Conquer Algorithm

The divide and conquer class of algorithm solves a problem ...
Read More

Bloom Filters – A Clear Explanation of How They Work

We would cover the following: Introduction to Bloom Filters Applications ...
Read More

How Cuckoo Hashing Works

The Cuckoo hashing algorithm allows for lookup of items at ...
Read More

Network Flow – Introduction to Cuts in a Network

The concepts of cuts in a network is a way ...
Read More

The Ford-Fulkerson Algorithm

We now present the Ford-Fulkerson algorithm and a simple explanation ...
Read More

Ford-Fulkerson Algorithm for Max Flow Problem

We cover the following Introduction to Ford-Fulkerson Algorithm Introduction to ...
Read More

Introduction to Network Flow

In this article on flow networks, we would cover the ...
Read More