Collision Resolution Technique

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/LTI-MINDTREE-PREPARATION/data-structures/hashing/hashing-basics-functions/asset-collision-resolution-technique after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. English Comprehension/Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Vocabulary, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Conjunction, Pronoun, Noun, Adjectives, Adverb, Modals, Cloze Test (Cloze Passage), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  2. Logical Ability: Coding Decoding, Directions (Direction Test), Analogy, Inequality, Data Sufficiency, Series (Number and Letter Series) (Numerical Relations and Reasoning), Syllogisms, Seating Arrangements, Puzzle Solving (Puzzles), Blood Relations, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Data Arrangement, Venn Diagram, Calendar, Clock
  3. Quantitative Ability: Logarithm, Permutation and Combination, Probability, Profit and Loss, Speed Time and Distance, Mixture and Alligation, Partnership, Simple Interest and Compound Interest, Percentage, Ratio and Proportion (Ratios), Average, Time and Work, Pipe and Cistern, Number System, Divisibility Rules, HCF LCM, Algebra, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Age Problems, Data Interpretation, Sequence and Series (Series)
  4. Basic Analytical Ability: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Selection Decision Table (Decision Making)
  5. Computer Programming: Pseudo Codes, Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. DBMS (Computer Science): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Concurrency Control, Database Security & Authorization
  7. SQL (Computer Science): SQL
  8. OS (Computer Science): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Process Synchronization, Threads & Process Creation, Memory Management, Virtual Memory, File Management
  9. Computer Networks (Computer Science): 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
  10. Data Structures (Computer Science): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. OOPs (Computer Science): Object Oriented Programming (OOPS)
  12. Software Engineering (Computer Science): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. SVAR Conversational - Spoken English: Communication Assessment
  14. HR Interview: MR & HR Interview Preparation
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…