Double Hashing
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a comprehensive introduction to Double Hashing, a collision resolution technique used in hash tables with open-addressing. The instructor, Sanchit Jain Sir, explains that double hashing uses a secondary hash of the key as an offset when a collision occurs. He contrasts this with linear and quadratic probing, noting that in double hashing, the interval depends on the data, which minimizes repeated collisions and clustering. The instructor writes the probe sequence formula $h_i(k) = (h_1(k) + i \cdot h_2(k)) \pmod m$ on the screen. He defines $h_1(k)$ as the primary hash function and $h_2(k)$ as the secondary hash function. He specifies that $h_1$ maps to $[0, |T|-1]$ and $h_2$ maps to $[1, |T|-1]$. The variable $i$ represents the probe number, starting from 0. The lecture emphasizes that $h_1$ and $h_2$ should be independent and uniform to approximate a random distribution. The slide text further explains that pair-wise independent hash functions yield a probability of $(h_1/|T|)^2$ that any pair of keys will follow the same bucket sequence.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces Double Hashing, writing the formula $h_i(k) = (h_1(k) + i \cdot h_2(k)) \pmod m$ on the screen. He explains that unlike linear probing, the step size is determined by a second hash function $h_2(k)$. He writes $i=0, 1, 2$ to demonstrate the iteration. The slide text defines the technique and mentions minimizing repeated collisions. He details the ranges for $h_1$ and $h_2$ as $[0, |T|-1]$ and $[1, |T|-1]$ respectively. He also mentions that $h_1$ and $h_2$ are selected from a set of universal hash functions.
2:00 – 2:10 02:00-02:10
The instructor concludes the explanation of the formula's components. He highlights the independence of the hash functions to ensure a random distribution. He mentions that pair-wise independent hash functions yield a probability of $(h_1/|T|)^2$ that any pair of keys will follow the same bucket sequence, ensuring minimal clustering. He reiterates that this method approximates a random distribution effectively.
The lesson progresses from a high-level definition of double hashing to a detailed breakdown of its probe sequence formula. By writing the equation $h_i(k) = (h_1(k) + i \cdot h_2(k)) \pmod m$, the instructor clarifies how the secondary hash function determines the step size, effectively solving the primary clustering issues found in linear probing. The constraints on the ranges of $h_1$ and $h_2$ are crucial for ensuring that the entire table is probed.

