menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Feedback to GATE Overflow Test Takers
GATE 2021 – Online registration portal
IIT Madras MS CS Interview Experience - 2020
JEST TCS (Theoretical Computer Science) EXAM || Gateway of IISc other than GATE exam
Divisibility language and Minimum Number of States in a DFA accepting a binary number divisible by 'n'
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Others
(1.2k)
Study Resources
(143)
GATE Application
(40)
Revision
(40)
Admissions
(595)
Exam Queries
(1k)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(873)
Recent Blog Comments
What was you GATE score and rank? Did they ask...
Thanks for sharing this useful and informative...
hello mrinmoy brother , what was your rank in...
I got access to test series. Thank you.
yes i know .....was just simply asking .....is...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
How do you compare associativity (in cache) to chaining in hash table?
2
votes
220
views
How do you compare associativity (in cache) to chaining in hash table?
hashing
associative-memory
asked
Jan 11, 2016
in
Revision
Arjun
220
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
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.
answered
Mar 27, 2016
Aryan
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
Next Qn. in Sub. →
Related questions
10
votes
5
answers
1
2.6k
views
Consider a hash table with ‘m’ slots that uses chaining for collision resolution.
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
data-structures
hashing
0
votes
1
answer
2
127
views
set associativity / full associativity
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
asked
Jun 26, 2015
in
CO and Architecture
Sourabh Kumar
127
views
associative-memory
0
votes
2
answers
3
190
views
set associativity / full associativity
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
asked
Jun 26, 2015
in
CO and Architecture
Sourabh Kumar
190
views
associative-memory
1
vote
3
answers
4
346
views
Insertion in Hash table. (M.E.)
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 ... ${\color{Blue} {2}}$ ${\color{Blue} {3}}$. ${\color{Blue} {4}}$ ${\color{Blue} {5}}$
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
hashing
data-structures
...