Register

MADE EASY TEST SERIES
closed

• closed by
640 views
0 0 votes
closed with the note: Duplicate question

Consider the following keys that are hashed into table in the order given using hash function
h(i) = (2i + 5) mod11
12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5
Assume hash table has location from 0 to 10. If hash table uses chaining to handle the collisions, what is
the probability of new elements ‘x’ fit inside hash table without any collision.

Voting & Accepting an answer helps improve the community
← Previous · Max HeapNext → · Combinations
← Previous in category · No. of Binary treesNext in category → · Reccurence Relation
Position:
Show:

Related questions

3 3 votes
2 2 answers
450
450 views
ShivankXD asked Jan 8
450 views
Made Easy | Programming & Data Structures | TWT-2
A hash table of size 11 using the hash function h(x)=x mod 11 and quadratic probing with hi(x)=(h(x)+i^2)  mod 11 , i∈{0,1,2,…,10}.The key values are given in the followi...
2 2 votes
1 answers 1 answer
284
284 views
ShivankXD asked Jan 8
284 views
Made Easy | Programming & Data Structures | TWT2
Which of the following is/are dynamic data structure?A) Linked listB) StackC) ArrayD) Binary tree
1 1 vote
1 1 answer
363
363 views
harishdewangan asked Aug 12, 2025
363 views
made easy 2019
An implementation of a queue Q, using two S1 and S2 is given below:void enqueue(Q,x){ push(S1,x);}void dequeue(Q,x){ if (stack - empty(S2)) then if(stack- em...
2 2 votes
1 answers 1 answer
537
537 views
harishdewangan asked Aug 6, 2025
537 views
MADE EASY 2024 mock test 3
The number of binary search trees possible with 7 keys 10,20,30,40,50,60,70 such that the key with value 30 is at the second level of the tree is equal to ___________.