search
Log In
2 votes
220 views
How do you compare associativity (in cache) to chaining in hash table?
in Revision 220 views

1 Answer

1 vote
In Associative Cache, all main memory blocks goes to same slot using function K mod N, same thing in chaining. K is main memory block no, N number of Cache Lines. If number of cache lines and number of slots in hash map are same, then there is direct relation ship between them.

Related questions

10 votes
5 answers
1
2.6k views
Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted that at least a chain of size 3 is created? (Assume simple uniform hashing is used) $m^{–2}$ $m^{–4}$ $m^{–3} (m – 1)$ $3m^{–1}$
asked Jul 20, 2015 in Algorithms radha gogia 2.6k views
0 votes
1 answer
2
127 views
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
asked Jun 26, 2015 in CO and Architecture Sourabh Kumar 127 views
0 votes
2 answers
3
190 views
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
asked Jun 26, 2015 in CO and Architecture Sourabh Kumar 190 views
1 vote
3 answers
4
346 views
The number of different insertion sequences of numbers $\left \{ 7,20,32,50,66,77 \right \}$ on an initially empty hash table H of size $6$ and a hash function $h\left ( k \right )=k\mod6$ with linear probing scheme for collision resolution such that the hash table obtained after the insertion looks as ... ${\color{Blue} {2}}$ ${\color{Blue} {3}}$. ${\color{Blue} {4}}$ ${\color{Blue} {5}}$
asked Jan 16, 2019 in DS srestha 346 views
...