Gate 2010

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/hashing/open-addressing-probing/asset-gate-2010-4815 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | 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. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a solution to a GATE 2010 computer science problem involving hash tables. The problem specifies a hash table of length 10 using open addressing with linear probing and the hash function h(k) = k mod 10. The goal is to determine the insertion order of six keys given the final table state. The instructor begins by listing the provided options and analyzing the hash values for each key present in the table: 42, 23, 34, 52, 46, and 33. He calculates their initial positions: 42 and 52 map to index 2, 23 and 33 map to index 3, 34 maps to index 4, and 46 maps to index 6. He observes that 52 and 33 are displaced from their primary hash positions because indices 2 and 3 are occupied by 42 and 23 respectively. This observation is crucial for eliminating incorrect options.

Chapters

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

    The instructor reads the problem statement and displays the hash table with values at indices 2, 3, 4, 5, 6, and 7. He writes down the hash function h(k) = k mod 10 and calculates the primary hash index for each key: 42->2, 23->3, 34->4, 52->2, 46->6, 33->3. He notes that 52 and 33 must have probed further because their target slots were occupied. He starts evaluating the options, specifically looking at the order of insertion to see if it results in the observed displacements. He marks option (A) as incorrect because inserting 52 before 23 would place 52 at index 3, contradicting the table.

  2. 2:00 – 2:51 02:00-02:51

    The instructor focuses on verifying option (C): 46, 34, 42, 23, 52, 33. He simulates the insertion process step-by-step. First, 46 goes to index 6. Then 34 goes to index 4. Next, 42 goes to index 2. Then 23 goes to index 3. When 52 is inserted, it hashes to 2 (occupied by 42), probes 3 (occupied by 23), probes 4 (occupied by 34), and lands at index 5. Finally, 33 hashes to 3 (occupied by 23), probes 4, 5, 6 (occupied by 46), and lands at index 7. This sequence perfectly matches the final table configuration shown in the problem. He concludes that option (C) is the correct answer.

The lesson effectively teaches how to validate insertion sequences in hash tables with linear probing. By calculating initial hash positions and simulating the probing sequence for each candidate option, one can determine the valid order. The key takeaway is that displaced elements must find the first available slot after their primary hash index, skipping over previously inserted elements.

Loading lesson…