Lesson 1 of 16 â€¢ 60 upvotes â€¢ 3:08 mins

16 lessons â€¢ 1 h 31 m

Overview of the Course (in Hindi )

3:08 mins

What Is the Index of the Bin Into Which the Last Record Is Inserted? (in Hindi)

7:00 mins

Hash Function H(K) = K Mod 10 and Linear Probing What Is the Resultant Hash Table?( in Hindi )

5:41 mins

Which one of the following gives a possible order in which key values could inserted( in Hindi)

6:40 mins

A hash table of size seven, with starting index zero, a hash function (3x + 4)mod7( in Hindi)

5:49 mins

The hash function x mod 10, which of the following statements are true?( In Hindi )

6:10 mins

A hash table contains 10 buckets and uses linear probing to resolve collisions( in Hindi )

5:09 mins

Use the hash function h(x) = (ord(x) â€“ ord (â€˜aâ€™) +1) mod 10 (in Hindi)

6:02 mins

The worst case number of comparison required when the symbol searched is not in table( in Hindi )

5:57 mins

Minimum, maximum and average chain size( in Hindi)

5:20 mins

Which hash function on integers will distribute keys most uniformly (in Hindi )

6:10 mins

Hash function load factor( in Hindi )

6:06 mins

Working modulo q = 11, find spurious through the Rabin Karp matcher( in Hindi )

6:35 mins

What is probability of collision before the table 10% full ?( In Hindi )

5:11 mins

Find the location of key( in Hindi )

5:12 mins

Primary clustering in linear probing( in Hindi )

5:17 mins