I have read that Hash table provides storing/search operations in constant
time.
Is it true?? How to prove it??
I have not found any sort of proof for it...
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
10it60...@iitkgp.ac.in
--
You received this message because you are subscribed to the
good material
On Sat, Sep 3, 2011 at 1:59 PM, payal gupta gpt.pa...@gmail.com wrote:
this might be hlpful...
Regards,
PAYAL GUPTA
On Sat, Sep 3, 2011 at 10:44 AM, Rahul Verma rahulverma@gmail.comwrote:
I am facing some difficulty in the implementation of Hash Table. Anyone
can
I am facing some difficulty in the implementation of Hash Table. Anyone can
please share the good resources for Hash Table?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
#includecstdio
#includemap
#includevector
#includecstdlib
using namespace std;
// It is not advisable to list all elements in this hash table.
#define HASH_SIZE 51439
class HashTable
{
public:
vector maplong long,int table;
HashTable()
{
table = vector maplong long,int (HASH_SIZE);
*A hash table can store a maximum of 10 records, currently there are records
in location 1, 3,4,7,8,9,10. The probability of a new record going into
location 2, with hash functions resolving collisions by linear probing is*
a.0.1 b. 0.6 c. 0.2 d. 0.5
What is the answer? How?
--
You
0.6 is the answer i blv
On 8/11/11, Mani Bharathi manibharat...@gmail.com wrote:
*A hash table can store a maximum of 10 records, currently there are records
in location 1, 3,4,7,8,9,10. The probability of a new record going into
location 2, with hash functions resolving collisions by
how?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/cDA2OA_0FnAJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
Total number of entries=10
The entries that may lead to 2 are 7,8,9,10,1,2
So its 6/10 = 0.6
Paul
On Thu, Aug 11, 2011 at 10:33 PM, Mani Bharathi manibharat...@gmail.comwrote:
how?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
how do u say that they will lead to 2?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/d9eo_cbjCvwJ.
To post to this group, send email to
if the hash function evaluates to 3 or 4 , collision occurs and by linear
probing they are put into 5(nearest free entry). Also 5 and 6 are empty.
But if the hash value points to 7,8,9,10 or 1 , they will be put into
2(nearest free entry).
On Thu, Aug 11, 2011 at 10:53 PM, Mani Bharathi
please help me.. can u tell me regarding written test of De shaw company..
please if anyone knows please tell me.. please
On Thu, Aug 11, 2011 at 10:58 PM, paul suganthan
paul.sugant...@gmail.comwrote:
if the hash function evaluates to 3 or 4 , collision occurs and by linear
probing they are
can we implement random() function on a hash table in O(1) .
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
yes you can... for randomness , the key value will be key=rand() and now
implement your hash function with this key.
On Fri, Aug 5, 2011 at 4:53 PM, Kamakshii Aggarwal kamakshi...@gmail.comwrote:
can we implement random() function on a hash table in O(1) .
--
Regards,
Kamakshi
How can the element be regained from hash table?
On Sat, Aug 6, 2011 at 2:41 AM, mohit verma mohit89m...@gmail.com wrote:
yes you can... for randomness , the key value will be key=rand() and now
implement your hash function with this key.
On Fri, Aug 5, 2011 at 4:53 PM, Kamakshii Aggarwal
Design a hash table to store phone #s. Your job is to write a hash
function that has a parameter username, and generate a key. Username
is unique, length 5 and can be A-Z, 0-9, space. Write a hash function
that generate keys without collisions and use minimum memory.
--
You received this message
15 matches
Mail list logo
