Basics of Hashing
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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
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: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.
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.

