Chaining

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/data-structures/hashing/chaining-perf-analysis/asset-chaining after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces the concept of Chaining in hash tables, defining it as a method where each cell of the hash table points to a linked list of records sharing the same hash function value. The instructor highlights that while Chaining is simple to implement, it requires additional memory outside the table. The session concludes with a detailed comparison table contrasting Separate Chaining with Open Addressing across seven distinct parameters, including implementation complexity, table capacity, sensitivity to load factors, and cache performance, providing a comprehensive overview of collision resolution strategies.

Chapters

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

    The instructor defines Chaining using on-screen text: "The idea is to make each cell of hash table point to a linked list of records that have same hash function value." He draws a diagram showing a hash table cell pointing to a linked list of nodes. He underlines the advantage "Chaining is simple" and the disadvantage "requires additional memory outside the table." He visually demonstrates how multiple records can be chained together from a single hash table index, drawing boxes and arrows to represent the linked list structure extending from the table.

  2. 2:00 – 2:40 02:00-02:40

    A comparison table appears with columns "Separate Chaining" and "Open Addressing." The instructor reviews seven points, placing red checkmarks next to statements like "Chaining is Simpler to implement" and "In chaining, Hash table never fills up." He discusses cache performance, noting chaining is "not as good as keys are stored using linked list" while Open Addressing provides better performance. He also mentions that Chaining is less sensitive to hash function or load factors, whereas Open Addressing requires extra care to avoid clustering. He further explains that Chaining is used when the frequency of keys is unknown, while Open Addressing is used when it is known. He also points out that Chaining uses extra space for links, whereas Open Addressing has no links.

The lesson progresses from a fundamental definition and visual representation of Chaining to a structured comparative analysis against Open Addressing, helping students understand the trade-offs between the two collision resolution strategies. By examining specific criteria like space usage and cache performance, the instructor clarifies when to use each method effectively in different scenarios.

Loading lesson…