Practice Question-1 (Chaining)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/hashing/chaining-perf-analysis/asset-practice-question-1-chaining 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.

This lecture segment addresses a GATE 2014 Computer Science problem concerning hash tables and collision resolution. The instructor presents a scenario involving a hash table with 9 slots, indexed from 0 to 8. The core task requires applying the hash function h(k) = k mod 9 to a specific sequence of keys: 5, 28, 19, 15, 20, 33, 12, 17, and 10. The problem specifies that collisions are resolved using the chaining method. Students must determine the maximum, minimum, and average chain lengths resulting from these insertions.

Chapters

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

    The instructor introduces the problem statement displayed on screen, defining a hash table with 9 slots and the modulo 9 hash function. He lists the nine keys to be inserted in order: 5, 28, 19, 15, 20, 33, 12, 17, and 10. The visual setup establishes the initial state of the table before any insertions occur, highlighting that collisions will be handled via chaining. The instructor begins demonstrating the sequential insertion process, starting with key 5 mapping to slot 5 and subsequent keys like 28 and 19 colliding at index 1, visually constructing the linked lists within the table structure.

  2. 2:00 – 2:48 02:00-02:48

    The instructor completes the insertion of all keys, showing the final configuration where slot 6 contains a chain of length 2 (keys 15 and 33) and slot 1 contains a chain of length 2 (keys 28 and 19). He calculates the specific chain lengths for all slots: slot 0 is empty (length 0), slot 1 has length 2, slot 2 has length 1, slot 3 has length 1, slot 4 is empty (length 0), slot 5 has length 1, slot 6 has length 2, slot 7 is empty (length 0), and slot 8 has length 1. The instructor then computes the maximum chain length as 2, minimum as 0, and average by summing lengths to 9 and dividing by 9 slots, yielding an average of 1. He evaluates the multiple-choice options (A) through (D) to select the correct answer based on these calculated values.

The lecture demonstrates a practical application of hash table theory using chaining for collision resolution. The key takeaway is the systematic calculation of chain lengths after inserting a fixed set of keys using a modulo hash function. The problem requires careful tracking of each key's index to identify collisions and build the correct linked lists. By summing the lengths of all chains (which equals the total number of keys, 9) and dividing by the table size (9), the average chain length is derived as 1. The maximum and minimum values are determined by inspecting the populated slots versus empty ones, specifically identifying that slot 0 and others remain empty while specific indices accumulate multiple keys.

Loading lesson…