good material
On Sat, Sep 3, 2011 at 1:59 PM, payal gupta wrote:
> this might be hlpful...
> Regards,
> PAYAL GUPTA
>
>
> On Sat, Sep 3, 2011 at 10:44 AM, Rahul Verma wrote:
>
>> I am facing some difficulty in the implementation of Hash Table. Anyone
>> can please share the good resources for Ha
#include
#include
#include
#include
using namespace std;
// It is not advisable to list all elements in this hash table.
#define HASH_SIZE 51439
class HashTable
{
public:
vector< map > table;
HashTable()
{
table = vector< map >(HASH_SIZE);
}
int hashF(long long key)
{
if( ke
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
wrote:
> if the hash function evaluates to 3 or 4 , collision occurs and by linear
> probing they are put into 5(nearest free
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 wrote:
>
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 algogeeks@googlegr
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 wrote:
> how?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussio
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
0.6 is the answer i blv
On 8/11/11, Mani Bharathi 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 linear probing is*
>
> a
How can the element be regained from hash table?
On Sat, Aug 6, 2011 at 2:41 AM, mohit verma 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
> wrote:
>
>> can
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 wrote:
> can we implement random() function on a hash table in O(1) .
>
> --
> Regards,
> Kamakshi
> kamakshi...@gmail.com
>
> --
10 matches
Mail list logo
