Collision Resolution Technique

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/data-structure-algorithms/hashing/hashing-basics-functions/asset-collision-resolution-technique after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. 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, Run Time Environment
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture focuses on collision resolution techniques within hash tables, specifically introducing Open Addressing, also known as Closed Hashing. The instructor explains that in this approach, all elements are stored directly inside the hash table itself. When a collision occurs, it is resolved by probing, which involves searching through alternate locations in the hash table in a particular sequence until an empty slot is found. A crucial constraint highlighted is that the size of the table must be greater than or equal to the total number of keys. The session concludes by identifying three specific types of probing methods used in this technique: linear probing, quadratic probing, and double hashing.

Chapters

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

    The instructor begins by displaying the slide title "Collision resolution technique" and the bullet point "Open Addressing/closed hashing." He defines the method where "all elements are stored in the hash table itself." He explains that collision is resolved by "probing" or searching through alternate locations. To illustrate this, he draws a vertical rectangle representing the hash table on the screen. He writes "K1" inside one of the slots to represent a stored key. He further explains the search process: "we one by one examine table slots until the desired element is found." He stresses the requirement that "at any point, size of table must be greater than or equal to total number of keys."

  2. 2:00 – 2:41 02:00-02:41

    The instructor moves to the final bullet point listing the types of Open Addressing: "linear probing, quadratic probing, double hashing." He underlines these three terms on the slide to emphasize them. He draws a squiggly line next to the hash table diagram to visually represent the sequence of probing. He circles the text "linear probing" while explaining the concept. The visual focus remains on the hash table diagram and the underlined text as he transitions into discussing these specific probing strategies.

The video provides a structured introduction to Open Addressing, moving from the general definition and constraints to the specific types of probing. The instructor uses both textual definitions and hand-drawn diagrams to clarify how collisions are handled by searching for alternate slots within the table itself.

Loading lesson…