1,115 views
2 votes
2 votes

Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = kmod 10 and linear probing.

The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.

I am getting 168.


Which of the following is true?

A) In IPv6 broadcasting is used to send packet to every host inside a network.

B) In IPv6 for Path MTU discovery ICMP protocol is used.

C) Flooding always guaranteed to send the packet from source to destination with minimum number of hops.

D) both b and c.

I think it is B).

1 Answer

1 votes
1 votes

for the first one graph will be 

2,13,24,12,62,82

permute the (2,13,24) => 6 ways

i.e

2,13,24,12,62,82

2,24,13,12,62,82

13,2,24,12,62,82

13,24,2,12,62,82

24,13,2,12,62,82

24,2,13,12,62,82

Remaining are 77 and 91

for 77

__2__13__24__12__62__82 => 6 ways

for 91 

__77__2__13__24__12__62__82__ => 8 ways

Total possibilities=6*6*8=288

Related questions

2 votes
2 votes
1 answer
2
omveer asked Aug 27, 2016
2,433 views
A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table ?(A) 100 (B) 200(C) 10000 (D) ...
0 votes
0 votes
1 answer
3
smartmeet asked Feb 8, 2017
4,466 views
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x isa) Less than 1...
0 votes
0 votes
1 answer
4
tishhaagrawal asked Dec 16, 2023
313 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...