Double Hashing

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/data-structure-algorithms/hashing/open-addressing-probing/asset-double-hashing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
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

  1. 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. 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.

Loading lesson…