BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

405What is a Hash Function?
406Properties of Good Hash Functions
407Hash Function Output Range and Table Size
408The Division Method
409The Multiplication Method
410Hashing Integers
411Hashing Strings: Basic Approach
412Polynomial Rolling Hash for Strings
413Hashing Composite Keys
414Universal Hashing
415Cryptographic vs Non-Cryptographic Hash Functions
416Evaluating Hash Function Quality
417Collision Definition and Causes
418Collision Resolution Overview
419Separate Chaining: Concept
420Separate Chaining: Implementation
421Separate Chaining: Analysis
422Open Addressing: Concept
423Linear Probing
424Linear Probing: Clustering Problem
425Quadratic Probing
426Double Hashing
427Deletion in Open Addressing
428Load Factor and Rehashing
429Rehashing Process
430Comparing Collision Strategies
431Collision Resolution in Practice
432Load Factor and Its Impact on Performance
433Average-Case Time Complexity Analysis
434Worst-Case Time Complexity Scenarios
435Chaining Performance with Load Factor
436Open Addressing Performance Characteristics
437Primary and Secondary Clustering Effects
438Dynamic Resizing and Rehashing Cost
439Cache Performance and Memory Locality
440Space-Time Tradeoffs in Hash Tables
441Benchmarking and Practical Performance
442Dictionary and Set Implementations
443Caching and Memoization
444Symbol Tables in Compilers
445Database Indexing with Hash Tables
446Duplicate Detection and Deduplication
447Frequency Counting and Histograms
448Two-Sum and Complement Problems
449Implementing LRU Cache

Computer Science

405What is a Hash Function?
406Properties of Good Hash Functions
407Hash Function Output Range and Table Size
408The Division Method
409The Multiplication Method
410Hashing Integers
411Hashing Strings: Basic Approach
412Polynomial Rolling Hash for Strings
413Hashing Composite Keys
414Universal Hashing
415Cryptographic vs Non-Cryptographic Hash Functions
416Evaluating Hash Function Quality
417Collision Definition and Causes
418Collision Resolution Overview
419Separate Chaining: Concept
420Separate Chaining: Implementation
421Separate Chaining: Analysis
422Open Addressing: Concept
423Linear Probing
424Linear Probing: Clustering Problem
425Quadratic Probing
426Double Hashing
427Deletion in Open Addressing
428Load Factor and Rehashing
429Rehashing Process
430Comparing Collision Strategies
431Collision Resolution in Practice
432Load Factor and Its Impact on Performance
433Average-Case Time Complexity Analysis
434Worst-Case Time Complexity Scenarios
435Chaining Performance with Load Factor
436Open Addressing Performance Characteristics
437Primary and Secondary Clustering Effects
438Dynamic Resizing and Rehashing Cost
439Cache Performance and Memory Locality
440Space-Time Tradeoffs in Hash Tables
441Benchmarking and Practical Performance
442Dictionary and Set Implementations
443Caching and Memoization
444Symbol Tables in Compilers
445Database Indexing with Hash Tables
446Duplicate Detection and Deduplication
447Frequency Counting and Histograms
448Two-Sum and Complement Problems
449Implementing LRU Cache

← Computer Science

Lesson 442 of 2,872·10. Hash TablesPro lesson

Dictionary and Set Implementations

How hash tables provide O(1) average-case operations for implementing dictionaries, sets, and mappings in programming languages.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course