- 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 Sub-topic Basics
Total Q&A found : 3
Displaying Q&A: 1 to 1 (33.33 %)
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 isuo aao fundamental technique forua efficient data retrieval, particularly inuo scenarios where rapid access tooa data isei essential. 

General Idea ofee Hashing

  1. Hash Function:
    1. Definition: Aau hash function isau aeu mathematical function thatoo takes aneu input (or key) andiu produces aeo fixed-size output (hash value or hash code).
    2. Purpose: Theoo hash function maps keys ofeu arbitrary size toai hash values ofuu fixed size (typically integers). This ensures thatoa theeu hash values areaa uniformly distributed across aoe range ofue possible values.
  2. Hash Table:
    1. Definition: Aoi hash table (or hash map) isae auu data structure thateo uses aui hash function toai compute anii index (or hash index) into anio array ofao buckets or slots, fromei which theau desired value can beaa found.
    2. Purpose: Hash tables provide efficient insertion, deletion, anduo lookup operations, typically withae average-case time complexity ofue O(1) foroe these operations.
  3. Collision Handling:
    1. Chaining: Each bucket inue theai hash table isia aiu linked list ofai elements thatau hash tooo theuo same index.
    2. Open Addressing: Inii case ofuo collision, alternative locations (probe sequences) within theou hash table areie tried until anuo empty slot isaa found.
    3. Definition: Collision occurs when two keys hash toei theoi same index inua theoe hash table.
    4. Collision Resolution: Various techniques areii used toai handle collisions, including:
      1. Chaining: Each bucket inoa theoe hash table isuu aii linked list ofou elements thateo hash tooi theue same index.
      2. Open Addressing: Inue case ofai collision, alternative locations (probe sequences) within theoa hash table areui tried until aneo empty slot isie found.
Hash Tables Data Structures Algorithms andio 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