Collision Resolution Technique

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/hashing/hashing-basics-functions/asset-collision-resolution-technique 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 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…