Lessons
16 lessons • 1h 31m
Overview of the Course (in Hindi )
3m 08s
What Is the Index of the Bin Into Which the Last Record Is Inserted? (in Hindi)
7m 00s
Hash Function H(K) = K Mod 10 and Linear Probing What Is the Resultant Hash Table?( in Hindi )
5m 41s
Which one of the following gives a possible order in which key values could inserted( in Hindi)
6m 40s
A hash table of size seven, with starting index zero, a hash function (3x + 4)mod7( in Hindi)
5m 49s
The hash function x mod 10, which of the following statements are true?( In Hindi )
6m 10s
A hash table contains 10 buckets and uses linear probing to resolve collisions( in Hindi )
5m 09s
Use the hash function h(x) = (ord(x) – ord (‘a’) +1) mod 10 (in Hindi)
6m 02s
The worst case number of comparison required when the symbol searched is not in table( in Hindi )
5m 57s
Minimum, maximum and average chain size( in Hindi)
5m 20s