Characteristics of Good hash function

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/data-structures/hashing/hashing-basics-functions/asset-characteristics-of-good-hash-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Domain Test): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational segment details the fundamental attributes required for a high-quality hash function in computer science. The presenter systematically lists key characteristics on a presentation slide. First, the function must be simple to compute and understand. Second, it needs to be efficiently computable, ensuring minimal processing time. Third, it should uniformly distribute keys across the table, preventing clustering where data accumulates in specific areas. Finally, a good hash function must maintain a low collision rate. To visualize the third point, the instructor sketches a hash table, demonstrating how clustering occurs when keys are not distributed evenly. The lecture then transitions to specific methods, introducing the division-remainder technique as a standard approach for generating hash values.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins with a slide titled Characteristics of good hash function. The instructor underlines the first two points: Easy to compute and understand and Efficiently computable. He explains that the function should take less time to compute. He then focuses on the distribution aspect, underlining Should uniformly distribute the keys. He draws a vertical red rectangle to represent the hash table slots. Initially, he fills the top portion densely to illustrate clustering, explaining this is undesirable. He then draws horizontal lines across the entire height to show how keys should be spread out so that each table position is equally likely for any given key.

  2. 2:00 – 2:57 02:00-02:57

    The content shifts to a new slide titled Most popular hash function. The text introduces the Division-remainder method. The description states that the size of the number of items in the table is estimated and used as a divisor. The formula H(K) = K (mod m) is shown, indicating the remainder is the hashed value. An alternative formula H(K) = K (mod m) + 1 is also visible. The slide notes that this method is liable to produce collisions, requiring a search mechanism to recognize and handle them. The instructor reads through these points, emphasizing the mathematical operation involved.

The lecture effectively bridges the gap between abstract requirements and concrete algorithms. By first defining what makes a hash function good through efficiency and distribution metrics, the instructor provides a framework for evaluating the division-remainder method. The visual demonstration of clustering reinforces the theoretical need for uniform distribution, making the subsequent introduction of the modulo operator a logical solution to achieve that balance.

Loading lesson…