Most Popular Hash Function

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/hashing/hashing-basics-functions/asset-most-popular-hash-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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
  15. Operating Systems: 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
  16. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture details the Division-remainder method, identified as the most popular hash function. The instructor explains that the hash table size is estimated first and then used as a divisor for each original key value. The resulting remainder is the hashed value. The slide text warns that this method is liable to produce collisions, necessitating a search mechanism to recognize and handle them. Two formulas are presented: H(K) = K(mod m) and H(K) = K(mod m) + 1. The instructor uses a whiteboard to draw a hash table and illustrate the mapping process.

Chapters

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

    The instructor begins by defining the Division-remainder method. He writes the formula H(K) = K(mod m) on the screen. He draws a large vertical rectangle to represent the hash table. He labels the top index as 0 and the bottom as 9, indicating a table size of 10. He writes 'K mod 10' next to the table and draws a triangle shape below it to represent the range of possible remainders from 0 to 9, visually mapping the math to the table. He circles the formula H(K) = K(mod m) to highlight it as the primary equation. The slide text mentions extracting a quotient and a remainder.

  2. 2:00 – 2:33 02:00-02:33

    The instructor continues to reference the drawn hash table. He points to the slots labeled 1, 2, 3, etc., showing where items would be placed. He circles the formula H(K) = K(mod m) again to reinforce the concept. He briefly gestures towards the second formula H(K) = K(mod m) + 1, explaining it as an alternative that shifts the index range by one. The visual demonstration connects the mathematical modulo operation to the physical slots in the data structure. The bottom of the screen displays 'SANCHIT JAIN SIR' and 'KNOWLEDGE GATE EDUCATOR'.

The lecture provides a clear visual and mathematical explanation of the Division-remainder method. By drawing a table of size 10 and writing 'K mod 10', the instructor concretely shows how the modulo operator restricts hash values to the valid index range. The emphasis on the formula H(K) = K(mod m) and the warning about collisions provides a complete overview of this fundamental hashing technique.

Loading lesson…