[algogeeks] Re: Hashing vs trie

2011-08-14 Thread Raman
My doubt: If we use hashing, then how do we map a string. I am using C. -- 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/-/aURuTmAx6jEJ. To post to this group,

[algogeeks] Re: Hashing with strings

2011-07-26 Thread Don
A string hash function typically takes a string as an argument and returns an integer which can be used as an index into a hash table which allows it to be found quickly. The purpose is to relate a string to something else in an efficient way. For instance, a symbol table which stores variable

[algogeeks] Re: Hashing with strings

2011-07-26 Thread syl
thanks for the info...i saw a method of using 4 bytes of string together and then add them and finally take a modulusdoing such a complex thing ...is thr any way to recover the string back using the key only.can you give an example where you have seen using hashing with strings...that

Re: [algogeeks] Re: Hashing with strings

2011-07-26 Thread Puneet Gautam
Doing such a complex thing reduces collisions and makes hashing effective.. Well, I didnt get you fully on dat 4 bytes of string together ... I think u should refer to Article 6.6, Chapter 6(Structures) in The C programming Language by Dennis Rtchie book.. Its very well explained there...!! The

[algogeeks] Re: Hashing with strings

2011-07-26 Thread Don
Usually a hash function is one-way, meaning that you can't recover the original string. That is because there are many more possible values for the string than for the hash index, making the hash function a many-to-one relationship. A very common hash function which I believe was mentioned in

Re: [algogeeks] Re: hashing

2010-06-11 Thread Rishi Agrawal
Hi All, For if max is 1 then we do not need to read the bits after 14th place. 1(dec) = 1001110001 (bin) that is 14 bits. On Fri, Jun 11, 2010 at 12:08 AM, kirubakaran kirubakaran1...@gmail.comwrote: When it is a stream of data,counting is a best way to go ! On Jun 10, 7:54

[algogeeks] Re: hashing

2010-06-10 Thread kirubakaran
When it is a stream of data,counting is a best way to go ! On Jun 10, 7:54 am, Anurag Sharma anuragvic...@gmail.com wrote: Even if you use bucket sort, you will have to store the numbers arriving, or atleast 1..1 numbers along with their count. If you reduce the size of the bucket further

[algogeeks] Re: Hashing problem with collision

2010-01-10 Thread Vijay
Thanks all for help. On Jan 8, 6:07 pm, me13013 me13...@gmail.com wrote: On Jan 7, 10:10 am, Vijay hello_mis...@rediffmail.com wrote: Can you please tell me what will be the contains of Hash table and how searching works? Lets say, we have one data like Key       Data ===

[algogeeks] Re: Hashing problem with collision

2010-01-08 Thread me13013
On Jan 7, 10:10 am, Vijay hello_mis...@rediffmail.com wrote: Can you please tell me what will be the contains of Hash table and how searching works? Lets say, we have one data like Key       Data === IP1 -  Sys1 IP8    Sys8 IP2    Sys2 Lets say, there are keys  IP1 and IP8. and

[algogeeks] Re: Hashing problem with collision

2010-01-07 Thread Geoffrey Summerhayes
On Jan 6, 2:54 pm, Vijay hello_mis...@rediffmail.com wrote: Hi All, I have one question about Hashing. Say I have one Hash table where index Hash_function(key) function will return index value of corresponding string/key. Hash_insert(key) function it will take key and get converted index

[algogeeks] Re: Hashing problem with collision

2010-01-07 Thread Vijay
Thanks for response. Can you please tell me what will be the contains of Hash table and how searching works? Lets say, we have one data like Key Data === IP1 - Sys1 IP8Sys8 IP2Sys2 Lets say, there are keys IP1 and IP8. and Hash_function will return 1 as index for both so

[algogeeks] Re: Hashing problem with collision

2010-01-07 Thread Geoffrey Summerhayes
On Jan 7, 10:10 am, Vijay hello_mis...@rediffmail.com wrote: Thanks for response. Can you please tell me what will be the contains of Hash table and how searching works? Lets say, we have one data like Key       Data === IP1 -  Sys1 IP8    Sys8 IP2    Sys2 Lets say, there

[algogeeks] Re: Hashing Algo

2007-11-10 Thread MartinH
On Nov 9, 6:10 pm, Rajat Gogri [EMAIL PROTECTED] wrote: Hello, I was asked this question for MSFT interview. You are given Symbols for stock ticker application, All are 4 character , Capital letters only so min is and max is . for example MSFT, GOOG etcetc How will you hash

[algogeeks] Re: Hashing Algo

2007-11-10 Thread MartinH
On Nov 10, 4:53 pm, MartinH [EMAIL PROTECTED] wrote: On Nov 9, 6:10 pm, Rajat Gogri [EMAIL PROTECTED] wrote: I was asked this question for MSFT interview. You are given Symbols for stock ticker application, How will you hash it??? Personally I would call above a *vector table* not a

[algogeeks] Re: Hashing

2007-03-16 Thread Dhruva Sagar
which hashing algorithm would you like to know in particular? There are several hashing algorithms available for c++, you may simnply search for the libraries and look at the API. On 3/16/07, vijay bhaskar [EMAIL PROTECTED] wrote: i like to learn about hashes. how to hashing and using Hash