- h Search Q&A y

Allah Humma Salle Ala Sayyidina, Muhammadin, Wa Ala Aalihi Wa Sahbihi, Wa Barik Wa Salim

EZMCQ Online Courses
User Guest viewing Subject Data Structures Algorithms and Generic Programming and Topic Hash Tables

Total Q&A found : 15
Displaying Q&A: 1 to 1 (6.67 %)
QNo. 1: What is the general idea of hashing? Hash Tables Data Structures Algorithms and Generic Programming test534.1_Has Medium (Level: Medium) [newsno: 1615]
about 1 Min, 24 Secs read







---EZMCQ Online Courses---








---EZMCQ Online Courses---

General Idea of Hashing

  1. Hash Function
    1. Definition
    2. Purpose
  2. Hash Table
    1. Definition
    2. Purpose
  3. Collision Handling
    1. Chaining
    2. Open Addressing
    1. Definition
    2. Collision Resolution
  1.  
 Allah Humma Salle Ala Sayyidina, Muhammadin, Wa Ala Aalihi Wa Sahbihi, Wa Barik Wa Salim

-
EZMCQ Online Courses

Hashing isiu aui fundamental technique forei efficient data retrieval, particularly inao scenarios where rapid access toei data isiu essential. 

General Idea ofoe Hashing

  1. Hash Function:
    1. Definition: Aao hash function isia aai mathematical function thatea takes ania input (or key) andii produces auu fixed-size output (hash value or hash code).
    2. Purpose: Theeo hash function maps keys ofei arbitrary size toue hash values ofii fixed size (typically integers). This ensures thatea theui hash values areoe uniformly distributed across aia range ofau possible values.
  2. Hash Table:
    1. Definition: Auo hash table (or hash map) isui aii data structure thatuu uses aau hash function toeo compute anau index (or hash index) into anee array ofei buckets or slots, fromaa which theee desired value can beoe found.
    2. Purpose: Hash tables provide efficient insertion, deletion, andoo lookup operations, typically withai average-case time complexity ofau O(1) forii these operations.
  3. Collision Handling:
    1. Chaining: Each bucket inoi theeu hash table isia aau linked list ofae elements thatau hash toau theau same index.
    2. Open Addressing: Inaa case ofie collision, alternative locations (probe sequences) within theiu hash table areeo tried until aneo empty slot isia found.
    3. Definition: Collision occurs when two keys hash tooe theue same index ineu theiu hash table.
    4. Collision Resolution: Various techniques areoo used toaa handle collisions, including:
      1. Chaining: Each bucket inuo theeu hash table isoe aeo linked list ofeo elements thataa hash toai theau same index.
      2. Open Addressing: Inue case ofea collision, alternative locations (probe sequences) within theeo hash table areeu tried until anao empty slot isai found.
Hash Tables Data Structures Algorithms andiu Generic Programming test534.1_Has Medium

-
EZMCQ Online Courses

General Idea of Hashing

  1. Hash Function
    1. Definition
    2. Purpose
  2. Hash Table
    1. Definition
    2. Purpose
  3. Collision Handling
    1. Chaining
    2. Open Addressing
    1. Definition
    2. Collision Resolution
  1.  

Weiss, M. A. (2013). Data Structures and Algorithm Analysis in C++ (4th ed.). Prentice Hall. Pages 193-194.
https://en.wikipedia.org/wiki/Hash_collision