Basics of Hashing

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-03-data-structures-and-algorithm/hashing/hashing-basics-functions/asset-basics-of-hashing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture provides an introduction to hashing, a data structure technique designed to optimize search operations. The instructor begins by contextualizing hashing within the broader scope of data structures, noting that while storage is the primary goal, search is the most frequent operation. He reviews the search complexities of various structures, such as O(n) for unsorted arrays and O(logn) for sorted arrays and AVL trees. The core of the lecture defines hashing as a method to achieve constant time O(1) search by mapping keys directly to memory addresses. It concludes by defining hash functions and introducing the concept of collisions, where distinct keys map to the same location, necessitating collision resolution strategies. The lecture sets the foundation for understanding how hashing improves efficiency over traditional linear or tree-based searches.

Chapters

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

    The instructor starts by emphasizing that the most common operation in data structures is search, not insertion or deletion. He presents a slide listing search complexities for different structures: Unsorted array O(n), sorted array O(logn), linked list O(n), BT O(n), BST O(n), and AVL O(logn). To illustrate why these take time, he draws red diagrams next to the list. He sketches rectangular blocks for arrays and linked nodes for linked lists, showing arrows indicating a sequential traversal to find an element. He specifically crosses out 'Unsorted array' and 'BT' and 'BST' while keeping 'sorted array' and 'AVL' to contrast complexities. He underlines that search time depends on the number of elements and the structure type.

  2. 2:00 – 5:00 02:00-05:00

    The topic shifts to hashing, defined on the slide as a technique where search time is independent of the number of items. The instructor explains the basic idea: using the key itself to find the memory address. He gives examples like phone numbers, roll numbers, or Aadhar cards. A diagram shows a list of keys on the left mapping to a table of buckets in the middle. He explains that a hash function converts a key into a smaller practical number to use as an index. He highlights the text 'access the element in O(1) time' with a red circle. He also points out 'overflow entries' in the diagram, showing how extra data is handled when a bucket is full. He draws a red arrow from a key to a bucket index, illustrating the direct mapping process. He mentions that the hash function must be modified so a great deal of space is not wasted.

  3. 5:00 – 8:50 05:00-08:50

    The instructor formally defines the hash function as a conversion from a set of keys K to a set of memory locations L, written as H: K -> L. He explains that it maps a big number or string to a small integer. He then introduces 'Collision', explaining that two different keys K1 and K2 might yield the same hash address. He writes H(K1) and H(K2) on the board with arrows pointing to the same location L. He states that the technique to resolve this is called collision resolution. He draws a diagram showing n < m (keys less than locations) but notes collisions can still happen. He underlines the definition of collision on the slide. He explains that even if the number of keys is less than the number of locations, collisions are possible.

The lecture effectively bridges the gap between traditional data structures and hashing. It starts by establishing the problem: search operations in structures like arrays and trees are not constant time. It then proposes hashing as the solution, offering O(1) access. The instructor details the mechanism of hash functions and the inevitable issue of collisions, setting the stage for learning how to handle them. This progression moves from problem identification to solution definition and finally to the specific challenges of the solution, providing a comprehensive overview of the hashing concept.

Loading lesson…